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

Theorem tfis 4324
Description: Transfinite Induction Schema. If all ordinal numbers less than a given number  x have a property (induction hypothesis), then all ordinal numbers have the property (conclusion). Exercise 25 of [Enderton] p. 200. (Contributed by NM, 1-Aug-1994.) (Revised by Mario Carneiro, 20-Nov-2016.)
Hypothesis
Ref Expression
tfis.1  |-  ( x  e.  On  ->  ( A. y  e.  x  [ y  /  x ] ph  ->  ph ) )
Assertion
Ref Expression
tfis  |-  ( x  e.  On  ->  ph )
Distinct variable groups:    ph, y    x, y
Allowed substitution hint:    ph( x)

Proof of Theorem tfis
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrab2 3079 . . . . 5  |-  { x  e.  On  |  ph }  C_  On
2 nfcv 2219 . . . . . . 7  |-  F/_ x
z
3 nfrab1 2533 . . . . . . . . 9  |-  F/_ x { x  e.  On  |  ph }
42, 3nfss 2992 . . . . . . . 8  |-  F/ x  z  C_  { x  e.  On  |  ph }
53nfcri 2213 . . . . . . . 8  |-  F/ x  z  e.  { x  e.  On  |  ph }
64, 5nfim 1504 . . . . . . 7  |-  F/ x
( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph }
)
7 dfss3 2989 . . . . . . . . 9  |-  ( x 
C_  { x  e.  On  |  ph }  <->  A. y  e.  x  y  e.  { x  e.  On  |  ph }
)
8 sseq1 3020 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  C_  { x  e.  On  |  ph }  <->  z 
C_  { x  e.  On  |  ph }
) )
97, 8syl5bbr 192 . . . . . . . 8  |-  ( x  =  z  ->  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  <->  z 
C_  { x  e.  On  |  ph }
) )
10 rabid 2529 . . . . . . . . 9  |-  ( x  e.  { x  e.  On  |  ph }  <->  ( x  e.  On  /\  ph ) )
11 eleq1 2141 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  e.  { x  e.  On  |  ph }  <->  z  e.  { x  e.  On  |  ph }
) )
1210, 11syl5bbr 192 . . . . . . . 8  |-  ( x  =  z  ->  (
( x  e.  On  /\ 
ph )  <->  z  e.  { x  e.  On  |  ph } ) )
139, 12imbi12d 232 . . . . . . 7  |-  ( x  =  z  ->  (
( A. y  e.  x  y  e.  {
x  e.  On  |  ph }  ->  ( x  e.  On  /\  ph )
)  <->  ( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph } ) ) )
14 sbequ 1761 . . . . . . . . . . . 12  |-  ( w  =  y  ->  ( [ w  /  x ] ph  <->  [ y  /  x ] ph ) )
15 nfcv 2219 . . . . . . . . . . . . 13  |-  F/_ x On
16 nfcv 2219 . . . . . . . . . . . . 13  |-  F/_ w On
17 nfv 1461 . . . . . . . . . . . . 13  |-  F/ w ph
18 nfs1v 1856 . . . . . . . . . . . . 13  |-  F/ x [ w  /  x ] ph
19 sbequ12 1694 . . . . . . . . . . . . 13  |-  ( x  =  w  ->  ( ph 
<->  [ w  /  x ] ph ) )
2015, 16, 17, 18, 19cbvrab 2599 . . . . . . . . . . . 12  |-  { x  e.  On  |  ph }  =  { w  e.  On  |  [ w  /  x ] ph }
2114, 20elrab2 2751 . . . . . . . . . . 11  |-  ( y  e.  { x  e.  On  |  ph }  <->  ( y  e.  On  /\  [ y  /  x ] ph ) )
2221simprbi 269 . . . . . . . . . 10  |-  ( y  e.  { x  e.  On  |  ph }  ->  [ y  /  x ] ph )
2322ralimi 2426 . . . . . . . . 9  |-  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  ->  A. y  e.  x  [ y  /  x ] ph )
24 tfis.1 . . . . . . . . 9  |-  ( x  e.  On  ->  ( A. y  e.  x  [ y  /  x ] ph  ->  ph ) )
2523, 24syl5 32 . . . . . . . 8  |-  ( x  e.  On  ->  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  ->  ph ) )
2625anc2li 322 . . . . . . 7  |-  ( x  e.  On  ->  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  ->  ( x  e.  On  /\ 
ph ) ) )
272, 6, 13, 26vtoclgaf 2663 . . . . . 6  |-  ( z  e.  On  ->  (
z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph }
) )
2827rgen 2416 . . . . 5  |-  A. z  e.  On  ( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph } )
29 tfi 4323 . . . . 5  |-  ( ( { x  e.  On  |  ph }  C_  On  /\ 
A. z  e.  On  ( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph }
) )  ->  { x  e.  On  |  ph }  =  On )
301, 28, 29mp2an 416 . . . 4  |-  { x  e.  On  |  ph }  =  On
3130eqcomi 2085 . . 3  |-  On  =  { x  e.  On  |  ph }
3231rabeq2i 2598 . 2  |-  ( x  e.  On  <->  ( x  e.  On  /\  ph )
)
3332simprbi 269 1  |-  ( x  e.  On  ->  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1284    e. wcel 1433   [wsb 1685   A.wral 2348   {crab 2352    C_ wss 2973   Oncon0 4118
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-setind 4280
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-in 2979  df-ss 2986  df-uni 3602  df-tr 3876  df-iord 4121  df-on 4123
This theorem is referenced by:  tfis2f  4325
  Copyright terms: Public domain W3C validator