Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  r19.36zv Unicode version

Theorem r19.36zv 3460
 Description: Restricted quantifier version of Theorem 19.36 of [Margaris] p. 90. It is valid only when the domain of quantification is not empty. (Contributed by NM, 20-Sep-2003.)
Assertion
Ref Expression
r19.36zv
Distinct variable groups:   ,   ,
Allowed substitution hint:   ()

Proof of Theorem r19.36zv
StepHypRef Expression
1 r19.9rzv 3454 . . 3
21imbi2d 309 . 2
3 r19.35 2649 . 2
42, 3syl6rbbr 257 1
 Colors of variables: wff set class Syntax hints:   wi 6   wb 178   wne 2412  wral 2509  wrex 2510  c0 3362 This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-ral 2513  df-rex 2514  df-v 2729  df-dif 3081  df-nul 3363
 Copyright terms: Public domain W3C validator