Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdsetindis Unicode version

Theorem bdsetindis 10481
Description: Axiom of bounded set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
bdsetindis.bd  |- BOUNDED  ph
bdsetindis.nf0  |-  F/ x ps
bdsetindis.nf1  |-  F/ x ch
bdsetindis.nf2  |-  F/ y
ph
bdsetindis.nf3  |-  F/ y ps
bdsetindis.1  |-  ( x  =  z  ->  ( ph  ->  ps ) )
bdsetindis.2  |-  ( x  =  y  ->  ( ch  ->  ph ) )
Assertion
Ref Expression
bdsetindis  |-  ( A. y ( A. z  e.  y  ps  ->  ch )  ->  A. x ph )
Distinct variable groups:    x, y, z    ph, z
Allowed substitution hints:    ph( x, y)    ps( x, y, z)    ch( x, y, z)

Proof of Theorem bdsetindis
StepHypRef Expression
1 nfcv 2194 . . . . 5  |-  F/_ x
y
2 bdsetindis.nf0 . . . . 5  |-  F/ x ps
31, 2nfralxy 2377 . . . 4  |-  F/ x A. z  e.  y  ps
4 bdsetindis.nf1 . . . 4  |-  F/ x ch
53, 4nfim 1480 . . 3  |-  F/ x
( A. z  e.  y  ps  ->  ch )
6 nfcv 2194 . . . . 5  |-  F/_ y
x
7 bdsetindis.nf3 . . . . 5  |-  F/ y ps
86, 7nfralxy 2377 . . . 4  |-  F/ y A. z  e.  x  ps
9 bdsetindis.nf2 . . . 4  |-  F/ y
ph
108, 9nfim 1480 . . 3  |-  F/ y ( A. z  e.  x  ps  ->  ph )
11 raleq 2522 . . . . 5  |-  ( y  =  x  ->  ( A. z  e.  y  ps 
<-> 
A. z  e.  x  ps ) )
1211biimprd 151 . . . 4  |-  ( y  =  x  ->  ( A. z  e.  x  ps  ->  A. z  e.  y  ps ) )
13 bdsetindis.2 . . . . 5  |-  ( x  =  y  ->  ( ch  ->  ph ) )
1413equcoms 1610 . . . 4  |-  ( y  =  x  ->  ( ch  ->  ph ) )
1512, 14imim12d 72 . . 3  |-  ( y  =  x  ->  (
( A. z  e.  y  ps  ->  ch )  ->  ( A. z  e.  x  ps  ->  ph ) ) )
165, 10, 15cbv3 1646 . 2  |-  ( A. y ( A. z  e.  y  ps  ->  ch )  ->  A. x
( A. z  e.  x  ps  ->  ph )
)
17 bdsetindis.1 . . . . . 6  |-  ( x  =  z  ->  ( ph  ->  ps ) )
182, 17bj-sbime 10300 . . . . 5  |-  ( [ z  /  x ] ph  ->  ps )
1918ralimi 2401 . . . 4  |-  ( A. z  e.  x  [
z  /  x ] ph  ->  A. z  e.  x  ps )
2019imim1i 58 . . 3  |-  ( ( A. z  e.  x  ps  ->  ph )  ->  ( A. z  e.  x  [ z  /  x ] ph  ->  ph ) )
2120alimi 1360 . 2  |-  ( A. x ( A. z  e.  x  ps  ->  ph )  ->  A. x
( A. z  e.  x  [ z  /  x ] ph  ->  ph )
)
22 bdsetindis.bd . . 3  |- BOUNDED  ph
2322ax-bdsetind 10480 . 2  |-  ( A. x ( A. z  e.  x  [ z  /  x ] ph  ->  ph )  ->  A. x ph )
2416, 21, 233syl 17 1  |-  ( A. y ( A. z  e.  y  ps  ->  ch )  ->  A. x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1257   F/wnf 1365   [wsb 1661   A.wral 2323  BOUNDED wbd 10319
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  ax-bdsetind 10480
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328
This theorem is referenced by:  bj-inf2vnlem3  10484
  Copyright terms: Public domain W3C validator