MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rr19.3v Unicode version

Theorem rr19.3v 2911
Description: Restricted quantifier version of Theorem 19.3 of [Margaris] p. 89. We don't need the non-empty class condition of r19.3rzv 3549 when there is an outer quantifier. (Contributed by NM, 25-Oct-2012.)
Assertion
Ref Expression
rr19.3v  |-  ( A. x  e.  A  A. y  e.  A  ph  <->  A. x  e.  A  ph )
Distinct variable groups:    y, A    x, y    ph, y
Allowed substitution hints:    ph( x)    A( x)

Proof of Theorem rr19.3v
StepHypRef Expression
1 biidd 230 . . . 4  |-  ( y  =  x  ->  ( ph 
<-> 
ph ) )
21rspcv 2882 . . 3  |-  ( x  e.  A  ->  ( A. y  e.  A  ph 
->  ph ) )
32ralimia 2618 . 2  |-  ( A. x  e.  A  A. y  e.  A  ph  ->  A. x  e.  A  ph )
4 ax-1 7 . . . 4  |-  ( ph  ->  ( y  e.  A  ->  ph ) )
54ralrimiv 2627 . . 3  |-  ( ph  ->  A. y  e.  A  ph )
65ralimi 2620 . 2  |-  ( A. x  e.  A  ph  ->  A. x  e.  A  A. y  e.  A  ph )
73, 6impbii 182 1  |-  ( A. x  e.  A  A. y  e.  A  ph  <->  A. x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 178    = wceq 1624    e. wcel 1685   A.wral 2545
This theorem is referenced by:  ispos2  14077
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2266
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ral 2550  df-v 2792
  Copyright terms: Public domain W3C validator