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

Theorem sbcrext 3083
Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 1-Mar-2008.) (Proof shortened by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
sbcrext  |-  ( F/_ y A  ->  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph ) )
Distinct variable groups:    x, y    x, B
Allowed substitution hints:    ph( x, y)    A( x, y)    B( y)

Proof of Theorem sbcrext
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 sbcex 3014 . . 3  |-  ( [. A  /  x ]. E. y  e.  B  ph  ->  A  e.  _V )
21a1i 9 . 2  |-  ( F/_ y A  ->  ( [. A  /  x ]. E. y  e.  B  ph  ->  A  e.  _V ) )
3 nfnfc1 2353 . . 3  |-  F/ y
F/_ y A
4 id 19 . . . 4  |-  ( F/_ y A  ->  F/_ y A )
5 nfcvd 2351 . . . 4  |-  ( F/_ y A  ->  F/_ y _V )
64, 5nfeld 2366 . . 3  |-  ( F/_ y A  ->  F/ y  A  e.  _V )
7 sbcex 3014 . . . 4  |-  ( [. A  /  x ]. ph  ->  A  e.  _V )
872a1i 27 . . 3  |-  ( F/_ y A  ->  ( y  e.  B  ->  ( [. A  /  x ]. ph  ->  A  e.  _V ) ) )
93, 6, 8rexlimd2 2623 . 2  |-  ( F/_ y A  ->  ( E. y  e.  B  [. A  /  x ]. ph  ->  A  e.  _V ) )
10 sbcco 3027 . . . 4  |-  ( [. A  /  z ]. [. z  /  x ]. E. y  e.  B  ph  <->  [. A  /  x ]. E. y  e.  B  ph )
11 simpl 109 . . . . 5  |-  ( ( A  e.  _V  /\  F/_ y A )  ->  A  e.  _V )
12 sbsbc 3009 . . . . . . 7  |-  ( [ z  /  x ] E. y  e.  B  ph  <->  [. z  /  x ]. E. y  e.  B  ph )
13 nfcv 2350 . . . . . . . . 9  |-  F/_ x B
14 nfs1v 1968 . . . . . . . . 9  |-  F/ x [ z  /  x ] ph
1513, 14nfrexw 2547 . . . . . . . 8  |-  F/ x E. y  e.  B  [ z  /  x ] ph
16 sbequ12 1795 . . . . . . . . 9  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
1716rexbidv 2509 . . . . . . . 8  |-  ( x  =  z  ->  ( E. y  e.  B  ph  <->  E. y  e.  B  [
z  /  x ] ph ) )
1815, 17sbie 1815 . . . . . . 7  |-  ( [ z  /  x ] E. y  e.  B  ph  <->  E. y  e.  B  [
z  /  x ] ph )
1912, 18bitr3i 186 . . . . . 6  |-  ( [. z  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [ z  /  x ] ph )
20 nfcvd 2351 . . . . . . . . . 10  |-  ( F/_ y A  ->  F/_ y
z )
2120, 4nfeqd 2365 . . . . . . . . 9  |-  ( F/_ y A  ->  F/ y  z  =  A )
223, 21nfan1 1588 . . . . . . . 8  |-  F/ y ( F/_ y A  /\  z  =  A )
23 dfsbcq2 3008 . . . . . . . . 9  |-  ( z  =  A  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
2423adantl 277 . . . . . . . 8  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( [ z  /  x ] ph  <->  [. A  /  x ]. ph ) )
2522, 24rexbid 2507 . . . . . . 7  |-  ( (
F/_ y A  /\  z  =  A )  ->  ( E. y  e.  B  [ z  /  x ] ph  <->  E. y  e.  B  [. A  /  x ]. ph ) )
2625adantll 476 . . . . . 6  |-  ( ( ( A  e.  _V  /\ 
F/_ y A )  /\  z  =  A )  ->  ( E. y  e.  B  [
z  /  x ] ph 
<->  E. y  e.  B  [. A  /  x ]. ph ) )
2719, 26bitrid 192 . . . . 5  |-  ( ( ( A  e.  _V  /\ 
F/_ y A )  /\  z  =  A )  ->  ( [. z  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph ) )
2811, 27sbcied 3042 . . . 4  |-  ( ( A  e.  _V  /\  F/_ y A )  -> 
( [. A  /  z ]. [. z  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph )
)
2910, 28bitr3id 194 . . 3  |-  ( ( A  e.  _V  /\  F/_ y A )  -> 
( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph )
)
3029expcom 116 . 2  |-  ( F/_ y A  ->  ( A  e.  _V  ->  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph )
) )
312, 9, 30pm5.21ndd 707 1  |-  ( F/_ y A  ->  ( [. A  /  x ]. E. y  e.  B  ph  <->  E. y  e.  B  [. A  /  x ]. ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373   [wsb 1786    e. wcel 2178   F/_wnfc 2337   E.wrex 2487   _Vcvv 2776   [.wsbc 3005
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006
This theorem is referenced by:  sbcrex  3085
  Copyright terms: Public domain W3C validator