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 4471
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 3099 . 2 (∃𝑥𝐴 𝜑 ↔ ¬ ∀𝑥𝐴 ¬ 𝜑)
2 r19.3rzv 4469 . . 3 (𝐴 ≠ ∅ → (¬ 𝜑 ↔ ∀𝑥𝐴 ¬ 𝜑))
32con1bid 358 . 2 (𝐴 ≠ ∅ → (¬ ∀𝑥𝐴 ¬ 𝜑𝜑))
41, 3bitr2id 287 1 (𝐴 ≠ ∅ → (𝜑 ↔ ∃𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wne 2965  wral 3086  wrex 3096  c0 4294
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-9 2160  ax-ext 2742
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-ne 2966  df-ral 3087  df-rex 3097  df-dif 3916  df-nul 4295
This theorem is referenced by:  r19.45zv  4474  r19.44zv  4475  r19.36zv  4478  iunconst  4971  lcmgcdlem  16667  pmtrprfvalrn  19561  dvdsr02  20457  voliune  34589  dya2iocuni  34643  filnetlem4  36840  prmunb2  44973
  Copyright terms: Public domain W3C validator