Theorem ennnfonelemf1 12578

Description: Lemma for ennnfone 12585. L is one-to-one. (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
ennnfonelemf1	|- ( ph -> L : dom L -1-1-> A )

Distinct variable groups:   A, j, x, y   x, F, y, j, k   n, F   j, G   i, H   j, H, x, y, k   j, J   x, N, y, k, j   ph, j, x, y, k   k, n, j

Allowed substitution hints:   ph( i, n)   A( i, k, n)   F( i)   G( x, y, i, k, n)   H( n)   J( x, y, i, k, n)   L( x, y, i, j, k, n)   N( i, n)

Proof of Theorem ennnfonelemf1

Dummy variables q s t are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ennnfonelemh.dceq	. . . . 5 |- ( ph -> A. x e. A A. y e. A DECID x = y )
2		ennnfonelemh.f	. . . . 5 |- ( ph -> F : om -onto-> A )
3		ennnfonelemh.ne	. . . . 5 |- ( ph -> A. n e. om E. k e. om A. j e. suc n ( F ` k ) =/= ( F ` j ) )
4		ennnfonelemh.g	. . . . 5 |- 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	. . . . 5 |- N = frec ( ( x e. ZZ |-> ( x + 1 ) ) , 0 )
6		ennnfonelemh.j	. . . . 5 |- J = ( x e. NN0 |-> if ( x = 0 , (/) , ( `' N ` ( x - 1 ) ) ) )
7		ennnfonelemh.h	. . . . 5 |- H = seq 0 ( G , J )
8		ennnfone.l	. . . . 5 |- L = U_ i e. NN0 ( H ` i )
9	1, 2, 3, 4, 5, 6, 7, 8	ennnfonelemfun 12577	. . . 4 |- ( ph -> Fun L )
10	9	funfnd 5286	. . 3 |- ( ph -> L Fn dom L )
11	1, 2, 3, 4, 5, 6, 7	ennnfonelemh 12564	. . . . . . . . 9 |- ( ph -> H : NN0 --> ( A ^pm om ) )
12	11	ffnd 5405	. . . . . . . 8 |- ( ph -> H Fn NN0 )
13		fniunfv 5806	. . . . . . . 8 |- ( H Fn NN0 -> U_ i e. NN0 ( H ` i ) = U. ran H )
14	12, 13	syl 14	. . . . . . 7 |- ( ph -> U_ i e. NN0 ( H ` i ) = U. ran H )
15	8, 14	eqtrid 2238	. . . . . 6 |- ( ph -> L = U. ran H )
16	15	rneqd 4892	. . . . 5 |- ( ph -> ran L = ran U. ran H )
17		rnuni 5078	. . . . 5 |- ran U. ran H = U_ x e. ran H ran x
18	16, 17	eqtrdi 2242	. . . 4 |- ( ph -> ran L = U_ x e. ran H ran x )
19	11	frnd 5414	. . . . . . . . . 10 |- ( ph -> ran H C_ ( A ^pm om ) )
20	19	sselda 3180	. . . . . . . . 9 |- ( ( ph /\ x e. ran H ) -> x e. ( A ^pm om ) )
21		elpmi 6723	. . . . . . . . 9 |- ( x e. ( A ^pm om ) -> ( x : dom x --> A /\ dom x C_ om ) )
22	20, 21	syl 14	. . . . . . . 8 |- ( ( ph /\ x e. ran H ) -> ( x : dom x --> A /\ dom x C_ om ) )
23	22	simpld 112	. . . . . . 7 |- ( ( ph /\ x e. ran H ) -> x : dom x --> A )
24	23	frnd 5414	. . . . . 6 |- ( ( ph /\ x e. ran H ) -> ran x C_ A )
25	24	ralrimiva 2567	. . . . 5 |- ( ph -> A. x e. ran H ran x C_ A )
26		iunss 3954	. . . . 5 |- ( U_ x e. ran H ran x C_ A <-> A. x e. ran H ran x C_ A )
27	25, 26	sylibr 134	. . . 4 |- ( ph -> U_ x e. ran H ran x C_ A )
28	18, 27	eqsstrd 3216	. . 3 |- ( ph -> ran L C_ A )
29		df-f 5259	. . 3 |- ( L : dom L --> A <-> ( L Fn dom L /\ ran L C_ A ) )
30	10, 28, 29	sylanbrc 417	. 2 |- ( ph -> L : dom L --> A )
31	19	sselda 3180	. . . . . . . 8 |- ( ( ph /\ s e. ran H ) -> s e. ( A ^pm om ) )
32		pmfun 6724	. . . . . . . 8 |- ( s e. ( A ^pm om ) -> Fun s )
33	31, 32	syl 14	. . . . . . 7 |- ( ( ph /\ s e. ran H ) -> Fun s )
34	11	ffund 5408	. . . . . . . . . 10 |- ( ph -> Fun H )
35	34	adantr 276	. . . . . . . . 9 |- ( ( ph /\ s e. ran H ) -> Fun H )
36		simpr 110	. . . . . . . . 9 |- ( ( ph /\ s e. ran H ) -> s e. ran H )
37		elrnrexdm 5698	. . . . . . . . 9 |- ( Fun H -> ( s e. ran H -> E. q e. dom H s = ( H ` q ) ) )
38	35, 36, 37	sylc 62	. . . . . . . 8 |- ( ( ph /\ s e. ran H ) -> E. q e. dom H s = ( H ` q ) )
39	1	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ q e. dom H ) -> A. x e. A A. y e. A DECID x = y )
40	2	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ q e. dom H ) -> F : om -onto-> A )
41	3	adantr 276	. . . . . . . . . . . 12 |- ( ( ph /\ q e. dom H ) -> A. n e. om E. k e. om A. j e. suc n ( F ` k ) =/= ( F ` j ) )
42	11	fdmd 5411	. . . . . . . . . . . . . 14 |- ( ph -> dom H = NN0 )
43	42	eleq2d 2263	. . . . . . . . . . . . 13 |- ( ph -> ( q e. dom H <-> q e. NN0 ) )
44	43	biimpa 296	. . . . . . . . . . . 12 |- ( ( ph /\ q e. dom H ) -> q e. NN0 )
45	39, 40, 41, 4, 5, 6, 7, 44	ennnfonelemhf1o 12573	. . . . . . . . . . 11 |- ( ( ph /\ q e. dom H ) -> ( H ` q ) : dom ( H ` q ) -1-1-onto-> ( F " ( `' N ` q ) ) )
46		f1ocnv 5514	. . . . . . . . . . 11 |- ( ( H ` q ) : dom ( H ` q ) -1-1-onto-> ( F " ( `' N ` q ) ) -> `' ( H ` q ) : ( F " ( `' N ` q ) ) -1-1-onto-> dom ( H ` q ) )
47		f1ofun 5503	. . . . . . . . . . 11 |- ( `' ( H ` q ) : ( F " ( `' N ` q ) ) -1-1-onto-> dom ( H ` q ) -> Fun `' ( H ` q ) )
48	45, 46, 47	3syl 17	. . . . . . . . . 10 |- ( ( ph /\ q e. dom H ) -> Fun `' ( H ` q ) )
49	48	ad2ant2r 509	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ ( q e. dom H /\ s = ( H ` q ) ) ) -> Fun `' ( H ` q ) )
50		simprr 531	. . . . . . . . . . 11 |- ( ( ( ph /\ s e. ran H ) /\ ( q e. dom H /\ s = ( H ` q ) ) ) -> s = ( H ` q ) )
51	50	cnveqd 4839	. . . . . . . . . 10 |- ( ( ( ph /\ s e. ran H ) /\ ( q e. dom H /\ s = ( H ` q ) ) ) -> `' s = `' ( H ` q ) )
52	51	funeqd 5277	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ ( q e. dom H /\ s = ( H ` q ) ) ) -> ( Fun `' s <-> Fun `' ( H ` q ) ) )
53	49, 52	mpbird 167	. . . . . . . 8 |- ( ( ( ph /\ s e. ran H ) /\ ( q e. dom H /\ s = ( H ` q ) ) ) -> Fun `' s )
54	38, 53	rexlimddv 2616	. . . . . . 7 |- ( ( ph /\ s e. ran H ) -> Fun `' s )
55	1	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ t e. ran H ) -> A. x e. A A. y e. A DECID x = y )
56	2	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ t e. ran H ) -> F : om -onto-> A )
57	3	ad2antrr 488	. . . . . . . . 9 |- ( ( ( 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 ) )
58		simplr 528	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ t e. ran H ) -> s e. ran H )
59		simpr 110	. . . . . . . . 9 |- ( ( ( ph /\ s e. ran H ) /\ t e. ran H ) -> t e. ran H )
60	55, 56, 57, 4, 5, 6, 7, 58, 59	ennnfonelemrnh 12576	. . . . . . . 8 |- ( ( ( ph /\ s e. ran H ) /\ t e. ran H ) -> ( s C_ t \/ t C_ s ) )
61	60	ralrimiva 2567	. . . . . . 7 |- ( ( ph /\ s e. ran H ) -> A. t e. ran H ( s C_ t \/ t C_ s ) )
62	33, 54, 61	jca31 309	. . . . . 6 |- ( ( ph /\ s e. ran H ) -> ( ( Fun s /\ Fun `' s ) /\ A. t e. ran H ( s C_ t \/ t C_ s ) ) )
63	62	ralrimiva 2567	. . . . 5 |- ( ph -> A. s e. ran H ( ( Fun s /\ Fun `' s ) /\ A. t e. ran H ( s C_ t \/ t C_ s ) ) )
64		fun11uni 5325	. . . . 5 |- ( A. s e. ran H ( ( Fun s /\ Fun `' s ) /\ A. t e. ran H ( s C_ t \/ t C_ s ) ) -> ( Fun U. ran H /\ Fun `' U. ran H ) )
65	63, 64	syl 14	. . . 4 |- ( ph -> ( Fun U. ran H /\ Fun `' U. ran H ) )
66	65	simprd 114	. . 3 |- ( ph -> Fun `' U. ran H )
67	15	cnveqd 4839	. . . 4 |- ( ph -> `' L = `' U. ran H )
68	67	funeqd 5277	. . 3 |- ( ph -> ( Fun `' L <-> Fun `' U. ran H ) )
69	66, 68	mpbird 167	. 2 |- ( ph -> Fun `' L )
70		df-f1 5260	. 2 |- ( L : dom L -1-1-> A <-> ( L : dom L --> A /\ Fun `' L ) )
71	30, 69, 70	sylanbrc 417	1 |- ( ph -> L : dom L -1-1-> A )

Syntax hints:   -> wi 4   /\ wa 104   \/ wo 709  DECID wdc 835   = wceq 1364   e. wcel 2164   =/= wne 2364   A.wral 2472   E.wrex 2473   u. cun 3152   C_ wss 3154   (/)c0 3447   ifcif 3558   {csn 3619   <.cop 3622   U.cuni 3836   U_ciun 3913   |-> cmpt 4091   suc csuc 4397   omcom 4623   `'ccnv 4659   dom cdm 4660   ran crn 4661   "cima 4663   Fun wfun 5249   Fn wfn 5250   -->wf 5251   -1-1->wf1 5252   -onto->wfo 5253   -1-1-onto->wf1o 5254   ` cfv 5255  (class class class)co 5919   e. cmpo 5921  freccfrec 6445   ^pm cpm 6705   0cc0 7874   1c1 7875   + caddc 7877   - cmin 8192   NN0cn0 9243   ZZcz 9320   seqcseq 10521

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-ltadd 7990

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-ilim 4401  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-frec 6446  df-pm 6707  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-inn 8985  df-n0 9244  df-z 9321  df-uz 9596  df-seqfrec 10522

This theorem is referenced by:  ennnfonelemrn  12579  ennnfonelemen  12581