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

Theorem frecuzrdg0 10828
Description: Initial value of a recursive definition generator on upper integers. See comment in frec2uz0d 10814 for the description of  G as the mapping from  om to  ( ZZ>= `  C
). (Contributed by Jim Kingdon, 27-May-2020.)
Hypotheses
Ref Expression
frec2uz.1  |-  ( ph  ->  C  e.  ZZ )
frec2uz.2  |-  G  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  C )
frecuzrdgrrn.a  |-  ( ph  ->  A  e.  S )
frecuzrdgrrn.f  |-  ( (
ph  /\  ( x  e.  ( ZZ>= `  C )  /\  y  e.  S
) )  ->  (
x F y )  e.  S )
frecuzrdgrrn.2  |-  R  = frec ( ( x  e.  ( ZZ>= `  C ) ,  y  e.  S  |-> 
<. ( x  +  1 ) ,  ( x F y ) >.
) ,  <. C ,  A >. )
frecuzrdgtcl.3  |-  ( ph  ->  T  =  ran  R
)
Assertion
Ref Expression
frecuzrdg0  |-  ( ph  ->  ( T `  C
)  =  A )
Distinct variable groups:    y, A    x, C, y    y, G    x, F, y    x, S, y    ph, x, y
Allowed substitution hints:    A( x)    R( x, y)    T( x, y)    G( x)

Proof of Theorem frecuzrdg0
StepHypRef Expression
1 frec2uz.1 . . . 4  |-  ( ph  ->  C  e.  ZZ )
2 frec2uz.2 . . . 4  |-  G  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  C )
3 frecuzrdgrrn.a . . . 4  |-  ( ph  ->  A  e.  S )
4 frecuzrdgrrn.f . . . 4  |-  ( (
ph  /\  ( x  e.  ( ZZ>= `  C )  /\  y  e.  S
) )  ->  (
x F y )  e.  S )
5 frecuzrdgrrn.2 . . . 4  |-  R  = frec ( ( x  e.  ( ZZ>= `  C ) ,  y  e.  S  |-> 
<. ( x  +  1 ) ,  ( x F y ) >.
) ,  <. C ,  A >. )
6 frecuzrdgtcl.3 . . . 4  |-  ( ph  ->  T  =  ran  R
)
71, 2, 3, 4, 5, 6frecuzrdgtcl 10827 . . 3  |-  ( ph  ->  T : ( ZZ>= `  C ) --> S )
8 ffun 5531 . . 3  |-  ( T : ( ZZ>= `  C
) --> S  ->  Fun  T )
97, 8syl 14 . 2  |-  ( ph  ->  Fun  T )
105fveq1i 5691 . . . . 5  |-  ( R `
 (/) )  =  (frec ( ( x  e.  ( ZZ>= `  C ) ,  y  e.  S  |-> 
<. ( x  +  1 ) ,  ( x F y ) >.
) ,  <. C ,  A >. ) `  (/) )
11 opexg 4363 . . . . . . 7  |-  ( ( C  e.  ZZ  /\  A  e.  S )  -> 
<. C ,  A >.  e. 
_V )
121, 3, 11syl2anc 415 . . . . . 6  |-  ( ph  -> 
<. C ,  A >.  e. 
_V )
13 frec0g 6658 . . . . . 6  |-  ( <. C ,  A >.  e. 
_V  ->  (frec ( ( x  e.  ( ZZ>= `  C ) ,  y  e.  S  |->  <. (
x  +  1 ) ,  ( x F y ) >. ) ,  <. C ,  A >. ) `  (/) )  = 
<. C ,  A >. )
1412, 13syl 14 . . . . 5  |-  ( ph  ->  (frec ( ( x  e.  ( ZZ>= `  C
) ,  y  e.  S  |->  <. ( x  + 
1 ) ,  ( x F y )
>. ) ,  <. C ,  A >. ) `  (/) )  = 
<. C ,  A >. )
1510, 14eqtrid 2283 . . . 4  |-  ( ph  ->  ( R `  (/) )  = 
<. C ,  A >. )
161, 2, 3, 4, 5frecuzrdgrcl 10825 . . . . . 6  |-  ( ph  ->  R : om --> ( (
ZZ>= `  C )  X.  S ) )
17 ffn 5528 . . . . . 6  |-  ( R : om --> ( (
ZZ>= `  C )  X.  S )  ->  R  Fn  om )
1816, 17syl 14 . . . . 5  |-  ( ph  ->  R  Fn  om )
19 peano1 4736 . . . . 5  |-  (/)  e.  om
20 fnfvelrn 5831 . . . . 5  |-  ( ( R  Fn  om  /\  (/) 
e.  om )  ->  ( R `  (/) )  e. 
ran  R )
2118, 19, 20sylancl 417 . . . 4  |-  ( ph  ->  ( R `  (/) )  e. 
ran  R )
2215, 21eqeltrrd 2316 . . 3  |-  ( ph  -> 
<. C ,  A >.  e. 
ran  R )
2322, 6eleqtrrd 2318 . 2  |-  ( ph  -> 
<. C ,  A >.  e.  T )
24 funopfv 5734 . 2  |-  ( Fun 
T  ->  ( <. C ,  A >.  e.  T  ->  ( T `  C
)  =  A ) )
259, 23, 24sylc 62 1  |-  ( ph  ->  ( T `  C
)  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   (/)c0 3520   <.cop 3708    |-> cmpt 4187   omcom 4732    X. cxp 4767   ran crn 4770   Fun wfun 5366    Fn wfn 5367   -->wf 5368   ` cfv 5372  (class class class)co 6075    e. cmpo 6077  freccfrec 6651   1c1 8170    + caddc 8172   ZZcz 9623   ZZ>=cuz 9900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator