Theorem updjudhcoinlf 7420

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	⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
updjud.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
updjudhf.h	⊢ 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))

Assertion

Ref	Expression
updjudhcoinlf	⊢ (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) = 𝐹)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜑,𝑥   𝑥,𝐹

Allowed substitution hints:   𝐺(𝑥)   𝐻(𝑥)

Proof of Theorem updjudhcoinlf

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		updjud.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
2		updjud.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
3		updjudhf.h	. . . . 5 ⊢ 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))
4	1, 2, 3	updjudhf 7419	. . . 4 ⊢ (𝜑 → 𝐻:(𝐴 ⊔ 𝐵)⟶𝐶)
5		ffn 5533	. . . 4 ⊢ (𝐻:(𝐴 ⊔ 𝐵)⟶𝐶 → 𝐻 Fn (𝐴 ⊔ 𝐵))
6	4, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐻 Fn (𝐴 ⊔ 𝐵))
7		inlresf1 7401	. . . 4 ⊢ (inl ↾ 𝐴):𝐴–1-1→(𝐴 ⊔ 𝐵)
8		f1fn 5600	. . . 4 ⊢ ((inl ↾ 𝐴):𝐴–1-1→(𝐴 ⊔ 𝐵) → (inl ↾ 𝐴) Fn 𝐴)
9	7, 8	mp1i 10	. . 3 ⊢ (𝜑 → (inl ↾ 𝐴) Fn 𝐴)
10		f1f 5598	. . . . 5 ⊢ ((inl ↾ 𝐴):𝐴–1-1→(𝐴 ⊔ 𝐵) → (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵))
11	7, 10	ax-mp 5	. . . 4 ⊢ (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)
12		frn 5542	. . . 4 ⊢ ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) → ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵))
13	11, 12	mp1i 10	. . 3 ⊢ (𝜑 → ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵))
14		fnco 5491	. . 3 ⊢ ((𝐻 Fn (𝐴 ⊔ 𝐵) ∧ (inl ↾ 𝐴) Fn 𝐴 ∧ ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵)) → (𝐻 ∘ (inl ↾ 𝐴)) Fn 𝐴)
15	6, 9, 13, 14	syl3anc 1278	. 2 ⊢ (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) Fn 𝐴)
16		ffn 5533	. . 3 ⊢ (𝐹:𝐴⟶𝐶 → 𝐹 Fn 𝐴)
17	1, 16	syl 14	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐴)
18		fvco2 5774	. . . 4 ⊢ (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐻‘((inl ↾ 𝐴)‘𝑎)))
19	9, 18	sylan 283	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐻‘((inl ↾ 𝐴)‘𝑎)))
20		fvres 5719	. . . . . 6 ⊢ (𝑎 ∈ 𝐴 → ((inl ↾ 𝐴)‘𝑎) = (inl‘𝑎))
21	20	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((inl ↾ 𝐴)‘𝑎) = (inl‘𝑎))
22	21	fveq2d 5699	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘((inl ↾ 𝐴)‘𝑎)) = (𝐻‘(inl‘𝑎)))
23	3	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))))
24		fveq2 5695	. . . . . . . . 9 ⊢ (𝑥 = (inl‘𝑎) → (1st ‘𝑥) = (1st ‘(inl‘𝑎)))
25	24	eqeq1d 2247	. . . . . . . 8 ⊢ (𝑥 = (inl‘𝑎) → ((1st ‘𝑥) = ∅ ↔ (1st ‘(inl‘𝑎)) = ∅))
26		fveq2 5695	. . . . . . . . 9 ⊢ (𝑥 = (inl‘𝑎) → (2nd ‘𝑥) = (2nd ‘(inl‘𝑎)))
27	26	fveq2d 5699	. . . . . . . 8 ⊢ (𝑥 = (inl‘𝑎) → (𝐹‘(2nd ‘𝑥)) = (𝐹‘(2nd ‘(inl‘𝑎))))
28	26	fveq2d 5699	. . . . . . . 8 ⊢ (𝑥 = (inl‘𝑎) → (𝐺‘(2nd ‘𝑥)) = (𝐺‘(2nd ‘(inl‘𝑎))))
29	25, 27, 28	ifbieq12d 3667	. . . . . . 7 ⊢ (𝑥 = (inl‘𝑎) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))))
30	29	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))))
31		1stinl 7414	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝐴 → (1st ‘(inl‘𝑎)) = ∅)
32	31	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1st ‘(inl‘𝑎)) = ∅)
33	32	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → (1st ‘(inl‘𝑎)) = ∅)
34	33	iftrued 3647	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))) = (𝐹‘(2nd ‘(inl‘𝑎))))
35	30, 34	eqtrd 2271	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = (𝐹‘(2nd ‘(inl‘𝑎))))
36		djulcl 7391	. . . . . 6 ⊢ (𝑎 ∈ 𝐴 → (inl‘𝑎) ∈ (𝐴 ⊔ 𝐵))
37	36	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (inl‘𝑎) ∈ (𝐴 ⊔ 𝐵))
38	1	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐹:𝐴⟶𝐶)
39		2ndinl 7415	. . . . . . . 8 ⊢ (𝑎 ∈ 𝐴 → (2nd ‘(inl‘𝑎)) = 𝑎)
40	39	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (2nd ‘(inl‘𝑎)) = 𝑎)
41		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
42	40, 41	eqeltrd 2315	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (2nd ‘(inl‘𝑎)) ∈ 𝐴)
43	38, 42	ffvelcdmd 5844	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘(2nd ‘(inl‘𝑎))) ∈ 𝐶)
44	23, 35, 37, 43	fvmptd 5786	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘(inl‘𝑎)) = (𝐹‘(2nd ‘(inl‘𝑎))))
45	22, 44	eqtrd 2271	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘((inl ↾ 𝐴)‘𝑎)) = (𝐹‘(2nd ‘(inl‘𝑎))))
46	40	fveq2d 5699	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘(2nd ‘(inl‘𝑎))) = (𝐹‘𝑎))
47	19, 45, 46	3eqtrd 2275	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐹‘𝑎))
48	15, 17, 47	eqfnfvd 5809	1 ⊢ (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) = 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   ⊆ wss 3220  ∅c0 3520  ifcif 3638   ↦ cmpt 4192  ran crn 4775   ↾ cres 4776   ∘ ccom 4778   Fn wfn 5372  ⟶wf 5373  –1-1→wf1 5374  ‘cfv 5377  1^st c1st 6372  2^nd c2nd 6373   ⊔ cdju 7377  inlcinl 7385

This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-dc 847  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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-dju 7378  df-inl 7387  df-inr 7388

This theorem is used by:  updjud  7422