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 4459
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 3064 . 2 (∃𝑥𝐴 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜑)
2 r19.3rzv 4457 . . 3 (𝐴 ≠ ∅ → (¬ 𝜑 ↔ ∀𝑥𝐴 ¬ 𝜑))
32con1bid 355 . 2 (𝐴 ≠ ∅ → (¬ ∀𝑥𝐴 ¬ 𝜑𝜑))
41, 3bitr2id 284 1 (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wne 2933  wral 3052  wrex 3061  c0 4286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-ne 2934  df-ral 3053  df-rex 3062  df-dif 3905  df-nul 4287
This theorem is referenced by:  r19.45zv  4462  r19.44zv  4463  r19.36zv  4466  iunconst  4957  lcmgcdlem  16537  pmtrprfvalrn  19421  dvdsr02  20312  voliune  34388  dya2iocuni  34442  filnetlem4  36577  prmunb2  44619
  Copyright terms: Public domain W3C validator