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

Theorem sbcnestgf 2897
Description: Nest the composition of two substitutions. (Contributed by Mario Carneiro, 11-Nov-2016.)
Assertion
Ref Expression
sbcnestgf  |-  ( ( A  e.  V  /\  A. y F/ x ph )  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  / 
y ]. ph ) )

Proof of Theorem sbcnestgf
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 dfsbcq 2766 . . . . 5  |-  ( z  =  A  ->  ( [. z  /  x ]. [. B  /  y ]. ph  <->  [. A  /  x ]. [. B  /  y ]. ph ) )
2 csbeq1 2855 . . . . . 6  |-  ( z  =  A  ->  [_ z  /  x ]_ B  = 
[_ A  /  x ]_ B )
3 dfsbcq 2766 . . . . . 6  |-  ( [_ z  /  x ]_ B  =  [_ A  /  x ]_ B  ->  ( [. [_ z  /  x ]_ B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  / 
y ]. ph ) )
42, 3syl 14 . . . . 5  |-  ( z  =  A  ->  ( [. [_ z  /  x ]_ B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  /  y ]. ph ) )
51, 4bibi12d 224 . . . 4  |-  ( z  =  A  ->  (
( [. z  /  x ]. [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  /  y ]. ph )  <->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  / 
y ]. ph ) ) )
65imbi2d 219 . . 3  |-  ( z  =  A  ->  (
( A. y F/ x ph  ->  ( [. z  /  x ]. [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  /  y ]. ph ) )  <->  ( A. y F/ x ph  ->  (
[. A  /  x ]. [. B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  /  y ]. ph ) ) ) )
7 vex 2560 . . . . 5  |-  z  e. 
_V
87a1i 9 . . . 4  |-  ( A. y F/ x ph  ->  z  e.  _V )
9 csbeq1a 2860 . . . . . 6  |-  ( x  =  z  ->  B  =  [_ z  /  x ]_ B )
10 dfsbcq 2766 . . . . . 6  |-  ( B  =  [_ z  /  x ]_ B  ->  ( [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  /  y ]. ph ) )
119, 10syl 14 . . . . 5  |-  ( x  =  z  ->  ( [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  /  y ]. ph ) )
1211adantl 262 . . . 4  |-  ( ( A. y F/ x ph  /\  x  =  z )  ->  ( [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  / 
y ]. ph ) )
13 nfnf1 1436 . . . . 5  |-  F/ x F/ x ph
1413nfal 1468 . . . 4  |-  F/ x A. y F/ x ph
15 nfa1 1434 . . . . 5  |-  F/ y A. y F/ x ph
16 nfcsb1v 2882 . . . . . 6  |-  F/_ x [_ z  /  x ]_ B
1716a1i 9 . . . . 5  |-  ( A. y F/ x ph  ->  F/_ x [_ z  /  x ]_ B )
18 sp 1401 . . . . 5  |-  ( A. y F/ x ph  ->  F/ x ph )
1915, 17, 18nfsbcd 2783 . . . 4  |-  ( A. y F/ x ph  ->  F/ x [. [_ z  /  x ]_ B  / 
y ]. ph )
208, 12, 14, 19sbciedf 2798 . . 3  |-  ( A. y F/ x ph  ->  (
[. z  /  x ]. [. B  /  y ]. ph  <->  [. [_ z  /  x ]_ B  /  y ]. ph ) )
216, 20vtoclg 2613 . 2  |-  ( A  e.  V  ->  ( A. y F/ x ph  ->  ( [. A  /  x ]. [. B  / 
y ]. ph  <->  [. [_ A  /  x ]_ B  / 
y ]. ph ) ) )
2221imp 115 1  |-  ( ( A  e.  V  /\  A. y F/ x ph )  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. [_ A  /  x ]_ B  / 
y ]. ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   A.wal 1241    = wceq 1243   F/wnf 1349    e. wcel 1393   F/_wnfc 2165   _Vcvv 2557   [.wsbc 2764   [_csb 2852
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-sbc 2765  df-csb 2853
This theorem is referenced by:  csbnestgf  2898  sbcnestg  2899
  Copyright terms: Public domain W3C validator