Metamath Proof Explorer


Theorem exsimpr

Description: Simplification of an existentially quantified conjunction. (Contributed by Rodolfo Medina, 25-Sep-2010) (Proof shortened by Andrew Salmon, 29-Jun-2011)

Ref Expression
Assertion exsimpr ⊢ ∃ x φ ∧ ψ → ∃ x ψ

Proof

Step Hyp Ref Expression
1 simpr ⊢ φ ∧ ψ → ψ
2 1 eximi ⊢ ∃ x φ ∧ ψ → ∃ x ψ