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

Theorem r19.36zv 3567
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  |-  ( A  =/=  (/)  ->  ( E. x  e.  A  ( ph  ->  ps )  <->  ( A. x  e.  A  ph  ->  ps ) ) )
Distinct variable groups:    x, A    ps, x
Allowed substitution hint:    ph( x)

Proof of Theorem r19.36zv
StepHypRef Expression
1 r19.9rzv 3561 . . 3  |-  ( A  =/=  (/)  ->  ( ps  <->  E. x  e.  A  ps ) )
21imbi2d 307 . 2  |-  ( A  =/=  (/)  ->  ( ( A. x  e.  A  ph 
->  ps )  <->  ( A. x  e.  A  ph  ->  E. x  e.  A  ps ) ) )
3 r19.35 2700 . 2  |-  ( E. x  e.  A  (
ph  ->  ps )  <->  ( A. x  e.  A  ph  ->  E. x  e.  A  ps ) )
42, 3syl6rbbr 255 1  |-  ( A  =/=  (/)  ->  ( E. x  e.  A  ( ph  ->  ps )  <->  ( A. x  e.  A  ph  ->  ps ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    =/= wne 2459   A.wral 2556   E.wrex 2557   (/)c0 3468
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-v 2803  df-dif 3168  df-nul 3469
  Copyright terms: Public domain W3C validator