Theorem updjudhcoinrg 7182

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 7180	. . . 4 ⊢ (𝜑 → 𝐻:(𝐴 ⊔ 𝐵)⟶𝐶)
5		ffn 5424	. . . 4 ⊢ (𝐻:(𝐴 ⊔ 𝐵)⟶𝐶 → 𝐻 Fn (𝐴 ⊔ 𝐵))
6	4, 5	syl 14	. . 3 ⊢ (𝜑 → 𝐻 Fn (𝐴 ⊔ 𝐵))
7		inrresf1 7163	. . . 4 ⊢ (inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵)
8		f1fn 5482	. . . 4 ⊢ ((inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵) Fn 𝐵)
9	7, 8	mp1i 10	. . 3 ⊢ (𝜑 → (inr ↾ 𝐵) Fn 𝐵)
10		f1f 5480	. . . . 5 ⊢ ((inr ↾ 𝐵):𝐵–1-1→(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵))
11	7, 10	ax-mp 5	. . . 4 ⊢ (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵)
12		frn 5433	. . . 4 ⊢ ((inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵) → ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵))
13	11, 12	mp1i 10	. . 3 ⊢ (𝜑 → ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵))
14		fnco 5383	. . 3 ⊢ ((𝐻 Fn (𝐴 ⊔ 𝐵) ∧ (inr ↾ 𝐵) Fn 𝐵 ∧ ran (inr ↾ 𝐵) ⊆ (𝐴 ⊔ 𝐵)) → (𝐻 ∘ (inr ↾ 𝐵)) Fn 𝐵)
15	6, 9, 13, 14	syl3anc 1249	. 2 ⊢ (𝜑 → (𝐻 ∘ (inr ↾ 𝐵)) Fn 𝐵)
16		ffn 5424	. . 3 ⊢ (𝐺:𝐵⟶𝐶 → 𝐺 Fn 𝐵)
17	2, 16	syl 14	. 2 ⊢ (𝜑 → 𝐺 Fn 𝐵)
18		fvco2 5647	. . . 4 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐻‘((inr ↾ 𝐵)‘𝑏)))
19	9, 18	sylan 283	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐻‘((inr ↾ 𝐵)‘𝑏)))
20		fvres 5599	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 → ((inr ↾ 𝐵)‘𝑏) = (inr‘𝑏))
21	20	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((inr ↾ 𝐵)‘𝑏) = (inr‘𝑏))
22	21	fveq2d 5579	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘((inr ↾ 𝐵)‘𝑏)) = (𝐻‘(inr‘𝑏)))
23	3	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))))
24		fveq2 5575	. . . . . . . . 9 ⊢ (𝑥 = (inr‘𝑏) → (1st ‘𝑥) = (1st ‘(inr‘𝑏)))
25	24	eqeq1d 2213	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → ((1st ‘𝑥) = ∅ ↔ (1st ‘(inr‘𝑏)) = ∅))
26		fveq2 5575	. . . . . . . . 9 ⊢ (𝑥 = (inr‘𝑏) → (2nd ‘𝑥) = (2nd ‘(inr‘𝑏)))
27	26	fveq2d 5579	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → (𝐹‘(2nd ‘𝑥)) = (𝐹‘(2nd ‘(inr‘𝑏))))
28	26	fveq2d 5579	. . . . . . . 8 ⊢ (𝑥 = (inr‘𝑏) → (𝐺‘(2nd ‘𝑥)) = (𝐺‘(2nd ‘(inr‘𝑏))))
29	25, 27, 28	ifbieq12d 3596	. . . . . . 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 7177	. . . . . . . . . 10 ⊢ (𝑏 ∈ 𝐵 → (1st ‘(inr‘𝑏)) = 1o)
32		1n0 6517	. . . . . . . . . . . 12 ⊢ 1o ≠ ∅
33	32	neii 2377	. . . . . . . . . . 11 ⊢ ¬ 1o = ∅
34		eqeq1 2211	. . . . . . . . . . 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 3580	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → if((1st ‘(inr‘𝑏)) = ∅, (𝐹‘(2nd ‘(inr‘𝑏))), (𝐺‘(2nd ‘(inr‘𝑏)))) = (𝐺‘(2nd ‘(inr‘𝑏))))
40	30, 39	eqtrd 2237	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑥 = (inr‘𝑏)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = (𝐺‘(2nd ‘(inr‘𝑏))))
41		djurcl 7153	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 → (inr‘𝑏) ∈ (𝐴 ⊔ 𝐵))
42	41	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (inr‘𝑏) ∈ (𝐴 ⊔ 𝐵))
43	2	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐺:𝐵⟶𝐶)
44		2ndinr 7178	. . . . . . . 8 ⊢ (𝑏 ∈ 𝐵 → (2nd ‘(inr‘𝑏)) = 𝑏)
45	44	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (2nd ‘(inr‘𝑏)) = 𝑏)
46		simpr 110	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
47	45, 46	eqeltrd 2281	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (2nd ‘(inr‘𝑏)) ∈ 𝐵)
48	43, 47	ffvelcdmd 5715	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐺‘(2nd ‘(inr‘𝑏))) ∈ 𝐶)
49	23, 40, 42, 48	fvmptd 5659	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘(inr‘𝑏)) = (𝐺‘(2nd ‘(inr‘𝑏))))
50	22, 49	eqtrd 2237	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐻‘((inr ↾ 𝐵)‘𝑏)) = (𝐺‘(2nd ‘(inr‘𝑏))))
51	45	fveq2d 5579	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → (𝐺‘(2nd ‘(inr‘𝑏))) = (𝐺‘𝑏))
52	19, 50, 51	3eqtrd 2241	. 2 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ((𝐻 ∘ (inr ↾ 𝐵))‘𝑏) = (𝐺‘𝑏))
53	15, 17, 52	eqfnfvd 5679	1 ⊢ (𝜑 → (𝐻 ∘ (inr ↾ 𝐵)) = 𝐺)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1372   ∈ wcel 2175   ⊆ wss 3165  ∅c0 3459  ifcif 3570   ↦ cmpt 4104  ran crn 4675   ↾ cres 4676   ∘ ccom 4678   Fn wfn 5265  ⟶wf 5266  –1-1→wf1 5267  ‘cfv 5270  1^st c1st 6223  2^nd c2nd 6224  1_oc1o 6494   ⊔ cdju 7138  inrcinr 7147

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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-if 3571  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-id 4339  df-iord 4412  df-on 4414  df-suc 4417  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-1st 6225  df-2nd 6226  df-1o 6501  df-dju 7139  df-inl 7148  df-inr 7149

This theorem is referenced by:  updjud  7183