xpcbas - Metamath Proof Explorer

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

Theorem xpcbas 18272

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

**Hypotheses**
Ref	Expression
xpcbas.t	⊢ 𝑇 = (𝐶 ×_c 𝐷)
xpcbas.x	⊢ 𝑋 = (Base‘𝐶)
xpcbas.y	⊢ 𝑌 = (Base‘𝐷)

**Assertion**
Ref	Expression
xpcbas	⊢ (𝑋 × 𝑌) = (Base‘𝑇)

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

Step	Hyp	Ref	Expression
1		xpcbas.t	. . . 4 ⊢ 𝑇 = (𝐶 ×_c 𝐷)
2		xpcbas.x	. . . 4 ⊢ 𝑋 = (Base‘𝐶)
3		xpcbas.y	. . . 4 ⊢ 𝑌 = (Base‘𝐷)
4		eqid 2762	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
5		eqid 2762	. . . 4 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
6		eqid 2762	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2762	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
8		simpl 488	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 490	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10		eqidd 2763	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (𝑋 × 𝑌))
11		eqidd 2763	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣)))) = (𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣)))))
12		eqidd 2763	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑥 ∈ ((𝑋 × 𝑌) × (𝑋 × 𝑌)), 𝑦 ∈ (𝑋 × 𝑌) ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(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 ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(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 ‘𝑓))⟩)))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	xpcval 18271	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = {⟨(Base‘ndx), (𝑋 × 𝑌)⟩, ⟨(Hom ‘ndx), (𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣))))⟩, ⟨(comp‘ndx), (𝑥 ∈ ((𝑋 × 𝑌) × (𝑋 × 𝑌)), 𝑦 ∈ (𝑋 × 𝑌) ↦ (𝑔 ∈ ((2^nd ‘𝑥)(𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(2^nd ‘𝑣))))𝑦), 𝑓 ∈ ((𝑢 ∈ (𝑋 × 𝑌), 𝑣 ∈ (𝑋 × 𝑌) ↦ (((1^st ‘𝑢)(Hom ‘𝐶)(1^st ‘𝑣)) × ((2^nd ‘𝑢)(Hom ‘𝐷)(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 ‘𝑓))⟩))⟩})
14	2	fvexi 6896	. . . . 5 ⊢ 𝑋 ∈ V
15	3	fvexi 6896	. . . . 5 ⊢ 𝑌 ∈ V
16	14, 15	xpex 7756	. . . 4 ⊢ (𝑋 × 𝑌) ∈ V
17	16	a1i 11	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) ∈ V)
18	13, 17	estrreslem1 18231	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (Base‘𝑇))
19		base0 17312	. . 3 ⊢ ∅ = (Base‘∅)
20		fvprc 6874	. . . . . 6 ⊢ (¬ 𝐶 ∈ V → (Base‘𝐶) = ∅)
21	2, 20	eqtrid 2809	. . . . 5 ⊢ (¬ 𝐶 ∈ V → 𝑋 = ∅)
22		fvprc 6874	. . . . . 6 ⊢ (¬ 𝐷 ∈ V → (Base‘𝐷) = ∅)
23	3, 22	eqtrid 2809	. . . . 5 ⊢ (¬ 𝐷 ∈ V → 𝑌 = ∅)
24	21, 23	orim12i 922	. . . 4 ⊢ ((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) → (𝑋 = ∅ ∨ 𝑌 = ∅))
25		ianor 997	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V))
26		xpeq0 6156	. . . 4 ⊢ ((𝑋 × 𝑌) = ∅ ↔ (𝑋 = ∅ ∨ 𝑌 = ∅))
27	24, 25, 26	3imtr4i 295	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = ∅)
28		fnxpc 18270	. . . . . . 7 ⊢ ×_c Fn (V × V)
29		fndm 6639	. . . . . . 7 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
30	28, 29	ax-mp 5	. . . . . 6 ⊢ dom ×_c = (V × V)
31	30	ndmov 7602	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
32	1, 31	eqtrid 2809	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
33	32	fveq2d 6886	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
34	19, 27, 33	3eqtr4a 2823	. 2 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (Base‘𝑇))
35	18, 34	pm2.61i 184	1 ⊢ (𝑋 × 𝑌) = (Base‘𝑇)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 ⟨cop 4593 × cxp 5657 dom cdm 5659 Fn wfn 6532 ‘cfv 6537 (class class class)co 7417 ∈ cmpo 7419 1^st c1st 7988 2^nd c2nd 7989 Basecbs 17307 Hom chom 17359 compcco 17360 ×_c cxpc 18262

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-z 12620 df-dec 12741 df-slot 17280 df-ndx 17292 df-base 17308 df-hom 17372 df-cco 17373 df-xpc 18266

This theorem is used by: xpchomfval 18273 xpccofval 18276 xpchom2 18280 xpcco2 18281 xpccatid 18282 1stfval 18285 2ndfval 18288 1stfcl 18291 2ndfcl 18292 prfcl 18297 prf1st 18298 prf2nd 18299 1st2ndprf 18300 catcxpccl 18301 xpcpropd 18302 evlfcl 18316 curf1cl 18322 curf2cl 18325 curfcl 18326 uncf1 18330 uncf2 18331 uncfcurf 18333 diag11 18337 diag12 18338 diag2 18339 curf2ndf 18341 hofcl 18353 yonedalem21 18367 yonedalem22 18372 yonedalem3b 18373 yonedalem3 18374 yonedainv 18375 yonffthlem 18376 elxpcbasex1ALT 50183 elxpcbasex2ALT 50185 xpcfucbas 50186 dfswapf2 50195 swapf1a 50203 swapf1 50206 swapf2val 50207 swapf1f1o 50209 swapf2f1oa 50211 swapfida 50214 oppc1stf 50222 oppc2ndf 50223 cofuswapf1 50228 cofuswapf2 50229

W3C validator