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

Theorem ennnfonelemfun 13289
Description: Lemma for ennnfone 13297. 
L is a function. (Contributed by Jim Kingdon, 16-Jul-2023.)
Hypotheses
Ref Expression
ennnfonelemh.dceq  |-  ( ph  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y )
ennnfonelemh.f  |-  ( ph  ->  F : om -onto-> A
)
ennnfonelemh.ne  |-  ( ph  ->  A. n  e.  om  E. k  e.  om  A. j  e.  suc  n ( F `  k )  =/=  ( F `  j ) )
ennnfonelemh.g  |-  G  =  ( x  e.  ( A  ^pm  om ) ,  y  e.  om  |->  if ( ( F `  y )  e.  ( F " y ) ,  x ,  ( x  u.  { <. dom  x ,  ( F `
 y ) >. } ) ) )
ennnfonelemh.n  |-  N  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 )
ennnfonelemh.j  |-  J  =  ( x  e.  NN0  |->  if ( x  =  0 ,  (/) ,  ( `' N `  ( x  -  1 ) ) ) )
ennnfonelemh.h  |-  H  =  seq 0 ( G ,  J )
ennnfone.l  |-  L  = 
U_ i  e.  NN0  ( H `  i )
Assertion
Ref Expression
ennnfonelemfun  |-  ( ph  ->  Fun  L )
Distinct variable groups:    A, j, x, y    x, F, y, j    k, F, n, j    j, G    i, H    j, H, x, y   
j, J    x, N, y    ph, j, x, y
Allowed substitution hints:    ph( i, k, n)    A( i, k, n)    F( i)    G( x, y, i, k, n)    H( k, n)    J( x, y, i, k, n)    L( x, y, i, j, k, n)    N( i, j, k, n)

Proof of Theorem ennnfonelemfun
Dummy variables  s  t are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ennnfonelemh.dceq . . . . . . . . 9  |-  ( ph  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y )
2 ennnfonelemh.f . . . . . . . . 9  |-  ( ph  ->  F : om -onto-> A
)
3 ennnfonelemh.ne . . . . . . . . 9  |-  ( ph  ->  A. n  e.  om  E. k  e.  om  A. j  e.  suc  n ( F `  k )  =/=  ( F `  j ) )
4 ennnfonelemh.g . . . . . . . . 9  |-  G  =  ( x  e.  ( A  ^pm  om ) ,  y  e.  om  |->  if ( ( F `  y )  e.  ( F " y ) ,  x ,  ( x  u.  { <. dom  x ,  ( F `
 y ) >. } ) ) )
5 ennnfonelemh.n . . . . . . . . 9  |-  N  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 )
6 ennnfonelemh.j . . . . . . . . 9  |-  J  =  ( x  e.  NN0  |->  if ( x  =  0 ,  (/) ,  ( `' N `  ( x  -  1 ) ) ) )
7 ennnfonelemh.h . . . . . . . . 9  |-  H  =  seq 0 ( G ,  J )
81, 2, 3, 4, 5, 6, 7ennnfonelemh 13276 . . . . . . . 8  |-  ( ph  ->  H : NN0 --> ( A 
^pm  om ) )
98frnd 5541 . . . . . . 7  |-  ( ph  ->  ran  H  C_  ( A  ^pm  om ) )
109sselda 3248 . . . . . 6  |-  ( (
ph  /\  s  e.  ran  H )  ->  s  e.  ( A  ^pm  om )
)
11 pmfun 6935 . . . . . 6  |-  ( s  e.  ( A  ^pm  om )  ->  Fun  s )
1210, 11syl 14 . . . . 5  |-  ( (
ph  /\  s  e.  ran  H )  ->  Fun  s )
131ad2antrr 492 . . . . . . 7  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y )
142ad2antrr 492 . . . . . . 7  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  F : om -onto-> A )
153ad2antrr 492 . . . . . . 7  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  A. n  e.  om  E. k  e.  om  A. j  e.  suc  n ( F `  k )  =/=  ( F `  j ) )
16 simplr 533 . . . . . . 7  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  s  e.  ran  H )
17 simpr 110 . . . . . . 7  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  t  e.  ran  H )
1813, 14, 15, 4, 5, 6, 7, 16, 17ennnfonelemrnh 13288 . . . . . 6  |-  ( ( ( ph  /\  s  e.  ran  H )  /\  t  e.  ran  H )  ->  ( s  C_  t  \/  t  C_  s ) )
1918ralrimiva 2623 . . . . 5  |-  ( (
ph  /\  s  e.  ran  H )  ->  A. t  e.  ran  H ( s 
C_  t  \/  t  C_  s ) )
2012, 19jca 306 . . . 4  |-  ( (
ph  /\  s  e.  ran  H )  ->  ( Fun  s  /\  A. t  e.  ran  H ( s 
C_  t  \/  t  C_  s ) ) )
2120ralrimiva 2623 . . 3  |-  ( ph  ->  A. s  e.  ran  H ( Fun  s  /\  A. t  e.  ran  H
( s  C_  t  \/  t  C_  s ) ) )
22 fununi 5447 . . 3  |-  ( A. s  e.  ran  H ( Fun  s  /\  A. t  e.  ran  H ( s  C_  t  \/  t  C_  s ) )  ->  Fun  U. ran  H
)
2321, 22syl 14 . 2  |-  ( ph  ->  Fun  U. ran  H
)
24 ennnfone.l . . . 4  |-  L  = 
U_ i  e.  NN0  ( H `  i )
258ffnd 5532 . . . . 5  |-  ( ph  ->  H  Fn  NN0 )
26 fniunfv 5961 . . . . 5  |-  ( H  Fn  NN0  ->  U_ i  e.  NN0  ( H `  i )  =  U. ran  H )
2725, 26syl 14 . . . 4  |-  ( ph  ->  U_ i  e.  NN0  ( H `  i )  =  U. ran  H
)
2824, 27eqtrid 2283 . . 3  |-  ( ph  ->  L  =  U. ran  H )
2928funeqd 5397 . 2  |-  ( ph  ->  ( Fun  L  <->  Fun  U. ran  H ) )
3023, 29mpbird 167 1  |-  ( ph  ->  Fun  L )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 720  DECID wdc 846    = wceq 1402    e. wcel 2209    =/= wne 2420   A.wral 2528   E.wrex 2529    u. cun 3218    C_ wss 3220   (/)c0 3520   ifcif 3638   {csn 3708   <.cop 3711   U.cuni 3933   U_ciun 4010    |-> cmpt 4190   suc csuc 4508   omcom 4735   `'ccnv 4771   dom cdm 4772   ran crn 4773   "cima 4775   Fun wfun 5369    Fn wfn 5370   -onto->wfo 5373   ` cfv 5375  (class class class)co 6078    e. cmpo 6080  freccfrec 6654    ^pm cpm 6916   0cc0 8172   1c1 8173    + caddc 8175    - cmin 8490   NN0cn0 9545   ZZcz 9626    seqcseq 10865
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 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8263  ax-resscn 8264  ax-1cn 8265  ax-1re 8266  ax-icn 8267  ax-addcl 8268  ax-addrcl 8269  ax-mulcl 8270  ax-addcom 8272  ax-addass 8274  ax-distr 8276  ax-i2m1 8277  ax-0lt1 8278  ax-0id 8280  ax-rnegex 8281  ax-cnre 8283  ax-pre-ltirr 8284  ax-pre-ltwlin 8285  ax-pre-lttrn 8286  ax-pre-ltadd 8288
This theorem depends on definitions:  df-bi 117  df-dc 847  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-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6031  df-ov 6081  df-oprab 6082  df-mpo 6083  df-1st 6367  df-2nd 6368  df-recs 6569  df-frec 6655  df-pm 6918  df-pnf 8355  df-mnf 8356  df-xr 8357  df-ltxr 8358  df-le 8359  df-sub 8492  df-neg 8493  df-inn 9287  df-n0 9546  df-z 9627  df-uz 9904  df-seqfrec 10866
This theorem is referenced by:  ennnfonelemf1  13290
  Copyright terms: Public domain W3C validator