Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj89 Unicode version

Theorem bnj89 29063
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj89.1  |-  Z  e. 
_V
Assertion
Ref Expression
bnj89  |-  ( [. Z  /  y ]. E! x ph  <->  E! x [. Z  /  y ]. ph )
Distinct variable groups:    x, Z    x, y
Allowed substitution hints:    ph( x, y)    Z( y)

Proof of Theorem bnj89
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 bnj89.1 . . . 4  |-  Z  e. 
_V
2 sbcexg 3054 . . . 4  |-  ( Z  e.  _V  ->  ( [. Z  /  y ]. E. w A. x
( ph  <->  x  =  w
)  <->  E. w [. Z  /  y ]. A. x ( ph  <->  x  =  w ) ) )
31, 2ax-mp 8 . . 3  |-  ( [. Z  /  y ]. E. w A. x ( ph  <->  x  =  w )  <->  E. w [. Z  /  y ]. A. x ( ph  <->  x  =  w ) )
4 sbcalg 3052 . . . . 5  |-  ( Z  e.  _V  ->  ( [. Z  /  y ]. A. x ( ph  <->  x  =  w )  <->  A. x [. Z  /  y ]. ( ph  <->  x  =  w ) ) )
51, 4ax-mp 8 . . . 4  |-  ( [. Z  /  y ]. A. x ( ph  <->  x  =  w )  <->  A. x [. Z  /  y ]. ( ph  <->  x  =  w ) )
65exbii 1572 . . 3  |-  ( E. w [. Z  / 
y ]. A. x (
ph 
<->  x  =  w )  <->  E. w A. x [. Z  /  y ]. ( ph 
<->  x  =  w ) )
7 sbcbig 3050 . . . . . . 7  |-  ( Z  e.  _V  ->  ( [. Z  /  y ]. ( ph  <->  x  =  w )  <->  ( [. Z  /  y ]. ph  <->  [. Z  / 
y ]. x  =  w ) ) )
81, 7ax-mp 8 . . . . . 6  |-  ( [. Z  /  y ]. ( ph 
<->  x  =  w )  <-> 
( [. Z  /  y ]. ph  <->  [. Z  /  y ]. x  =  w
) )
9 sbcg 3069 . . . . . . . 8  |-  ( Z  e.  _V  ->  ( [. Z  /  y ]. x  =  w  <->  x  =  w ) )
101, 9ax-mp 8 . . . . . . 7  |-  ( [. Z  /  y ]. x  =  w  <->  x  =  w
)
1110bibi2i 304 . . . . . 6  |-  ( (
[. Z  /  y ]. ph  <->  [. Z  /  y ]. x  =  w
)  <->  ( [. Z  /  y ]. ph  <->  x  =  w ) )
128, 11bitri 240 . . . . 5  |-  ( [. Z  /  y ]. ( ph 
<->  x  =  w )  <-> 
( [. Z  /  y ]. ph  <->  x  =  w
) )
1312albii 1556 . . . 4  |-  ( A. x [. Z  /  y ]. ( ph  <->  x  =  w )  <->  A. x
( [. Z  /  y ]. ph  <->  x  =  w
) )
1413exbii 1572 . . 3  |-  ( E. w A. x [. Z  /  y ]. ( ph 
<->  x  =  w )  <->  E. w A. x (
[. Z  /  y ]. ph  <->  x  =  w
) )
153, 6, 143bitri 262 . 2  |-  ( [. Z  /  y ]. E. w A. x ( ph  <->  x  =  w )  <->  E. w A. x ( [. Z  /  y ]. ph  <->  x  =  w ) )
16 df-eu 2160 . . . 4  |-  ( E! x ph  <->  E. w A. x ( ph  <->  x  =  w ) )
1716sbcbiiOLD 3060 . . 3  |-  ( Z  e.  _V  ->  ( [. Z  /  y ]. E! x ph  <->  [. Z  / 
y ]. E. w A. x ( ph  <->  x  =  w ) ) )
181, 17ax-mp 8 . 2  |-  ( [. Z  /  y ]. E! x ph  <->  [. Z  /  y ]. E. w A. x
( ph  <->  x  =  w
) )
19 df-eu 2160 . 2  |-  ( E! x [. Z  / 
y ]. ph  <->  E. w A. x ( [. Z  /  y ]. ph  <->  x  =  w ) )
2015, 18, 193bitr4i 268 1  |-  ( [. Z  /  y ]. E! x ph  <->  E! x [. Z  /  y ]. ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 176   A.wal 1530   E.wex 1531    = wceq 1632    e. wcel 1696   E!weu 2156   _Vcvv 2801   [.wsbc 3004
This theorem is referenced by:  bnj130  29222  bnj207  29229
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-eu 2160  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803  df-sbc 3005
  Copyright terms: Public domain W3C validator