Theorem enumctlemm 7448

Description: Lemma for enumct 7449. The case where N is greater than zero. (Contributed by Jim Kingdon, 13-Mar-2023.)

Hypotheses

Ref	Expression
enumctlemm.f	|- ( ph -> F : N -onto-> A )
enumctlemm.n	|- ( ph -> N e. om )
enumctlemm.n0	|- ( ph -> (/) e. N )
enumctlemm.g	|- G = ( k e. om |-> if ( k e. N , ( F ` k ) , ( F ` (/) ) ) )

Assertion

Ref	Expression
enumctlemm	|- ( ph -> G : om -onto-> A )

Distinct variable groups:   A, k   k, F   k, N   ph, k

Allowed substitution hint:   G( k)

Proof of Theorem enumctlemm

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		enumctlemm.f	. . . . . . 7 |- ( ph -> F : N -onto-> A )
2		fof 5613	. . . . . . 7 |- ( F : N -onto-> A -> F : N --> A )
3	1, 2	syl 14	. . . . . 6 |- ( ph -> F : N --> A )
4	3	ffvelcdmda 5837	. . . . 5 |- ( ( ph /\ k e. N ) -> ( F ` k ) e. A )
5	4	adantlr 481	. . . 4 |- ( ( ( ph /\ k e. om ) /\ k e. N ) -> ( F ` k ) e. A )
6		enumctlemm.n0	. . . . . 6 |- ( ph -> (/) e. N )
7	3, 6	ffvelcdmd 5838	. . . . 5 |- ( ph -> ( F ` (/) ) e. A )
8	7	ad2antrr 492	. . . 4 |- ( ( ( ph /\ k e. om ) /\ -. k e. N ) -> ( F ` (/) ) e. A )
9		simpr 110	. . . . 5 |- ( ( ph /\ k e. om ) -> k e. om )
10		enumctlemm.n	. . . . . 6 |- ( ph -> N e. om )
11	10	adantr 276	. . . . 5 |- ( ( ph /\ k e. om ) -> N e. om )
12		nndcel 6767	. . . . 5 |- ( ( k e. om /\ N e. om ) -> DECID k e. N )
13	9, 11, 12	syl2anc 415	. . . 4 |- ( ( ph /\ k e. om ) -> DECID k e. N )
14	5, 8, 13	ifcldadc 3670	. . 3 |- ( ( ph /\ k e. om ) -> if ( k e. N , ( F ` k ) , ( F ` (/) ) ) e. A )
15		enumctlemm.g	. . 3 |- G = ( k e. om |-> if ( k e. N , ( F ` k ) , ( F ` (/) ) ) )
16	14, 15	fmptd 5856	. 2 |- ( ph -> G : om --> A )
17		foelrn 5952	. . . . . 6 |- ( ( F : N -onto-> A /\ y e. A ) -> E. x e. N y = ( F ` x ) )
18	1, 17	sylan 283	. . . . 5 |- ( ( ph /\ y e. A ) -> E. x e. N y = ( F ` x ) )
19		eleq1w 2299	. . . . . . . . . . 11 |- ( k = x -> ( k e. N <-> x e. N ) )
20		fveq2 5693	. . . . . . . . . . 11 |- ( k = x -> ( F ` k ) = ( F ` x ) )
21	19, 20	ifbieq1d 3663	. . . . . . . . . 10 |- ( k = x -> if ( k e. N , ( F ` k ) , ( F ` (/) ) ) = if ( x e. N , ( F ` x ) , ( F ` (/) ) ) )
22		simpr 110	. . . . . . . . . . 11 |- ( ( ph /\ x e. N ) -> x e. N )
23	10	adantr 276	. . . . . . . . . . 11 |- ( ( ph /\ x e. N ) -> N e. om )
24		elnn 4751	. . . . . . . . . . 11 |- ( ( x e. N /\ N e. om ) -> x e. om )
25	22, 23, 24	syl2anc 415	. . . . . . . . . 10 |- ( ( ph /\ x e. N ) -> x e. om )
26	22	iftrued 3647	. . . . . . . . . . 11 |- ( ( ph /\ x e. N ) -> if ( x e. N , ( F ` x ) , ( F ` (/) ) ) = ( F ` x ) )
27	3	ffvelcdmda 5837	. . . . . . . . . . 11 |- ( ( ph /\ x e. N ) -> ( F ` x ) e. A )
28	26, 27	eqeltrd 2315	. . . . . . . . . 10 |- ( ( ph /\ x e. N ) -> if ( x e. N , ( F ` x ) , ( F ` (/) ) ) e. A )
29	15, 21, 25, 28	fvmptd3 5796	. . . . . . . . 9 |- ( ( ph /\ x e. N ) -> ( G ` x ) = if ( x e. N , ( F ` x ) , ( F ` (/) ) ) )
30	29, 26	eqtrd 2271	. . . . . . . 8 |- ( ( ph /\ x e. N ) -> ( G ` x ) = ( F ` x ) )
31	30	eqeq2d 2250	. . . . . . 7 |- ( ( ph /\ x e. N ) -> ( y = ( G ` x ) <-> y = ( F ` x ) ) )
32	31	rexbidva 2547	. . . . . 6 |- ( ph -> ( E. x e. N y = ( G ` x ) <-> E. x e. N y = ( F ` x ) ) )
33	32	adantr 276	. . . . 5 |- ( ( ph /\ y e. A ) -> ( E. x e. N y = ( G ` x ) <-> E. x e. N y = ( F ` x ) ) )
34	18, 33	mpbird 167	. . . 4 |- ( ( ph /\ y e. A ) -> E. x e. N y = ( G ` x ) )
35		omelon 4754	. . . . . . 7 |- om e. On
36	35	onelssi 4572	. . . . . 6 |- ( N e. om -> N C_ om )
37		ssrexv 3313	. . . . . 6 |- ( N C_ om -> ( E. x e. N y = ( G ` x ) -> E. x e. om y = ( G ` x ) ) )
38	10, 36, 37	3syl 17	. . . . 5 |- ( ph -> ( E. x e. N y = ( G ` x ) -> E. x e. om y = ( G ` x ) ) )
39	38	adantr 276	. . . 4 |- ( ( ph /\ y e. A ) -> ( E. x e. N y = ( G ` x ) -> E. x e. om y = ( G ` x ) ) )
40	34, 39	mpd 13	. . 3 |- ( ( ph /\ y e. A ) -> E. x e. om y = ( G ` x ) )
41	40	ralrimiva 2623	. 2 |- ( ph -> A. y e. A E. x e. om y = ( G ` x ) )
42		dffo3 5849	. 2 |- ( G : om -onto-> A <-> ( G : om --> A /\ A. y e. A E. x e. om y = ( G ` x ) ) )
43	16, 41, 42	sylanbrc 421	1 |- ( ph -> G : om -onto-> A )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 846   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   C_ wss 3220   (/)c0 3520   ifcif 3638   |-> cmpt 4190   omcom 4735   -->wf 5371   -onto->wfo 5373   ` cfv 5375

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-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  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-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  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-fo 5381  df-fv 5383

This theorem is referenced by:  enumct  7449