Theorem ctiunctlemf 13329

Description: Lemma for ctiunct 13331. (Contributed by Jim Kingdon, 28-Oct-2023.)

Hypotheses

Ref	Expression
ctiunct.som	|- ( ph -> S C_ om )
ctiunct.sdc	|- ( ph -> A. n e. om DECID n e. S )
ctiunct.f	|- ( ph -> F : S -onto-> A )
ctiunct.tom	|- ( ( ph /\ x e. A ) -> T C_ om )
ctiunct.tdc	|- ( ( ph /\ x e. A ) -> A. n e. om DECID n e. T )
ctiunct.g	|- ( ( ph /\ x e. A ) -> G : T -onto-> B )
ctiunct.j	|- ( ph -> J : om -1-1-onto-> ( om X. om ) )
ctiunct.u	|- U = { z e. om | ( ( 1st ` ( J ` z ) ) e. S /\ ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T ) }
ctiunct.h	|- H = ( n e. U |-> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) )

Assertion

Ref	Expression
ctiunctlemf	|- ( ph -> H : U --> U_ x e. A B )

Distinct variable groups:   A, n, x   B, n   x, F, z   x, J, z   z, S   z, T   U, n   ph, n, x   x, z, n

Allowed substitution hints:   ph( z)   A( z)   B( x, z)   S( x, n)   T( x, n)   U( x, z)   F( n)   G( x, z, n)   H( x, z, n)   J( n)

