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

Theorem rexn0 4462
Description: Restricted existential quantification implies its restriction is nonempty. (Contributed by Szymon Jaroszewicz, 3-Apr-2007.) Avoid df-clel 2841, ax-8 2148. (Revised by GG, 2-Sep-2024.)
Assertion
Ref Expression
rexn0 (∃𝑥𝐴 𝜑𝐴 ≠ ∅)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rexn0
StepHypRef Expression
1 dfrex2 3095 . . 3 (∃𝑥𝐴 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜑)
2 rzal 4460 . . . 4 (𝐴 = ∅ → ∀𝑥𝐴 ¬ 𝜑)
32con3i 155 . . 3 (¬ ∀𝑥𝐴 ¬ 𝜑 → ¬ 𝐴 = ∅)
41, 3sylbi 220 . 2 (∃𝑥𝐴 𝜑 → ¬ 𝐴 = ∅)
54neqned 2968 1 (∃𝑥𝐴 𝜑𝐴 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wne 2961  wral 3082  wrex 3092  c0 4289
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 2156  ax-ext 2738
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 2745  df-cleq 2758  df-ne 2962  df-ral 3083  df-rex 3093  df-dif 3911  df-nul 4290
This theorem is used by:  r19.2zb  4466  2reu4  4490  reusv2lem3  5376  eusvobj2  7415  isdrs2  18387  ismnd  18824  slwn0  19716  lbsexg  21325  iunconn  23622  ltsn0  28136  grpon0  30891  filbcmb  38432  isbnd2  38475  rencldnfi  43589  iunconnlem2  45684  stoweidlem14  46769  hoidmvval0  47342  thinciso  50289  ralsn0d  50616  alsralrex  50631  alsraln0  50632
  Copyright terms: Public domain W3C validator