Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Abbreviated conjunction and disjunction of three wff's
simp1l
Next ⟩
simp1r
Metamath Proof Explorer
Ascii
Structured
Theorem
simp1l
Description:
Simplification of triple conjunction.
(Contributed by
NM
, 9-Nov-2011)
Ref
Expression
Assertion
simp1l
⊢
( ( (
𝜑
∧
𝜓
) ∧
𝜒
∧
𝜃
) →
𝜑
)
Proof
Step
Hyp
Ref
Expression
1
simpl
⊢
( (
𝜑
∧
𝜓
) →
𝜑
)
2
1
3ad2ant1
⊢
( ( (
𝜑
∧
𝜓
) ∧
𝜒
∧
𝜃
) →
𝜑
)