Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Abbreviated conjunction and disjunction of three wff's
simp3l
Next ⟩
simp3r
Metamath Proof Explorer
Ascii
Structured
Theorem
simp3l
Description:
Simplification of triple conjunction.
(Contributed by
NM
, 9-Nov-2011)
Ref
Expression
Assertion
simp3l
⊢
( (
𝜑
∧
𝜓
∧ (
𝜒
∧
𝜃
) ) →
𝜒
)
Proof
Step
Hyp
Ref
Expression
1
simpl
⊢
( (
𝜒
∧
𝜃
) →
𝜒
)
2
1
3ad2ant3
⊢
( (
𝜑
∧
𝜓
∧ (
𝜒
∧
𝜃
) ) →
𝜒
)