Proof of Theorem ctiunctlemf

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ctiunct.f	. . . . . . . 8 |- ( ph -> F : S -onto-> A )
2	1	adantr 276	. . . . . . 7 |- ( ( ph /\ n e. U ) -> F : S -onto-> A )
3		fof 5615	. . . . . . 7 |- ( F : S -onto-> A -> F : S --> A )
4	2, 3	syl 14	. . . . . 6 |- ( ( ph /\ n e. U ) -> F : S --> A )
5		ctiunct.som	. . . . . . . 8 |- ( ph -> S C_ om )
6	5	adantr 276	. . . . . . 7 |- ( ( ph /\ n e. U ) -> S C_ om )
7		ctiunct.sdc	. . . . . . . 8 |- ( ph -> A. n e. om DECID n e. S )
8	7	adantr 276	. . . . . . 7 |- ( ( ph /\ n e. U ) -> A. n e. om DECID n e. S )
9		ctiunct.tom	. . . . . . . 8 |- ( ( ph /\ x e. A ) -> T C_ om )
10	9	adantlr 481	. . . . . . 7 |- ( ( ( ph /\ n e. U ) /\ x e. A ) -> T C_ om )
11		ctiunct.tdc	. . . . . . . 8 |- ( ( ph /\ x e. A ) -> A. n e. om DECID n e. T )
12	11	adantlr 481	. . . . . . 7 |- ( ( ( ph /\ n e. U ) /\ x e. A ) -> A. n e. om DECID n e. T )
13		ctiunct.g	. . . . . . . 8 |- ( ( ph /\ x e. A ) -> G : T -onto-> B )
14	13	adantlr 481	. . . . . . 7 |- ( ( ( ph /\ n e. U ) /\ x e. A ) -> G : T -onto-> B )
15		ctiunct.j	. . . . . . . 8 |- ( ph -> J : om -1-1-onto-> ( om X. om ) )
16	15	adantr 276	. . . . . . 7 |- ( ( ph /\ n e. U ) -> J : om -1-1-onto-> ( om X. om ) )
17		ctiunct.u	. . . . . . 7 |- U = { z e. om | ( ( 1st ` ( J ` z ) ) e. S /\ ( 2nd ` ( J ` z ) ) e. [_ ( F ` ( 1st ` ( J ` z ) ) ) / x ]_ T ) }
18		simpr 110	. . . . . . 7 |- ( ( ph /\ n e. U ) -> n e. U )
19	6, 8, 2, 10, 12, 14, 16, 17, 18	ctiunctlemu1st 13325	. . . . . 6 |- ( ( ph /\ n e. U ) -> ( 1st ` ( J ` n ) ) e. S )
20	4, 19	ffvelcdmd 5844	. . . . 5 |- ( ( ph /\ n e. U ) -> ( F ` ( 1st ` ( J ` n ) ) ) e. A )
21		fof 5615	. . . . . . . . . . 11 |- ( G : T -onto-> B -> G : T --> B )
22	13, 21	syl 14	. . . . . . . . . 10 |- ( ( ph /\ x e. A ) -> G : T --> B )
23	22	ralrimiva 2623	. . . . . . . . 9 |- ( ph -> A. x e. A G : T --> B )
24	23	adantr 276	. . . . . . . 8 |- ( ( ph /\ n e. U ) -> A. x e. A G : T --> B )
25		rspsbc 3135	. . . . . . . 8 |- ( ( F ` ( 1st ` ( J ` n ) ) ) e. A -> ( A. x e. A G : T --> B -> [. ( F ` ( 1st ` ( J ` n ) ) ) / x ]. G : T --> B ) )
26	20, 24, 25	sylc 62	. . . . . . 7 |- ( ( ph /\ n e. U ) -> [. ( F ` ( 1st ` ( J ` n ) ) ) / x ]. G : T --> B )
27		sbcfg 5532	. . . . . . . 8 |- ( ( F ` ( 1st ` ( J ` n ) ) ) e. A -> ( [. ( F ` ( 1st ` ( J ` n ) ) ) / x ]. G : T --> B <-> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G : [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ T --> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B ) )
28	20, 27	syl 14	. . . . . . 7 |- ( ( ph /\ n e. U ) -> ( [. ( F ` ( 1st ` ( J ` n ) ) ) / x ]. G : T --> B <-> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G : [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ T --> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B ) )
29	26, 28	mpbid 147	. . . . . 6 |- ( ( ph /\ n e. U ) -> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G : [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ T --> [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B )
30	6, 8, 2, 10, 12, 14, 16, 17, 18	ctiunctlemu2nd 13326	. . . . . 6 |- ( ( ph /\ n e. U ) -> ( 2nd ` ( J ` n ) ) e. [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ T )
31	29, 30	ffvelcdmd 5844	. . . . 5 |- ( ( ph /\ n e. U ) -> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B )
32		csbeq1 3150	. . . . . . 7 |- ( y = ( F ` ( 1st ` ( J ` n ) ) ) -> [_ y / x ]_ B = [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B )
33	32	eleq2d 2308	. . . . . 6 |- ( y = ( F ` ( 1st ` ( J ` n ) ) ) -> ( ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ y / x ]_ B <-> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B ) )
34	33	rspcev 2929	. . . . 5 |- ( ( ( F ` ( 1st ` ( J ` n ) ) ) e. A /\ ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ B ) -> E. y e. A ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ y / x ]_ B )
35	20, 31, 34	syl2anc 415	. . . 4 |- ( ( ph /\ n e. U ) -> E. y e. A ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ y / x ]_ B )
36		eliun 4016	. . . 4 |- ( ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. U_ y e. A [_ y / x ]_ B <-> E. y e. A ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. [_ y / x ]_ B )
37	35, 36	sylibr 134	. . 3 |- ( ( ph /\ n e. U ) -> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. U_ y e. A [_ y / x ]_ B )
38		nfcv 2392	. . . 4 |- F/_ y B
39		nfcsb1v 3180	. . . 4 |- F/_ x [_ y / x ]_ B
40		csbeq1a 3156	. . . 4 |- ( x = y -> B = [_ y / x ]_ B )
41	38, 39, 40	cbviun 4049	. . 3 |- U_ x e. A B = U_ y e. A [_ y / x ]_ B
42	37, 41	eleqtrrdi 2332	. 2 |- ( ( ph /\ n e. U ) -> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) e. U_ x e. A B )
43		ctiunct.h	. 2 |- H = ( n e. U |-> ( [_ ( F ` ( 1st ` ( J ` n ) ) ) / x ]_ G ` ( 2nd ` ( J ` n ) ) ) )
44	42, 43	fmptd 5862	1 |- ( ph -> H : U --> U_ x e. A B )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 846   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532   [.wsbc 3051   [_csb 3147   C_ wss 3220   U_ciun 4012   |-> cmpt 4192   omcom 4737   X. cxp 4772   -->wf 5373   -onto->wfo 5375   -1-1-onto->wf1o 5376   ` cfv 5377   1stc1st 6372   2ndc2nd 6373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385

This theorem is used by:  ctiunctlemfo  13330