MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reximdva0 Structured version   Visualization version   GIF version

Theorem reximdva0 4302
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
StepHypRef Expression
1 n0 4299 . . 3 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
2 reximdva0.1 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓)
32ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐴 → 𝜓))
43ancld 560 . . . . 5 (𝜑 → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝜓)))
54eximdv 1949 . . . 4 (𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)))
65imp 412 . . 3 ((𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
71, 6sylan2b 606 . 2 ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
8 df-rex 3087 . 2 (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
97, 8sylibr 237 1 ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  ∅c0 4278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-ne 2956  df-rex 3087  df-dif 4047  df-nul 4279
This theorem is used by:  n0snor2el  4787  f1cdmsn  7290  hashgt12el  14570  ssdifidllem  21645  refun0  23839  cstucnd  24607  supxrnemnf  33406  kerunit  33932  ssmxidllem  34044  constrfiss  34429  elpaddn0  40950  nelsubclem  50274  thinciso  50698
  Copyright terms: Public domain W3C validator