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

Theorem tfis 4505
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 3187 . . . . 5  |-  { x  e.  On  |  ph }  C_  On
2 nfcv 2282 . . . . . . 7  |-  F/_ x
z
3 nfrab1 2613 . . . . . . . . 9  |-  F/_ x { x  e.  On  |  ph }
42, 3nfss 3095 . . . . . . . 8  |-  F/ x  z  C_  { x  e.  On  |  ph }
53nfcri 2276 . . . . . . . 8  |-  F/ x  z  e.  { x  e.  On  |  ph }
64, 5nfim 1552 . . . . . . 7  |-  F/ x
( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph }
)
7 dfss3 3092 . . . . . . . . 9  |-  ( x 
C_  { x  e.  On  |  ph }  <->  A. y  e.  x  y  e.  { x  e.  On  |  ph }
)
8 sseq1 3125 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  C_  { x  e.  On  |  ph }  <->  z 
C_  { x  e.  On  |  ph }
) )
97, 8bitr3id 193 . . . . . . . 8  |-  ( x  =  z  ->  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  <->  z 
C_  { x  e.  On  |  ph }
) )
10 rabid 2609 . . . . . . . . 9  |-  ( x  e.  { x  e.  On  |  ph }  <->  ( x  e.  On  /\  ph ) )
11 eleq1 2203 . . . . . . . . 9  |-  ( x  =  z  ->  (
x  e.  { x  e.  On  |  ph }  <->  z  e.  { x  e.  On  |  ph }
) )
1210, 11bitr3id 193 . . . . . . . 8  |-  ( x  =  z  ->  (
( x  e.  On  /\ 
ph )  <->  z  e.  { x  e.  On  |  ph } ) )
139, 12imbi12d 233 . . . . . . 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 1813 . . . . . . . . . . . 12  |-  ( w  =  y  ->  ( [ w  /  x ] ph  <->  [ y  /  x ] ph ) )
15 nfcv 2282 . . . . . . . . . . . . 13  |-  F/_ x On
16 nfcv 2282 . . . . . . . . . . . . 13  |-  F/_ w On
17 nfv 1509 . . . . . . . . . . . . 13  |-  F/ w ph
18 nfs1v 1913 . . . . . . . . . . . . 13  |-  F/ x [ w  /  x ] ph
19 sbequ12 1745 . . . . . . . . . . . . 13  |-  ( x  =  w  ->  ( ph 
<->  [ w  /  x ] ph ) )
2015, 16, 17, 18, 19cbvrab 2687 . . . . . . . . . . . 12  |-  { x  e.  On  |  ph }  =  { w  e.  On  |  [ w  /  x ] ph }
2114, 20elrab2 2847 . . . . . . . . . . 11  |-  ( y  e.  { x  e.  On  |  ph }  <->  ( y  e.  On  /\  [ y  /  x ] ph ) )
2221simprbi 273 . . . . . . . . . 10  |-  ( y  e.  { x  e.  On  |  ph }  ->  [ y  /  x ] ph )
2322ralimi 2498 . . . . . . . . 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 327 . . . . . . 7  |-  ( x  e.  On  ->  ( A. y  e.  x  y  e.  { x  e.  On  |  ph }  ->  ( x  e.  On  /\ 
ph ) ) )
272, 6, 13, 26vtoclgaf 2754 . . . . . 6  |-  ( z  e.  On  ->  (
z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph }
) )
2827rgen 2488 . . . . 5  |-  A. z  e.  On  ( z  C_  { x  e.  On  |  ph }  ->  z  e.  { x  e.  On  |  ph } )
29 tfi 4504 . . . . 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 423 . . . 4  |-  { x  e.  On  |  ph }  =  On
3130eqcomi 2144 . . 3  |-  On  =  { x  e.  On  |  ph }
3231rabeq2i 2686 . 2  |-  ( x  e.  On  <->  ( x  e.  On  /\  ph )
)
3332simprbi 273 1  |-  ( x  e.  On  ->  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332    e. wcel 1481   [wsb 1736   A.wral 2417   {crab 2421    C_ wss 3076   Oncon0 4293
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-setind 4460
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-in 3082  df-ss 3089  df-uni 3745  df-tr 4035  df-iord 4296  df-on 4298
This theorem is referenced by:  tfis2f  4506
  Copyright terms: Public domain W3C validator