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