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