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