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

Theorem sbcralt 3412
Description: Interchange class substitution and restricted quantifier. (Contributed by NM, 1-Mar-2008.) (Revised by David Abernethy, 22-Feb-2010.)
Assertion
Ref Expression
sbcralt  |-  ( ( A  e.  V  /\  F/_ y A )  -> 
( [. A  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [. A  /  x ]. ph )
)
Distinct variable groups:    x, y    x, B
Allowed substitution hints:    ph( x, y)    A( x, y)    B( y)    V( x, y)

Proof of Theorem sbcralt
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 sbcco 3354 . 2  |-  ( [. A  /  z ]. [. z  /  x ]. A. y  e.  B  ph  <->  [. A  /  x ]. A. y  e.  B  ph )
2 simpl 457 . . 3  |-  ( ( A  e.  V  /\  F/_ y A )  ->  A  e.  V )
3 sbsbc 3335 . . . . 5  |-  ( [ z  /  x ] A. y  e.  B  ph  <->  [. z  /  x ]. A. y  e.  B  ph )
4 nfcv 2629 . . . . . . 7  |-  F/_ x B
5 nfs1v 2164 . . . . . . 7  |-  F/ x [ z  /  x ] ph
64, 5nfral 2850 . . . . . 6  |-  F/ x A. y  e.  B  [ z  /  x ] ph
7 sbequ12 1961 . . . . . . 7  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
87ralbidv 2903 . . . . . 6  |-  ( x  =  z  ->  ( A. y  e.  B  ph  <->  A. y  e.  B  [
z  /  x ] ph ) )
96, 8sbie 2123 . . . . 5  |-  ( [ z  /  x ] A. y  e.  B  ph  <->  A. y  e.  B  [
z  /  x ] ph )
103, 9bitr3i 251 . . . 4  |-  ( [. z  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [ z  /  x ] ph )
11 nfnfc1 2632 . . . . . . 7  |-  F/ y
F/_ y A
12 nfcvd 2630 . . . . . . . 8  |-  ( F/_ y A  ->  F/_ y
z )
13 id 22 . . . . . . . 8  |-  ( F/_ y A  ->  F/_ y A )
1412, 13nfeqd 2636 . . . . . . 7  |-  ( F/_ y A  ->  F/ y  z  =  A )
1511, 14nfan1 1874 . . . . . 6  |-  F/ y ( F/_ y A  /\  z  =  A )
16 dfsbcq2 3334 . . . . . . 7  |-  ( z  =  A  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
1716adantl 466 . . . . . 6  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
1815, 17ralbid 2898 . . . . 5  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( A. y  e.  B  [ z  /  x ] ph  <->  A. y  e.  B  [. A  /  x ]. ph ) )
1918adantll 713 . . . 4  |-  ( ( ( A  e.  V  /\  F/_ y A )  /\  z  =  A )  ->  ( A. y  e.  B  [
z  /  x ] ph 
<-> 
A. y  e.  B  [. A  /  x ]. ph ) )
2010, 19syl5bb 257 . . 3  |-  ( ( ( A  e.  V  /\  F/_ y A )  /\  z  =  A )  ->  ( [. z  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [. A  /  x ]. ph ) )
212, 20sbcied 3368 . 2  |-  ( ( A  e.  V  /\  F/_ y A )  -> 
( [. A  /  z ]. [. z  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [. A  /  x ]. ph )
)
221, 21syl5bbr 259 1  |-  ( ( A  e.  V  /\  F/_ y A )  -> 
( [. A  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [. A  /  x ]. ph )
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1379   [wsb 1711    e. wcel 1767   F/_wnfc 2615   A.wral 2814   [.wsbc 3331
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-v 3115  df-sbc 3332
This theorem is referenced by:  sbcrextOLD  3413  sbcrext  3414  sbcralg  3415
  Copyright terms: Public domain W3C validator