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

Theorem reximdva0 4306
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 4303 . . 3 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
2 reximdva0.1 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝜓)
32ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐴 → 𝜓))
43ancld 560 . . . . 5 (𝜑 → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝜓)))
54eximdv 1952 . . . 4 (𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)))
65imp 412 . . 3 ((𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
71, 6sylan2b 606 . 2 ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
8 df-rex 3091 . 2 (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
97, 8sylibr 237 1 ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090  ∅c0 4281
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 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-ne 2960  df-rex 3091  df-dif 4050  df-nul 4282
This theorem is used by:  n0snor2el  4791  f1cdmsn  7313  hashgt12el  14594  ssdifidllem  21670  refun0  23864  cstucnd  24632  supxrnemnf  33430  kerunit  33956  ssmxidllem  34068  constrfiss  34453  elpaddn0  41049  nelsubclem  50386  thinciso  50810
  Copyright terms: Public domain W3C validator