Theorem exsimpr 1870

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 484	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
2	1	eximi 1836	1 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → ∃𝑥𝜓)

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1780

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781

This theorem is referenced by:  19.40  1887  elex2  2808  rexex  3062  ceqsexv2dOLD  3489  imassrn  6020  fv3  6840  elirrv  9483  finacn  9941  dfac4  10013  kmlem2  10043  ac6c5  10373  ac6s3  10378  ac6s5  10382  axnulALT2  35118  bj-finsumval0  37325  mptsnunlem  37378  topdifinffinlem  37387  heiborlem3  37859  ac6s3f  38217  moantr  38398