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

Theorem r19.9rzv 4523
Description: Restricted quantification of wff not containing quantified variable. (Contributed by NM, 27-May-1998.)
Assertion
Ref Expression
r19.9rzv (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥𝐴 𝜑))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Proof of Theorem r19.9rzv
StepHypRef Expression
1 dfrex2 3079 . 2 (∃𝑥𝐴 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜑)
2 r19.3rzv 4522 . . 3 (𝐴 ≠ ∅ → (¬ 𝜑 ↔ ∀𝑥𝐴 ¬ 𝜑))
32con1bid 355 . 2 (𝐴 ≠ ∅ → (¬ ∀𝑥𝐴 ¬ 𝜑𝜑))
41, 3bitr2id 284 1 (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wne 2946  wral 3067  wrex 3076  c0 4352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-9 2118  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-ne 2947  df-ral 3068  df-rex 3077  df-dif 3979  df-nul 4353
This theorem is referenced by:  r19.45zv  4526  r19.44zv  4527  r19.36zv  4530  iunconst  5024  lcmgcdlem  16653  pmtrprfvalrn  19530  dvdsr02  20398  voliune  34193  dya2iocuni  34248  filnetlem4  36347  prmunb2  44280
  Copyright terms: Public domain W3C validator