Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Abbreviated conjunction and disjunction of three wff's
simp32l
Next ⟩
simp32r
Metamath Proof Explorer
Ascii
Unicode
Theorem
simp32l
Description:
Simplification of conjunction.
(Contributed by
NM
, 9-Mar-2012)
Ref
Expression
Assertion
simp32l
⊢
τ
∧
η
∧
χ
∧
φ
∧
ψ
∧
θ
→
φ
Proof
Step
Hyp
Ref
Expression
1
simp2l
⊢
χ
∧
φ
∧
ψ
∧
θ
→
φ
2
1
3ad2ant3
⊢
τ
∧
η
∧
χ
∧
φ
∧
ψ
∧
θ
→
φ