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

Theorem r19.36zv 3720
 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 3714 . . 3
21imbi2d 308 . 2
3 r19.35 2847 . 2
42, 3syl6rbbr 256 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wne 2598  wral 2697  wrex 2698  c0 3620 This theorem is referenced by:  usgfiregdegfi  28314 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-v 2950  df-dif 3315  df-nul 3621
 Copyright terms: Public domain W3C validator