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

Theorem r19.27zv 4023
 Description: Restricted quantifier version of Theorem 19.27 of [Margaris] p. 90. It is valid only when the domain of quantification is not empty. (Contributed by NM, 19-Aug-2004.)
Assertion
Ref Expression
r19.27zv (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑𝜓)))
Distinct variable groups:   𝑥,𝐴   𝜓,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem r19.27zv
StepHypRef Expression
1 nfv 1830 . 2 𝑥𝜓
21r19.27z 4022 1 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝜑𝜓) ↔ (∀𝑥𝐴 𝜑𝜓)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ≠ wne 2780  ∀wral 2896  ∅c0 3874 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-v 3175  df-dif 3543  df-nul 3875 This theorem is referenced by:  txflf  21620  dfso3  30856  dibglbN  35473
 Copyright terms: Public domain W3C validator