Theorem exsimpr 1667

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 1649	1 ⊢ (∃𝑥(𝜑 ∧ 𝜓) → ∃𝑥𝜓)

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

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 1496  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559  ax-ial 1583

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  cbvexv1  1801  onm  4522  imassrn  5112  eliotaeu  5341  fv3  5693  relelfvdm  5702  nfvres  5706  brtpos2  6482  finacn  7511  cc1  7579  acnccim  7586  omiunct  13195