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 17896

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 2738	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2738	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
4		xpchomfval.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
5		xpchomfval.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐷)
6		eqid 2738	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2738	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
8		simpl 483	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 485	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10		xpchomfval.y	. . . . . 6 ⊢ 𝐵 = (Base‘𝑇)
11	1, 2, 3	xpcbas 17895	. . . . . 6 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑇)
12	10, 11	eqtr4i 2769	. . . . 5 ⊢ 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
13	12	a1i 11	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ((Base‘𝐶) × (Base‘𝐷)))
14		eqidd 2739	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))) = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
15		eqidd 2739	. . . 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 17894	. . 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 17674	. . 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 17122	. . 3 ⊢ Hom = Slot (Hom ‘ndx)
19		snsstp2 4750	. . 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 6788	. . . . 5 ⊢ 𝐵 ∈ V
21	20, 20	mpoex 7920	. . . 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 16906	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)))))
25		fnxpc 17893	. . . . . . . 8 ⊢ ×_c Fn (V × V)
26		fndm 6536	. . . . . . . 8 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
27	25, 26	ax-mp 5	. . . . . . 7 ⊢ dom ×_c = (V × V)
28	27	ndmov 7456	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
29	1, 28	eqtrid 2790	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
30	29	fveq2d 6778	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Hom ‘𝑇) = (Hom ‘∅))
31	18	str0 16890	. . . 4 ⊢ ∅ = (Hom ‘∅)
32	30, 23, 31	3eqtr4g 2803	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐾 = ∅)
33	29	fveq2d 6778	. . . . . 6 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
34		base0 16917	. . . . . 6 ⊢ ∅ = (Base‘∅)
35	33, 10, 34	3eqtr4g 2803	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐵 = ∅)
36	35	olcd 871	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐵 = ∅ ∨ 𝐵 = ∅))
37		0mpo0 7358	. . . 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 2781	. 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 396 ∨ wo 844 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∅c0 4256 {ctp 4565 ⟨cop 4567 × cxp 5587 dom cdm 5589 Fn wfn 6428 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 1^st c1st 7829 2^nd c2nd 7830 1c1 10872 5c5 12031 cdc 12437 ndxcnx 16894 Basecbs 16912 Hom chom 16973 compcco 16974 ×_c cxpc 17885

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-fz 13240 df-struct 16848 df-slot 16883 df-ndx 16895 df-base 16913 df-hom 16986 df-cco 16987 df-xpc 17889

This theorem is referenced by: xpchom 17897 relxpchom 17898 xpccofval 17899 catcxpccl 17924 catcxpcclOLD 17925 xpcpropd 17926

W3C validator