Theorem reximdva0 4303

Description: Restricted existence deduced from nonempty class. (Contributed by NM, 1-Feb-2012.)

Hypothesis

Ref	Expression
reximdva0.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓)

Assertion

Ref	Expression
reximdva0	⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓)

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem reximdva0

Step	Hyp	Ref	Expression
1		n0 4300	. . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
2		reximdva0.1	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓)
3	2	ex 418	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜓))
4	3	ancld 560	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝜓)))
5	4	eximdv 1950	. . . 4 ⊢ (𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)))
6	5	imp 412	. . 3 ⊢ ((𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
7	1, 6	sylan2b 606	. 2 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
8		df-rex 3088	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
9	7, 8	sylibr 237	1 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  ∃wrex 3087  ∅c0 4279

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-ne 2957  df-rex 3088  df-dif 3902  df-nul 4280

This theorem is used by:  n0snor2el  4793  f1cdmsn  7282  hashgt12el  14547  ssdifidllem  21620  refun0  23814  cstucnd  24582  supxrnemnf  33342  kerunit  33868  ssmxidllem  33980  constrfiss  34365  elpaddn0  40825  nelsubclem  50119  thinciso  50522