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 18381

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 2763	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
5		eqid 2763	. . . 4 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
6		eqid 2763	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2763	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
8		simpl 488	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 490	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐷 ∈ V)
10		eqidd 2764	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (𝑋 × 𝑌))
11		eqidd 2764	. . . 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 2764	. . . 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 18380	. . 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 6922	. . . . 5 ⊢ 𝑋 ∈ V
15	3	fvexi 6922	. . . . 5 ⊢ 𝑌 ∈ V
16	14, 15	xpex 7791	. . . 4 ⊢ (𝑋 × 𝑌) ∈ V
17	16	a1i 11	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) ∈ V)
18	13, 17	estrreslem1 18340	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (Base‘𝑇))
19		base0 17421	. . 3 ⊢ ∅ = (Base‘∅)
20		fvprc 6900	. . . . . 6 ⊢ (¬ 𝐶 ∈ V → (Base‘𝐶) = ∅)
21	2, 20	eqtrid 2810	. . . . 5 ⊢ (¬ 𝐶 ∈ V → 𝑋 = ∅)
22		fvprc 6900	. . . . . 6 ⊢ (¬ 𝐷 ∈ V → (Base‘𝐷) = ∅)
23	3, 22	eqtrid 2810	. . . . 5 ⊢ (¬ 𝐷 ∈ V → 𝑌 = ∅)
24	21, 23	orim12i 922	. . . 4 ⊢ ((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) → (𝑋 = ∅ ∨ 𝑌 = ∅))
25		ianor 997	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V))
26		xpeq0 6163	. . . 4 ⊢ ((𝑋 × 𝑌) = ∅ ↔ (𝑋 = ∅ ∨ 𝑌 = ∅))
27	24, 25, 26	3imtr4i 295	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = ∅)
28		fnxpc 18379	. . . . . . 7 ⊢ ×_c Fn (V × V)
29		fndm 6664	. . . . . . 7 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
30	28, 29	ax-mp 5	. . . . . 6 ⊢ dom ×_c = (V × V)
31	30	ndmov 7629	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
32	1, 31	eqtrid 2810	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
33	32	fveq2d 6912	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (Base‘𝑇) = (Base‘∅))
34	19, 27, 33	3eqtr4a 2824	. 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 2147 Vcvv 3454 ∅c0 4281 ⟨cop 4838 × cxp 5653 dom cdm 5655 Fn wfn 6553 ‘cfv 6558 (class class class)co 7443 ∈ cmpo 7445 1^st c1st 8023 2^nd c2nd 8024 Basecbs 17416 Hom chom 17468 compcco 17469 ×_c cxpc 18371

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-5 12435 df-6 12436 df-7 12437 df-8 12438 df-9 12439 df-n0 12634 df-z 12721 df-dec 12842 df-slot 17389 df-ndx 17401 df-base 17417 df-hom 17481 df-cco 17482 df-xpc 18375

This theorem is used by: xpchomfval 18382 xpccofval 18385 xpchom2 18389 xpcco2 18390 xpccatid 18391 1stfval 18394 2ndfval 18397 1stfcl 18400 2ndfcl 18401 prfcl 18406 prf1st 18407 prf2nd 18408 1st2ndprf 18409 catcxpccl 18410 xpcpropd 18411 evlfcl 18425 curf1cl 18431 curf2cl 18434 curfcl 18435 uncf1 18439 uncf2 18440 uncfcurf 18442 diag11 18446 diag12 18447 diag2 18448 curf2ndf 18450 hofcl 18462 yonedalem21 18476 yonedalem22 18481 yonedalem3b 18482 yonedalem3 18483 yonedainv 18484 yonffthlem 18485 elxpcbasex1ALT 50576 elxpcbasex2ALT 50578 xpcfucbas 50579 dfswapf2 50588 swapf1a 50596 swapf1 50599 swapf2val 50600 swapf1f1o 50602 swapf2f1oa 50604 swapfida 50607 oppc1stf 50615 oppc2ndf 50616 cofuswapf1 50621 cofuswapf2 50622

W3C validator