MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfrlem16 Structured version   Unicode version

Theorem tfrlem16 7080
Description: Lemma for finite recursion. Without assuming ax-rep 4568, we can show that the domain of the constructed function is a limit ordinal, and hence contains all the finite ordinals. (Contributed by Mario Carneiro, 14-Nov-2014.)
Hypothesis
Ref Expression
tfrlem.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
Assertion
Ref Expression
tfrlem16  |-  Lim  dom recs ( F )
Distinct variable group:    x, f, y, F
Allowed substitution hints:    A( x, y, f)

Proof of Theorem tfrlem16
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 tfrlem.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem8 7071 . . 3  |-  Ord  dom recs ( F )
3 ordzsl 6679 . . 3  |-  ( Ord 
dom recs ( F )  <->  ( dom recs ( F )  =  (/)  \/ 
E. z  e.  On  dom recs ( F )  =  suc  z  \/  Lim  dom recs
( F ) ) )
42, 3mpbi 208 . 2  |-  ( dom recs
( F )  =  (/)  \/  E. z  e.  On  dom recs ( F
)  =  suc  z  \/  Lim  dom recs ( F
) )
5 res0 5288 . . . . . . 7  |-  (recs ( F )  |`  (/) )  =  (/)
6 0ex 4587 . . . . . . 7  |-  (/)  e.  _V
75, 6eqeltri 2541 . . . . . 6  |-  (recs ( F )  |`  (/) )  e. 
_V
8 0elon 4940 . . . . . . 7  |-  (/)  e.  On
91tfrlem15 7079 . . . . . . 7  |-  ( (/)  e.  On  ->  ( (/)  e.  dom recs ( F )  <->  (recs ( F )  |`  (/) )  e. 
_V ) )
108, 9ax-mp 5 . . . . . 6  |-  ( (/)  e.  dom recs ( F )  <-> 
(recs ( F )  |`  (/) )  e.  _V )
117, 10mpbir 209 . . . . 5  |-  (/)  e.  dom recs ( F )
12 n0i 3798 . . . . 5  |-  ( (/)  e.  dom recs ( F )  ->  -.  dom recs ( F )  =  (/) )
1311, 12ax-mp 5 . . . 4  |-  -.  dom recs ( F )  =  (/)
1413pm2.21i 131 . . 3  |-  ( dom recs
( F )  =  (/)  ->  Lim  dom recs ( F ) )
151tfrlem13 7077 . . . . 5  |-  -. recs ( F )  e.  _V
16 simpr 461 . . . . . . . . . 10  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  ->  dom recs ( F )  =  suc  z )
17 df-suc 4893 . . . . . . . . . 10  |-  suc  z  =  ( z  u. 
{ z } )
1816, 17syl6eq 2514 . . . . . . . . 9  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  ->  dom recs ( F )  =  ( z  u.  {
z } ) )
1918reseq2d 5283 . . . . . . . 8  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
(recs ( F )  |`  dom recs ( F ) )  =  (recs ( F )  |`  (
z  u.  { z } ) ) )
201tfrlem6 7069 . . . . . . . . 9  |-  Rel recs ( F )
21 resdm 5325 . . . . . . . . 9  |-  ( Rel recs
( F )  -> 
(recs ( F )  |`  dom recs ( F ) )  = recs ( F ) )
2220, 21ax-mp 5 . . . . . . . 8  |-  (recs ( F )  |`  dom recs ( F ) )  = recs ( F )
23 resundi 5297 . . . . . . . 8  |-  (recs ( F )  |`  (
z  u.  { z } ) )  =  ( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) )
2419, 22, 233eqtr3g 2521 . . . . . . 7  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> recs ( F )  =  ( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) ) )
25 vex 3112 . . . . . . . . . . 11  |-  z  e. 
_V
2625sucid 4966 . . . . . . . . . 10  |-  z  e. 
suc  z
2726, 16syl5eleqr 2552 . . . . . . . . 9  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
z  e.  dom recs ( F ) )
281tfrlem9a 7073 . . . . . . . . 9  |-  ( z  e.  dom recs ( F
)  ->  (recs ( F )  |`  z
)  e.  _V )
2927, 28syl 16 . . . . . . . 8  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
(recs ( F )  |`  z )  e.  _V )
30 snex 4697 . . . . . . . . 9  |-  { <. z ,  (recs ( F ) `  z )
>. }  e.  _V
311tfrlem7 7070 . . . . . . . . . 10  |-  Fun recs ( F )
32 funressn 6085 . . . . . . . . . 10  |-  ( Fun recs
( F )  -> 
(recs ( F )  |`  { z } ) 
C_  { <. z ,  (recs ( F ) `
 z ) >. } )
3331, 32ax-mp 5 . . . . . . . . 9  |-  (recs ( F )  |`  { z } )  C_  { <. z ,  (recs ( F ) `  z )
>. }
3430, 33ssexi 4601 . . . . . . . 8  |-  (recs ( F )  |`  { z } )  e.  _V
35 unexg 6600 . . . . . . . 8  |-  ( ( (recs ( F )  |`  z )  e.  _V  /\  (recs ( F )  |`  { z } )  e.  _V )  -> 
( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) )  e.  _V )
3629, 34, 35sylancl 662 . . . . . . 7  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) )  e.  _V )
3724, 36eqeltrd 2545 . . . . . 6  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> recs ( F )  e.  _V )
3837rexlimiva 2945 . . . . 5  |-  ( E. z  e.  On  dom recs ( F )  =  suc  z  -> recs ( F )  e.  _V )
3915, 38mto 176 . . . 4  |-  -.  E. z  e.  On  dom recs ( F )  =  suc  z
4039pm2.21i 131 . . 3  |-  ( E. z  e.  On  dom recs ( F )  =  suc  z  ->  Lim  dom recs ( F ) )
41 id 22 . . 3  |-  ( Lim 
dom recs ( F )  ->  Lim  dom recs ( F ) )
4214, 40, 413jaoi 1291 . 2  |-  ( ( dom recs ( F )  =  (/)  \/  E. z  e.  On  dom recs ( F
)  =  suc  z  \/  Lim  dom recs ( F
) )  ->  Lim  dom recs
( F ) )
434, 42ax-mp 5 1  |-  Lim  dom recs ( F )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    <-> wb 184    /\ wa 369    \/ w3o 972    = wceq 1395    e. wcel 1819   {cab 2442   A.wral 2807   E.wrex 2808   _Vcvv 3109    u. cun 3469    C_ wss 3471   (/)c0 3793   {csn 4032   <.cop 4038   Ord word 4886   Oncon0 4887   Lim wlim 4888   suc csuc 4889   dom cdm 5008    |` cres 5010   Rel wrel 5013   Fun wfun 5588    Fn wfn 5589   ` cfv 5594  recscrecs 7059
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-reu 2814  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-tr 4551  df-eprel 4800  df-id 4804  df-po 4809  df-so 4810  df-fr 4847  df-we 4849  df-ord 4890  df-on 4891  df-lim 4892  df-suc 4893  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-recs 7060
This theorem is referenced by:  tfr1a  7081
  Copyright terms: Public domain W3C validator