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 17422

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 486	. . . . . 6 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → 𝑢 = 𝑋)
4	3	fveq2d 6649	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (1^st ‘𝑢) = (1^st ‘𝑋))
5		simpr 488	. . . . . 6 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → 𝑣 = 𝑌)
6	5	fveq2d 6649	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (1^st ‘𝑣) = (1^st ‘𝑌))
7	4, 6	oveq12d 7153	. . . 4 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → ((1^st ‘𝑢)𝐻(1^st ‘𝑣)) = ((1^st ‘𝑋)𝐻(1^st ‘𝑌)))
8	3	fveq2d 6649	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (2^nd ‘𝑢) = (2^nd ‘𝑋))
9	5	fveq2d 6649	. . . . 5 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → (2^nd ‘𝑣) = (2^nd ‘𝑌))
10	8, 9	oveq12d 7153	. . . 4 ⊢ ((𝑢 = 𝑋 ∧ 𝑣 = 𝑌) → ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣)) = ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌)))
11	7, 10	xpeq12d 5550	. . 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 17421	. . 3 ⊢ 𝐾 = (𝑢 ∈ 𝐵, 𝑣 ∈ 𝐵 ↦ (((1^st ‘𝑢)𝐻(1^st ‘𝑣)) × ((2^nd ‘𝑢)𝐽(2^nd ‘𝑣))))
18		ovex 7168	. . . 4 ⊢ ((1^st ‘𝑋)𝐻(1^st ‘𝑌)) ∈ V
19		ovex 7168	. . . 4 ⊢ ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌)) ∈ V
20	18, 19	xpex 7456	. . 3 ⊢ (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))) ∈ V
21	11, 17, 20	ovmpoa 7284	. 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋𝐾𝑌) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))
22	1, 2, 21	syl2anc 587	1 ⊢ (𝜑 → (𝑋𝐾𝑌) = (((1^st ‘𝑋)𝐻(1^st ‘𝑌)) × ((2^nd ‘𝑋)𝐽(2^nd ‘𝑌))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 × cxp 5517 ‘cfv 6324 (class class class)co 7135 1^st c1st 7669 2^nd c2nd 7670 Basecbs 16475 Hom chom 16568 ×_c cxpc 17410

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-hom 16581 df-cco 16582 df-xpc 17414

This theorem is referenced by: xpchom2 17428 xpccatid 17430 1stfcl 17439 2ndfcl 17440 xpcpropd 17450 evlfcl 17464 curf1cl 17470 hofcl 17501 yonedalem3 17522

W3C validator