ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbcralt Unicode version

Theorem sbcralt 2862
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 2808 . 2  |-  ( [. A  /  z ]. [. z  /  x ]. A. y  e.  B  ph  <->  [. A  /  x ]. A. y  e.  B  ph )
2 simpl 106 . . 3  |-  ( ( A  e.  V  /\  F/_ y A )  ->  A  e.  V )
3 sbsbc 2791 . . . . 5  |-  ( [ z  /  x ] A. y  e.  B  ph  <->  [. z  /  x ]. A. y  e.  B  ph )
4 nfcv 2194 . . . . . . 7  |-  F/_ x B
5 nfs1v 1831 . . . . . . 7  |-  F/ x [ z  /  x ] ph
64, 5nfralxy 2377 . . . . . 6  |-  F/ x A. y  e.  B  [ z  /  x ] ph
7 sbequ12 1670 . . . . . . 7  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
87ralbidv 2343 . . . . . 6  |-  ( x  =  z  ->  ( A. y  e.  B  ph  <->  A. y  e.  B  [
z  /  x ] ph ) )
96, 8sbie 1690 . . . . 5  |-  ( [ z  /  x ] A. y  e.  B  ph  <->  A. y  e.  B  [
z  /  x ] ph )
103, 9bitr3i 179 . . . 4  |-  ( [. z  /  x ]. A. y  e.  B  ph  <->  A. y  e.  B  [ z  /  x ] ph )
11 nfnfc1 2197 . . . . . . 7  |-  F/ y
F/_ y A
12 nfcvd 2195 . . . . . . . 8  |-  ( F/_ y A  ->  F/_ y
z )
13 id 19 . . . . . . . 8  |-  ( F/_ y A  ->  F/_ y A )
1412, 13nfeqd 2208 . . . . . . 7  |-  ( F/_ y A  ->  F/ y  z  =  A )
1511, 14nfan1 1472 . . . . . 6  |-  F/ y ( F/_ y A  /\  z  =  A )
16 dfsbcq2 2790 . . . . . . 7  |-  ( z  =  A  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
1716adantl 266 . . . . . 6  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
1815, 17ralbid 2341 . . . . 5  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( A. y  e.  B  [ z  /  x ] ph  <->  A. y  e.  B  [. A  /  x ]. ph ) )
1918adantll 453 . . . 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 185 . . 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 2822 . 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 187 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 set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102    = wceq 1259    e. wcel 1409   [wsb 1661   F/_wnfc 2181   A.wral 2323   [.wsbc 2787
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-v 2576  df-sbc 2788
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator