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

Theorem frecuzrdg0 10738
Description: Initial value of a recursive definition generator on upper integers. See comment in frec2uz0d 10724 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 10737 . . 3  |-  ( ph  ->  T : ( ZZ>= `  C ) --> S )
8 ffun 5492 . . 3  |-  ( T : ( ZZ>= `  C
) --> S  ->  Fun  T )
97, 8syl 14 . 2  |-  ( ph  ->  Fun  T )
105fveq1i 5649 . . . . 5  |-  ( R `
 (/) )  =  (frec ( ( x  e.  ( ZZ>= `  C ) ,  y  e.  S  |-> 
<. ( x  +  1 ) ,  ( x F y ) >.
) ,  <. C ,  A >. ) `  (/) )
11 opexg 4326 . . . . . . 7  |-  ( ( C  e.  ZZ  /\  A  e.  S )  -> 
<. C ,  A >.  e. 
_V )
121, 3, 11syl2anc 411 . . . . . 6  |-  ( ph  -> 
<. C ,  A >.  e. 
_V )
13 frec0g 6606 . . . . . 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 2276 . . . 4  |-  ( ph  ->  ( R `  (/) )  = 
<. C ,  A >. )
161, 2, 3, 4, 5frecuzrdgrcl 10735 . . . . . 6  |-  ( ph  ->  R : om --> ( (
ZZ>= `  C )  X.  S ) )
17 ffn 5489 . . . . . 6  |-  ( R : om --> ( (
ZZ>= `  C )  X.  S )  ->  R  Fn  om )
1816, 17syl 14 . . . . 5  |-  ( ph  ->  R  Fn  om )
19 peano1 4698 . . . . 5  |-  (/)  e.  om
20 fnfvelrn 5787 . . . . 5  |-  ( ( R  Fn  om  /\  (/) 
e.  om )  ->  ( R `  (/) )  e. 
ran  R )
2118, 19, 20sylancl 413 . . . 4  |-  ( ph  ->  ( R `  (/) )  e. 
ran  R )
2215, 21eqeltrrd 2309 . . 3  |-  ( ph  -> 
<. C ,  A >.  e. 
ran  R )
2322, 6eleqtrrd 2311 . 2  |-  ( ph  -> 
<. C ,  A >.  e.  T )
24 funopfv 5692 . 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 1398    e. wcel 2202   _Vcvv 2803   (/)c0 3496   <.cop 3676    |-> cmpt 4155   omcom 4694    X. cxp 4729   ran crn 4732   Fun wfun 5327    Fn wfn 5328   -->wf 5329   ` cfv 5333  (class class class)co 6028    e. cmpo 6030  freccfrec 6599   1c1 8093    + caddc 8095   ZZcz 9540   ZZ>=cuz 9816
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator