New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  rr19.3v Unicode version

Theorem rr19.3v 2980
 Description: Restricted quantifier version of Theorem 19.3 of [Margaris] p. 89. We don't need the nonempty class condition of r19.3rzv 3643 when there is an outer quantifier. (Contributed by NM, 25-Oct-2012.)
Assertion
Ref Expression
rr19.3v
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem rr19.3v
StepHypRef Expression
1 biidd 228 . . . 4
21rspcv 2951 . . 3
32ralimia 2687 . 2
4 ax-1 6 . . . 4
54ralrimiv 2696 . . 3
65ralimi 2689 . 2
73, 6impbii 180 1
 Colors of variables: wff setvar class Syntax hints:   wb 176   wceq 1642   wcel 1710  wral 2614 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-v 2861 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator