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

Theorem sbnfc2 3030
Description: Two ways of expressing " x is (effectively) not free in  A." (Contributed by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
sbnfc2  |-  ( F/_ x A  <->  A. y A. z [_ y  /  x ]_ A  =  [_ z  /  x ]_ A )
Distinct variable groups:    x, y, z   
y, A, z
Allowed substitution hint:    A( x)

Proof of Theorem sbnfc2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 vex 2663 . . . . 5  |-  y  e. 
_V
2 csbtt 2985 . . . . 5  |-  ( ( y  e.  _V  /\  F/_ x A )  ->  [_ y  /  x ]_ A  =  A
)
31, 2mpan 420 . . . 4  |-  ( F/_ x A  ->  [_ y  /  x ]_ A  =  A )
4 vex 2663 . . . . 5  |-  z  e. 
_V
5 csbtt 2985 . . . . 5  |-  ( ( z  e.  _V  /\  F/_ x A )  ->  [_ z  /  x ]_ A  =  A
)
64, 5mpan 420 . . . 4  |-  ( F/_ x A  ->  [_ z  /  x ]_ A  =  A )
73, 6eqtr4d 2153 . . 3  |-  ( F/_ x A  ->  [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A )
87alrimivv 1831 . 2  |-  ( F/_ x A  ->  A. y A. z [_ y  /  x ]_ A  =  [_ z  /  x ]_ A
)
9 nfv 1493 . . 3  |-  F/ w A. y A. z [_ y  /  x ]_ A  =  [_ z  /  x ]_ A
10 eleq2 2181 . . . . . 6  |-  ( [_ y  /  x ]_ A  =  [_ z  /  x ]_ A  ->  ( w  e.  [_ y  /  x ]_ A  <->  w  e.  [_ z  /  x ]_ A ) )
11 sbsbc 2886 . . . . . . 7  |-  ( [ y  /  x ]
w  e.  A  <->  [. y  /  x ]. w  e.  A
)
12 sbcel2g 2994 . . . . . . . 8  |-  ( y  e.  _V  ->  ( [. y  /  x ]. w  e.  A  <->  w  e.  [_ y  /  x ]_ A ) )
131, 12ax-mp 5 . . . . . . 7  |-  ( [. y  /  x ]. w  e.  A  <->  w  e.  [_ y  /  x ]_ A )
1411, 13bitri 183 . . . . . 6  |-  ( [ y  /  x ]
w  e.  A  <->  w  e.  [_ y  /  x ]_ A )
15 sbsbc 2886 . . . . . . 7  |-  ( [ z  /  x ]
w  e.  A  <->  [. z  /  x ]. w  e.  A
)
16 sbcel2g 2994 . . . . . . . 8  |-  ( z  e.  _V  ->  ( [. z  /  x ]. w  e.  A  <->  w  e.  [_ z  /  x ]_ A ) )
174, 16ax-mp 5 . . . . . . 7  |-  ( [. z  /  x ]. w  e.  A  <->  w  e.  [_ z  /  x ]_ A )
1815, 17bitri 183 . . . . . 6  |-  ( [ z  /  x ]
w  e.  A  <->  w  e.  [_ z  /  x ]_ A )
1910, 14, 183bitr4g 222 . . . . 5  |-  ( [_ y  /  x ]_ A  =  [_ z  /  x ]_ A  ->  ( [ y  /  x ]
w  e.  A  <->  [ z  /  x ] w  e.  A ) )
20192alimi 1417 . . . 4  |-  ( A. y A. z [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A  ->  A. y A. z ( [ y  /  x ] w  e.  A  <->  [ z  /  x ] w  e.  A
) )
21 sbnf2 1934 . . . 4  |-  ( F/ x  w  e.  A  <->  A. y A. z ( [ y  /  x ] w  e.  A  <->  [ z  /  x ]
w  e.  A ) )
2220, 21sylibr 133 . . 3  |-  ( A. y A. z [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A  ->  F/ x  w  e.  A )
239, 22nfcd 2253 . 2  |-  ( A. y A. z [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A  ->  F/_ x A )
248, 23impbii 125 1  |-  ( F/_ x A  <->  A. y A. z [_ y  /  x ]_ A  =  [_ z  /  x ]_ A )
Colors of variables: wff set class
Syntax hints:    <-> wb 104   A.wal 1314    = wceq 1316   F/wnf 1421    e. wcel 1465   [wsb 1720   F/_wnfc 2245   _Vcvv 2660   [.wsbc 2882   [_csb 2975
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-v 2662  df-sbc 2883  df-csb 2976
This theorem is referenced by:  eusvnf  4344
  Copyright terms: Public domain W3C validator