Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Abbreviated conjunction and disjunction of three wff's
3anidm23
Next ⟩
syl2an3an
Metamath Proof Explorer
Ascii
Unicode
Theorem
3anidm23
Description:
Inference from idempotent law for conjunction.
(Contributed by
NM
, 1-Feb-2007)
Ref
Expression
Hypothesis
3anidm23.1
⊢
φ
∧
ψ
∧
ψ
→
χ
Assertion
3anidm23
⊢
φ
∧
ψ
→
χ
Proof
Step
Hyp
Ref
Expression
1
3anidm23.1
⊢
φ
∧
ψ
∧
ψ
→
χ
2
1
3expa
⊢
φ
∧
ψ
∧
ψ
→
χ
3
2
anabss3
⊢
φ
∧
ψ
→
χ