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 18225

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 2765	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2765	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
4		xpchomfval.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
5		xpchomfval.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐷)
6		eqid 2765	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2765	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
8		simpl 487	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 489	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10		xpchomfval.y	. . . . . 6 ⊢ 𝐵 = (Base‘𝑇)
11	1, 2, 3	xpcbas 18224	. . . . . 6 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
12	10, 11	eqtr4i 2791	. . . . 5 ⊢ 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
13	12	a1i 11	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ((Base‘𝐶) × (Base‘𝐷)))
14		eqidd 2766	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
15		eqidd 2766	. . . 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 18223	. . 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 18007	. . 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 17455	. . 3 ⊢ Hom = Slot (Hom ‘ndx)
19		snsstp2 4778	. . 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 6885	. . . . 5 ⊢ 𝐵 ∈ V
21	20, 20	mpoex 8064	. . . 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 17254	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
25		fnxpc 18222	. . . . . . . 8 ⊢ ×_c Fn (V × V)
26		fndm 6628	. . . . . . . 8 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
27	25, 26	ax-mp 5	. . . . . . 7 ⊢ dom ×_c = (V × V)
28	27	ndmov 7584	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
29	1, 28	eqtrid 2812	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
30	29	fveq2d 6875	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Hom ‘𝑇) = (Hom ‘∅))
31	18	str0 17239	. . . 4 ⊢ ∅ = (Hom ‘∅)
32	30, 23, 31	3eqtr4g 2825	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = ∅)
33	29	fveq2d 6875	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
34		base0 17264	. . . . . 6 ⊢ ∅ = (Base‘∅)
35	33, 10, 34	3eqtr4g 2825	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ∅)
36	35	olcd 887	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐵 = ∅ ∨ 𝐵 = ∅))
37		0mpo0 7483	. . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = ∅)
38	36, 37	syl 18	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = ∅)
39	32, 38	eqtr4d 2803	. 2 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
40	24, 39	pm2.61i 184	1 ⊢ 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ∧ wa 400 ∨ wo 860 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ∅c0 4288 {ctp 4589 ⟨cop 4591 × cxp 5650 dom cdm 5652 Fn wfn 6520 ‘cfv 6525 (class class class)co 7400 ∈ cmpo 7402 1^st c1st 7972 2^nd c2nd 7973 1c1 11089 5c5 12289 cdc 12702 ndxcnx 17243 Basecbs 17259 Hom chom 17311 compcco 17312 ×_c cxpc 18214

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-fz 13527 df-struct 17197 df-slot 17232 df-ndx 17244 df-base 17260 df-hom 17324 df-cco 17325 df-xpc 18218

This theorem is referenced by: xpchom 18226 relxpchom 18227 xpccofval 18228 catcxpccl 18253 xpcpropd 18254 xpcfuchomfval 49882

W3C validator