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