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

Theorem tfrlem16 6844
Description: Lemma for finite recursion. Without assuming ax-rep 4398, 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 6835 . . 3  |-  Ord  dom recs ( F )
3 ordzsl 6451 . . 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 5110 . . . . . . 7  |-  (recs ( F )  |`  (/) )  =  (/)
6 0ex 4417 . . . . . . 7  |-  (/)  e.  _V
75, 6eqeltri 2508 . . . . . 6  |-  (recs ( F )  |`  (/) )  e. 
_V
8 0elon 4767 . . . . . . 7  |-  (/)  e.  On
91tfrlem15 6843 . . . . . . 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 3637 . . . . 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 6841 . . . . 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 4720 . . . . . . . . . 10  |-  suc  z  =  ( z  u. 
{ z } )
1816, 17syl6eq 2486 . . . . . . . . 9  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  ->  dom recs ( F )  =  ( z  u.  {
z } ) )
1918reseq2d 5105 . . . . . . . 8  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
(recs ( F )  |`  dom recs ( F ) )  =  (recs ( F )  |`  (
z  u.  { z } ) ) )
201tfrlem6 6833 . . . . . . . . 9  |-  Rel recs ( F )
21 resdm 5143 . . . . . . . . 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 5119 . . . . . . . 8  |-  (recs ( F )  |`  (
z  u.  { z } ) )  =  ( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) )
2419, 22, 233eqtr3g 2493 . . . . . . 7  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> recs ( F )  =  ( (recs ( F )  |`  z )  u.  (recs ( F )  |`  { z } ) ) )
25 vex 2970 . . . . . . . . . . 11  |-  z  e. 
_V
2625sucid 4793 . . . . . . . . . 10  |-  z  e. 
suc  z
2726, 16syl5eleqr 2525 . . . . . . . . 9  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> 
z  e.  dom recs ( F ) )
281tfrlem9a 6837 . . . . . . . . 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 4528 . . . . . . . . 9  |-  { <. z ,  (recs ( F ) `  z )
>. }  e.  _V
311tfrlem7 6834 . . . . . . . . . 10  |-  Fun recs ( F )
32 funressn 5890 . . . . . . . . . 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 4432 . . . . . . . 8  |-  (recs ( F )  |`  { z } )  e.  _V
35 unexg 6376 . . . . . . . 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 2512 . . . . . 6  |-  ( ( z  e.  On  /\  dom recs ( F )  =  suc  z )  -> recs ( F )  e.  _V )
3837rexlimiva 2831 . . . . 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 1281 . 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 964    = wceq 1369    e. wcel 1756   {cab 2424   A.wral 2710   E.wrex 2711   _Vcvv 2967    u. cun 3321    C_ wss 3323   (/)c0 3632   {csn 3872   <.cop 3878   Ord word 4713   Oncon0 4714   Lim wlim 4715   suc csuc 4716   dom cdm 4835    |` cres 4837   Rel wrel 4840   Fun wfun 5407    Fn wfn 5408   ` cfv 5413  recscrecs 6823
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2419  ax-sep 4408  ax-nul 4416  ax-pow 4465  ax-pr 4526  ax-un 6367
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2256  df-mo 2257  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2715  df-rex 2716  df-reu 2717  df-rab 2719  df-v 2969  df-sbc 3182  df-csb 3284  df-dif 3326  df-un 3328  df-in 3330  df-ss 3337  df-pss 3339  df-nul 3633  df-if 3787  df-pw 3857  df-sn 3873  df-pr 3875  df-tp 3877  df-op 3879  df-uni 4087  df-iun 4168  df-br 4288  df-opab 4346  df-mpt 4347  df-tr 4381  df-eprel 4627  df-id 4631  df-po 4636  df-so 4637  df-fr 4674  df-we 4676  df-ord 4717  df-on 4718  df-lim 4719  df-suc 4720  df-xp 4841  df-rel 4842  df-cnv 4843  df-co 4844  df-dm 4845  df-rn 4846  df-res 4847  df-ima 4848  df-iota 5376  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-recs 6824
This theorem is referenced by:  tfr1a  6845
  Copyright terms: Public domain W3C validator