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