ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rexn0 GIF version

Theorem rexn0 3513
Description: Restricted existential quantification implies its restriction is nonempty (it is also inhabited as shown in rexm 3514). (Contributed by Szymon Jaroszewicz, 3-Apr-2007.)
Assertion
Ref Expression
rexn0 (∃𝑥𝐴 𝜑𝐴 ≠ ∅)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rexn0
StepHypRef Expression
1 ne0i 3421 . . 3 (𝑥𝐴𝐴 ≠ ∅)
21a1d 22 . 2 (𝑥𝐴 → (𝜑𝐴 ≠ ∅))
32rexlimiv 2581 1 (∃𝑥𝐴 𝜑𝐴 ≠ ∅)
Colors of variables: wff set class
Syntax hints:  wi 4  wcel 2141  wne 2340  wrex 2449  c0 3414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-nul 3415
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator