Theorem exsimpr 1902

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

Assertion

Ref	Expression
exsimpr	⊢ (∃𝑥(𝜑 ∧ 𝜓) → ∃𝑥𝜓)

Proof of Theorem exsimpr

Step	Hyp	Ref	Expression
1		simpr 490	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
2	1	eximi 1868	1 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → ∃𝑥𝜓)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by:  19.40  1919  elex2  2838  rexex  3093  imassrnOLD  6069  fv3  6901  elirrvOLD  9585  finacn  10122  dfac4  10194  kmlem2  10223  ac6c5  10553  ac6s3  10558  ac6s5  10562  axnulALT3  35722  bj-finsumval0  38186  mptsnunlem  38241  topdifinffinlem  38250  heiborlem3  38727  ac6s3f  39083  moantr  39284