Theorem updjudhcoinlf 7045

Description: The composition of the mapping of an element of the disjoint union to the value of the corresponding function and the left injection equals the first function. (Contributed by AV, 27-Jun-2022.)

Hypotheses

Ref	Expression
updjud.f	|- ( ph -> F : A --> C )
updjud.g	|- ( ph -> G : B --> C )
updjudhf.h	|- H = ( x e. ( A ⊔ B ) |-> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) )

Assertion

Ref	Expression
updjudhcoinlf	|- ( ph -> ( H o. (inl |` A ) ) = F )

Distinct variable groups:   x, A   x, B   x, C   ph, x   x, F

Allowed substitution hints:   G( x)   H( x)

Proof of Theorem updjudhcoinlf

Dummy variable a is distinct from all other variables.

Step	Hyp	Ref	Expression
1		updjud.f	. . . . 5 |- ( ph -> F : A --> C )
2		updjud.g	. . . . 5 |- ( ph -> G : B --> C )
3		updjudhf.h	. . . . 5 |- H = ( x e. ( A ⊔ B ) |-> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) )
4	1, 2, 3	updjudhf 7044	. . . 4 |- ( ph -> H : ( A ⊔ B ) --> C )
5		ffn 5337	. . . 4 |- ( H : ( A ⊔ B ) --> C -> H Fn ( A ⊔ B ) )
6	4, 5	syl 14	. . 3 |- ( ph -> H Fn ( A ⊔ B ) )
7		inlresf1 7026	. . . 4 |- (inl |` A ) : A -1-1-> ( A ⊔ B )
8		f1fn 5395	. . . 4 |- ( (inl |` A ) : A -1-1-> ( A ⊔ B ) -> (inl |` A ) Fn A )
9	7, 8	mp1i 10	. . 3 |- ( ph -> (inl |` A ) Fn A )
10		f1f 5393	. . . . 5 |- ( (inl |` A ) : A -1-1-> ( A ⊔ B ) -> (inl |` A ) : A --> ( A ⊔ B ) )
11	7, 10	ax-mp 5	. . . 4 |- (inl |` A ) : A --> ( A ⊔ B )
12		frn 5346	. . . 4 |- ( (inl |` A ) : A --> ( A ⊔ B ) -> ran (inl |` A ) C_ ( A ⊔ B ) )
13	11, 12	mp1i 10	. . 3 |- ( ph -> ran (inl |` A ) C_ ( A ⊔ B ) )
14		fnco 5296	. . 3 |- ( ( H Fn ( A ⊔ B ) /\ (inl |` A ) Fn A /\ ran (inl |` A ) C_ ( A ⊔ B ) ) -> ( H o. (inl |` A ) ) Fn A )
15	6, 9, 13, 14	syl3anc 1228	. 2 |- ( ph -> ( H o. (inl |` A ) ) Fn A )
16		ffn 5337	. . 3 |- ( F : A --> C -> F Fn A )
17	1, 16	syl 14	. 2 |- ( ph -> F Fn A )
18		fvco2 5555	. . . 4 |- ( ( (inl |` A ) Fn A /\ a e. A ) -> ( ( H o. (inl |` A ) ) ` a ) = ( H ` ( (inl |` A ) ` a ) ) )
19	9, 18	sylan 281	. . 3 |- ( ( ph /\ a e. A ) -> ( ( H o. (inl |` A ) ) ` a ) = ( H ` ( (inl |` A ) ` a ) ) )
20		fvres 5510	. . . . . 6 |- ( a e. A -> ( (inl |` A ) ` a ) = (inl ` a ) )
21	20	adantl 275	. . . . 5 |- ( ( ph /\ a e. A ) -> ( (inl |` A ) ` a ) = (inl ` a ) )
22	21	fveq2d 5490	. . . 4 |- ( ( ph /\ a e. A ) -> ( H ` ( (inl |` A ) ` a ) ) = ( H ` (inl ` a ) ) )
23	3	a1i 9	. . . . 5 |- ( ( ph /\ a e. A ) -> H = ( x e. ( A ⊔ B ) |-> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) ) )
24		fveq2 5486	. . . . . . . . 9 |- ( x = (inl ` a ) -> ( 1st ` x ) = ( 1st ` (inl ` a ) ) )
25	24	eqeq1d 2174	. . . . . . . 8 |- ( x = (inl ` a ) -> ( ( 1st ` x ) = (/) <-> ( 1st ` (inl ` a ) ) = (/) ) )
26		fveq2 5486	. . . . . . . . 9 |- ( x = (inl ` a ) -> ( 2nd ` x ) = ( 2nd ` (inl ` a ) ) )
27	26	fveq2d 5490	. . . . . . . 8 |- ( x = (inl ` a ) -> ( F ` ( 2nd ` x ) ) = ( F ` ( 2nd ` (inl ` a ) ) ) )
28	26	fveq2d 5490	. . . . . . . 8 |- ( x = (inl ` a ) -> ( G ` ( 2nd ` x ) ) = ( G ` ( 2nd ` (inl ` a ) ) ) )
29	25, 27, 28	ifbieq12d 3546	. . . . . . 7 |- ( x = (inl ` a ) -> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) = if ( ( 1st ` (inl ` a ) ) = (/) , ( F ` ( 2nd ` (inl ` a ) ) ) , ( G ` ( 2nd ` (inl ` a ) ) ) ) )
30	29	adantl 275	. . . . . 6 |- ( ( ( ph /\ a e. A ) /\ x = (inl ` a ) ) -> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) = if ( ( 1st ` (inl ` a ) ) = (/) , ( F ` ( 2nd ` (inl ` a ) ) ) , ( G ` ( 2nd ` (inl ` a ) ) ) ) )
31		1stinl 7039	. . . . . . . . 9 |- ( a e. A -> ( 1st ` (inl ` a ) ) = (/) )
32	31	adantl 275	. . . . . . . 8 |- ( ( ph /\ a e. A ) -> ( 1st ` (inl ` a ) ) = (/) )
33	32	adantr 274	. . . . . . 7 |- ( ( ( ph /\ a e. A ) /\ x = (inl ` a ) ) -> ( 1st ` (inl ` a ) ) = (/) )
34	33	iftrued 3527	. . . . . 6 |- ( ( ( ph /\ a e. A ) /\ x = (inl ` a ) ) -> if ( ( 1st ` (inl ` a ) ) = (/) , ( F ` ( 2nd ` (inl ` a ) ) ) , ( G ` ( 2nd ` (inl ` a ) ) ) ) = ( F ` ( 2nd ` (inl ` a ) ) ) )
35	30, 34	eqtrd 2198	. . . . 5 |- ( ( ( ph /\ a e. A ) /\ x = (inl ` a ) ) -> if ( ( 1st ` x ) = (/) , ( F ` ( 2nd ` x ) ) , ( G ` ( 2nd ` x ) ) ) = ( F ` ( 2nd ` (inl ` a ) ) ) )
36		djulcl 7016	. . . . . 6 |- ( a e. A -> (inl ` a ) e. ( A ⊔ B ) )
37	36	adantl 275	. . . . 5 |- ( ( ph /\ a e. A ) -> (inl ` a ) e. ( A ⊔ B ) )
38	1	adantr 274	. . . . . 6 |- ( ( ph /\ a e. A ) -> F : A --> C )
39		2ndinl 7040	. . . . . . . 8 |- ( a e. A -> ( 2nd ` (inl ` a ) ) = a )
40	39	adantl 275	. . . . . . 7 |- ( ( ph /\ a e. A ) -> ( 2nd ` (inl ` a ) ) = a )
41		simpr 109	. . . . . . 7 |- ( ( ph /\ a e. A ) -> a e. A )
42	40, 41	eqeltrd 2243	. . . . . 6 |- ( ( ph /\ a e. A ) -> ( 2nd ` (inl ` a ) ) e. A )
43	38, 42	ffvelrnd 5621	. . . . 5 |- ( ( ph /\ a e. A ) -> ( F ` ( 2nd ` (inl ` a ) ) ) e. C )
44	23, 35, 37, 43	fvmptd 5567	. . . 4 |- ( ( ph /\ a e. A ) -> ( H ` (inl ` a ) ) = ( F ` ( 2nd ` (inl ` a ) ) ) )
45	22, 44	eqtrd 2198	. . 3 |- ( ( ph /\ a e. A ) -> ( H ` ( (inl |` A ) ` a ) ) = ( F ` ( 2nd ` (inl ` a ) ) ) )
46	40	fveq2d 5490	. . 3 |- ( ( ph /\ a e. A ) -> ( F ` ( 2nd ` (inl ` a ) ) ) = ( F ` a ) )
47	19, 45, 46	3eqtrd 2202	. 2 |- ( ( ph /\ a e. A ) -> ( ( H o. (inl |` A ) ) ` a ) = ( F ` a ) )
48	15, 17, 47	eqfnfvd 5586	1 |- ( ph -> ( H o. (inl |` A ) ) = F )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1343   e. wcel 2136   C_ wss 3116   (/)c0 3409   ifcif 3520   |-> cmpt 4043   ran crn 4605   |` cres 4606   o. ccom 4608   Fn wfn 5183   -->wf 5184   -1-1->wf1 5185   ` cfv 5188   1stc1st 6106   2ndc2nd 6107   ⊔ cdju 7002  inlcinl 7010

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411

This theorem depends on definitions:  df-bi 116  df-dc 825  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-suc 4349  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-1st 6108  df-2nd 6109  df-1o 6384  df-dju 7003  df-inl 7012  df-inr 7013

This theorem is referenced by:  updjud  7047