xpchom - Metamath Proof Explorer

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

Theorem xpchom 17424

Description: Set of morphisms of the binary product of categories. (Contributed by Mario Carneiro, 11-Jan-2017.)

**Hypotheses**
Ref	Expression
xpchomfval.t	⊢ 𝑇 = (𝐶 ×_c 𝐷)
xpchomfval.y	⊢ 𝐵 = (Base‘𝑇)
xpchomfval.h	⊢ 𝐻 = (Hom ‘𝐶)
xpchomfval.j	⊢ 𝐽 = (Hom ‘𝐷)
xpchomfval.k	⊢ 𝐾 = (Hom ‘𝑇)
xpchom.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
xpchom.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)

**Assertion**
Ref	Expression
xpchom	⊢ (𝜑 → (𝑋𝐾𝑌) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))

Proof of Theorem xpchom Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpchom.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
2		xpchom.y	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
3		simpl 485	. . . . . 6 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → 𝑢 = 𝑋)
4	3	fveq2d 6668	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (1^st ‘𝑢) = (1^st ‘𝑋))
5		simpr 487	. . . . . 6 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → 𝑣 = 𝑌)
6	5	fveq2d 6668	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (1^st ‘𝑣) = (1^st ‘𝑌))
7	4, 6	oveq12d 7168	. . . 4 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → ((1^st ‘𝑢)𝐻(1^st ‘𝑣)) = ((1^st ‘𝑋)𝐻(1^st ‘𝑌)))
8	3	fveq2d 6668	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (2^nd ‘𝑢) = (2^nd ‘𝑋))
9	5	fveq2d 6668	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (2^nd ‘𝑣) = (2^nd ‘𝑌))
10	8, 9	oveq12d 7168	. . . 4 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)) = ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌)))
11	7, 10	xpeq12d 5580	. . 3 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))
12		xpchomfval.t	. . . 4 ⊢ 𝑇 = (𝐶 ×_c 𝐷)
13		xpchomfval.y	. . . 4 ⊢ 𝐵 = (Base‘𝑇)
14		xpchomfval.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
15		xpchomfval.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐷)
16		xpchomfval.k	. . . 4 ⊢ 𝐾 = (Hom ‘𝑇)
17	12, 13, 14, 15, 16	xpchomfval 17423	. . 3 ⊢ 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))
18		ovex 7183	. . . 4 ⊢ ((1^st ‘𝑋)𝐻(1^st ‘𝑌)) ∈ V
19		ovex 7183	. . . 4 ⊢ ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌)) ∈ V
20	18, 19	xpex 7470	. . 3 ⊢ (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))) ∈ V
21	11, 17, 20	ovmpoa 7299	. 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋𝐾𝑌) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))
22	1, 2, 21	syl2anc 586	1 ⊢ (𝜑 → (𝑋𝐾𝑌) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 × cxp 5547 ‘cfv 6349 (class class class)co 7150 1^st c1st 7681 2^nd c2nd 7682 Basecbs 16477 Hom chom 16570 ×_c cxpc 17412

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-n0 11892 df-z 11976 df-dec 12093 df-uz 12238 df-fz 12887 df-struct 16479 df-ndx 16480 df-slot 16481 df-base 16483 df-hom 16583 df-cco 16584 df-xpc 17416

This theorem is referenced by: xpchom2 17430 xpccatid 17432 1stfcl 17441 2ndfcl 17442 xpcpropd 17452 evlfcl 17466 curf1cl 17472 hofcl 17503 yonedalem3 17524

W3C validator