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