Theorem exsimpr 1666

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

Syntax hints:   → wi 4   ∧ wa 104  ∃wex 1540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1495  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-4 1558  ax-ial 1582

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  cbvexv1  1799  onm  4500  imassrn  5089  eliotaeu  5317  fv3  5665  relelfvdm  5674  nfvres  5678  brtpos2  6422  finacn  7424  cc1  7489  acnccim  7496  omiunct  13088