Database
CLASSICAL FIRST-ORDER LOGIC WITH EQUALITY
Propositional calculus
Logical conjunction
simprll
Next ⟩
simprlr
Metamath Proof Explorer
Ascii
Unicode
Theorem
simprll
Description:
Simplification of a conjunction.
(Contributed by
Jeff Hankins
, 28-Jul-2009)
Ref
Expression
Assertion
simprll
⊢
φ
∧
ψ
∧
χ
∧
θ
→
ψ
Proof
Step
Hyp
Ref
Expression
1
simpl
⊢
ψ
∧
χ
→
ψ
2
1
ad2antrl
⊢
φ
∧
ψ
∧
χ
∧
θ
→
ψ