Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Logical conjunction
simplr
Next ⟩
simplrd
Metamath Proof Explorer
Ascii
Structured
Theorem
simplr
Description:
Simplification of a conjunction.
(Contributed by
NM
, 20-Mar-2007)
Ref
Expression
Assertion
simplr
⊢
( ( (
𝜑
∧
𝜓
) ∧
𝜒
) →
𝜓
)
Proof
Step
Hyp
Ref
Expression
1
id
⊢
(
𝜓
→
𝜓
)
2
1
ad2antlr
⊢
( ( (
𝜑
∧
𝜓
) ∧
𝜒
) →
𝜓
)