xpchomfval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xpchomfval		Structured version Visualization version GIF version

Theorem xpchomfval 18224

Description: Set of morphisms of the binary product of categories. (Contributed by Mario Carneiro, 11-Jan-2017.) (Proof shortened by AV, 1-Mar-2024.)

**Hypotheses**
Ref	Expression
xpchomfval.t	⊢ 𝑇 = (𝐶 ×_c 𝐷)
xpchomfval.y	⊢ 𝐵 = (Base‘𝑇)
xpchomfval.h	⊢ 𝐻 = (Hom ‘𝐶)
xpchomfval.j	⊢ 𝐽 = (Hom ‘𝐷)
xpchomfval.k	⊢ 𝐾 = (Hom ‘𝑇)

**Assertion**
Ref	Expression
xpchomfval	⊢ 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))

Distinct variable groups: 𝑣,𝑢,𝐵 𝑢,𝐶,𝑣 𝑢,𝐷,𝑣 𝑢,𝐻,𝑣 𝑢,𝐽,𝑣 Allowed substitution hints: 𝑇(𝑣,𝑢) 𝐾(𝑣,𝑢)

Proof of Theorem xpchomfval Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpchomfval.t	. . . 4 ⊢ 𝑇 = (𝐶 ×_c 𝐷)
2		eqid 2737	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2737	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
4		xpchomfval.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
5		xpchomfval.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐷)
6		eqid 2737	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2737	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
8		simpl 482	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 484	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10		xpchomfval.y	. . . . . 6 ⊢ 𝐵 = (Base‘𝑇)
11	1, 2, 3	xpcbas 18223	. . . . . 6 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
12	10, 11	eqtr4i 2768	. . . . 5 ⊢ 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
13	12	a1i 11	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ((Base‘𝐶) × (Base‘𝐷)))
14		eqidd 2738	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
15		eqidd 2738	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩(comp‘𝐶)(1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩(comp‘𝐷)(2^nd ‘𝑦))(2^nd ‘𝑓))⟩)) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩(comp‘𝐶)(1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩(comp‘𝐷)(2^nd ‘𝑦))(2^nd ‘𝑓))⟩)))
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15	xpcval 18222	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩(comp‘𝐶)(1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩(comp‘𝐷)(2^nd ‘𝑦))(2^nd ‘𝑓))⟩))⟩})
17		catstr 18005	. . 3 ⊢ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩(comp‘𝐶)(1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩(comp‘𝐷)(2^nd ‘𝑦))(2^nd ‘𝑓))⟩))⟩} Struct ⟨1, ;15⟩
18		homid 17456	. . 3 ⊢ Hom = Slot (Hom ‘ndx)
19		snsstp2 4817	. . 3 ⊢ {⟨(Hom ‘ndx), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))⟩} ⊆ {⟨(Base‘ndx), 𝐵⟩, ⟨(Hom ‘ndx), (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))⟩, ⟨(comp‘ndx), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))‘𝑥) ↦ ⟨((1^st ‘𝑔)(⟨(1^st ‘(1^st ‘𝑥)), (1^st ‘(2^nd ‘𝑥))⟩(comp‘𝐶)(1^st ‘𝑦))(1^st ‘𝑓)), ((2^nd ‘𝑔)(⟨(2^nd ‘(1^st ‘𝑥)), (2^nd ‘(2^nd ‘𝑥))⟩(comp‘𝐷)(2^nd ‘𝑦))(2^nd ‘𝑓))⟩))⟩}
20	10	fvexi 6920	. . . . 5 ⊢ 𝐵 ∈ V
21	20, 20	mpoex 8104	. . . 4 ⊢ (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) ∈ V
22	21	a1i 11	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) ∈ V)
23		xpchomfval.k	. . 3 ⊢ 𝐾 = (Hom ‘𝑇)
24	16, 17, 18, 19, 22, 23	strfv3 17241	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
25		fnxpc 18221	. . . . . . . 8 ⊢ ×_c Fn (V × V)
26		fndm 6671	. . . . . . . 8 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
27	25, 26	ax-mp 5	. . . . . . 7 ⊢ dom ×_c = (V × V)
28	27	ndmov 7617	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
29	1, 28	eqtrid 2789	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
30	29	fveq2d 6910	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Hom ‘𝑇) = (Hom ‘∅))
31	18	str0 17226	. . . 4 ⊢ ∅ = (Hom ‘∅)
32	30, 23, 31	3eqtr4g 2802	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = ∅)
33	29	fveq2d 6910	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
34		base0 17252	. . . . . 6 ⊢ ∅ = (Base‘∅)
35	33, 10, 34	3eqtr4g 2802	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ∅)
36	35	olcd 875	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐵 = ∅ ∨ 𝐵 = ∅))
37		0mpo0 7516	. . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = ∅)
38	36, 37	syl 17	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = ∅)
39	32, 38	eqtr4d 2780	. 2 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
40	24, 39	pm2.61i 182	1 ⊢ 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ∧ wa 395 ∨ wo 848 = wceq 1540 ∈ wcel 2108 Vcvv 3480 ∅c0 4333 {ctp 4630 ⟨cop 4632 × cxp 5683 dom cdm 5685 Fn wfn 6556 ‘cfv 6561 (class class class)co 7431 ∈ cmpo 7433 1^st c1st 8012 2^nd c2nd 8013 1c1 11156 5c5 12324 cdc 12733 ndxcnx 17230 Basecbs 17247 Hom chom 17308 compcco 17309 ×_c cxpc 18213

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-dec 12734 df-uz 12879 df-fz 13548 df-struct 17184 df-slot 17219 df-ndx 17231 df-base 17248 df-hom 17321 df-cco 17322 df-xpc 18217

This theorem is referenced by: xpchom 18225 relxpchom 18226 xpccofval 18227 catcxpccl 18252 xpcpropd 18253 xpcfuchomfval 48959

W3C validator