Theorem updjudhcoinrg 7140

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

Hypotheses

Ref	Expression
updjud.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
updjud.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
updjudhf.h	⊢ 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))

Assertion

Ref	Expression
updjudhcoinrg	⊢ (𝜑 → (𝐻 ∘ (inr ↾ 𝐵)) = 𝐺)

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

Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem updjudhcoinrg

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 7138	. . . 4 ⊢ (𝜑 → 𝐻:(𝐴 ⊔ 𝐵)⟶𝐶)
5		ffn 5403	. . . 4 ⊢ (𝐻:(𝐴 ⊔ 𝐵)⟶𝐶 → 𝐻 Fn (𝐴 ⊔ 𝐵))
6	4, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐻 Fn (𝐴 ⊔ 𝐵))
7		inrresf1 7121	. . . 4 ⊢ (inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵)
8		f1fn 5461	. . . 4 ⊢ ((inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵) Fn 𝐵)
9	7, 8	mp1i 10	. . 3 ⊢ (𝜑 → (inr ↾ 𝐵) Fn 𝐵)
10		f1f 5459	. . . . 5 ⊢ ((inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵))
11	7, 10	ax-mp 5	. . . 4 ⊢ (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵)
12		frn 5412	. . . 4 ⊢ ((inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵) → ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵))
13	11, 12	mp1i 10	. . 3 ⊢ (𝜑 → ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵))
14		fnco 5362	. . 3 ⊢ ((𝐻 Fn (𝐴 ⊔ 𝐵) ∧ (inr ↾ 𝐵) Fn 𝐵 ∧ ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵)) → (𝐻 ∘ (inr ↾ 𝐵)) Fn 𝐵)
15	6, 9, 13, 14	syl3anc 1249	. 2 ⊢ (𝜑 → (𝐻 ∘ (inr ↾ 𝐵)) Fn 𝐵)
16		ffn 5403	. . 3 ⊢ (𝐺:𝐵⟶𝐶 → 𝐺 Fn 𝐵)
17	2, 16	syl 14	. 2 ⊢ (𝜑 → 𝐺 Fn 𝐵)
18		fvco2 5626	. . . 4 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐻‘((inr ↾ 𝐵)‘𝑏)))
19	9, 18	sylan 283	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐻‘((inr ↾ 𝐵)‘𝑏)))
20		fvres 5578	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 → ((inr ↾ 𝐵)‘𝑏) = (inr‘𝑏))
21	20	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((inr ↾ 𝐵)‘𝑏) = (inr‘𝑏))
22	21	fveq2d 5558	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘((inr ↾ 𝐵)‘𝑏)) = (𝐻‘(inr‘𝑏)))
23	3	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))))
24		fveq2 5554	. . . . . . . . 9 ⊢ (𝑥 = (inr‘𝑏) → (1st ‘𝑥) = (1st ‘(inr‘𝑏)))
25	24	eqeq1d 2202	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → ((1st ‘𝑥) = ∅ ↔ (1st ‘(inr‘𝑏)) = ∅))
26		fveq2 5554	. . . . . . . . 9 ⊢ (𝑥 = (inr‘𝑏) → (2nd ‘𝑥) = (2nd ‘(inr‘𝑏)))
27	26	fveq2d 5558	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → (𝐹‘(2nd ‘𝑥)) = (𝐹‘(2nd ‘(inr‘𝑏))))
28	26	fveq2d 5558	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → (𝐺‘(2nd ‘𝑥)) = (𝐺‘(2nd ‘(inr‘𝑏))))
29	25, 27, 28	ifbieq12d 3583	. . . . . . 7 ⊢ (𝑥 = (inr‘𝑏) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inr‘𝑏)) = ∅, (𝐹‘(2nd ‘(inr‘𝑏))), (𝐺‘(2nd ‘(inr‘𝑏)))))
30	29	adantl 277	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inr‘𝑏)) = ∅, (𝐹‘(2nd ‘(inr‘𝑏))), (𝐺‘(2nd ‘(inr‘𝑏)))))
31		1stinr 7135	. . . . . . . . . 10 ⊢ (𝑏 ∈ 𝐵 → (1st ‘(inr‘𝑏)) = 1o)
32		1n0 6485	. . . . . . . . . . . 12 ⊢ 1o ≠ ∅
33	32	neii 2366	. . . . . . . . . . 11 ⊢ ¬ 1o = ∅
34		eqeq1 2200	. . . . . . . . . . 11 ⊢ ((1st ‘(inr‘𝑏)) = 1o → ((1st ‘(inr‘𝑏)) = ∅ ↔ 1o = ∅))
35	33, 34	mtbiri 676	. . . . . . . . . 10 ⊢ ((1st ‘(inr‘𝑏)) = 1o → ¬ (1st ‘(inr‘𝑏)) = ∅)
36	31, 35	syl 14	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝐵 → ¬ (1st ‘(inr‘𝑏)) = ∅)
37	36	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ (1st ‘(inr‘𝑏)) = ∅)
38	37	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → ¬ (1st ‘(inr‘𝑏)) = ∅)
39	38	iffalsed 3567	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → if((1st ‘(inr‘𝑏)) = ∅, (𝐹‘(2nd ‘(inr‘𝑏))), (𝐺‘(2nd ‘(inr‘𝑏)))) = (𝐺‘(2nd ‘(inr‘𝑏))))
40	30, 39	eqtrd 2226	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = (𝐺‘(2nd ‘(inr‘𝑏))))
41		djurcl 7111	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 → (inr‘𝑏) ∈ (𝐴 ⊔ 𝐵))
42	41	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (inr‘𝑏) ∈ (𝐴 ⊔ 𝐵))
43	2	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐺:𝐵⟶𝐶)
44		2ndinr 7136	. . . . . . . 8 ⊢ (𝑏 ∈ 𝐵 → (2nd ‘(inr‘𝑏)) = 𝑏)
45	44	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (2nd ‘(inr‘𝑏)) = 𝑏)
46		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
47	45, 46	eqeltrd 2270	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (2nd ‘(inr‘𝑏)) ∈ 𝐵)
48	43, 47	ffvelcdmd 5694	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐺‘(2nd ‘(inr‘𝑏))) ∈ 𝐶)
49	23, 40, 42, 48	fvmptd 5638	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘(inr‘𝑏)) = (𝐺‘(2nd ‘(inr‘𝑏))))
50	22, 49	eqtrd 2226	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘((inr ↾ 𝐵)‘𝑏)) = (𝐺‘(2nd ‘(inr‘𝑏))))
51	45	fveq2d 5558	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐺‘(2nd ‘(inr‘𝑏))) = (𝐺‘𝑏))
52	19, 50, 51	3eqtrd 2230	. 2 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐺‘𝑏))
53	15, 17, 52	eqfnfvd 5658	1 ⊢ (𝜑 → (𝐻 ∘ (inr ↾ 𝐵)) = 𝐺)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164   ⊆ wss 3153  ∅c0 3446  ifcif 3557   ↦ cmpt 4090  ran crn 4660   ↾ cres 4661   ∘ ccom 4663   Fn wfn 5249  ⟶wf 5250  –1-1→wf1 5251  ‘cfv 5254  1^st c1st 6191  2^nd c2nd 6192  1_oc1o 6462   ⊔ cdju 7096  inrcinr 7105

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-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1367  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-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-1st 6193  df-2nd 6194  df-1o 6469  df-dju 7097  df-inl 7106  df-inr 7107

This theorem is referenced by:  updjud  7141