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 18238

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 487	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝐶 ∈ V)
9		simpr 489	. . . 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 18237	. . 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 6895	. . . . 5 ⊢ 𝑋 ∈ V
15	3	fvexi 6895	. . . . 5 ⊢ 𝑌 ∈ V
16	14, 15	xpex 7748	. . . 4 ⊢ (𝑋 × 𝑌) ∈ V
17	16	a1i 11	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) ∈ V)
18	13, 17	estrreslem1 18197	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = (Base‘𝑇))
19		base0 17278	. . 3 ⊢ ∅ = (Base‘∅)
20		fvprc 6873	. . . . . 6 ⊢ (¬ 𝐶 ∈ V → (Base‘𝐶) = ∅)
21	2, 20	eqtrid 2810	. . . . 5 ⊢ (¬ 𝐶 ∈ V → 𝑋 = ∅)
22		fvprc 6873	. . . . . 6 ⊢ (¬ 𝐷 ∈ V → (Base‘𝐷) = ∅)
23	3, 22	eqtrid 2810	. . . . 5 ⊢ (¬ 𝐷 ∈ V → 𝑌 = ∅)
24	21, 23	orim12i 921	. . . 4 ⊢ ((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) → (𝑋 = ∅ ∨ 𝑌 = ∅))
25		ianor 997	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V))
26		xpeq0 6157	. . . 4 ⊢ ((𝑋 × 𝑌) = ∅ ↔ (𝑋 = ∅ ∨ 𝑌 = ∅))
27	24, 25, 26	3imtr4i 295	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝑋 × 𝑌) = ∅)
28		fnxpc 18236	. . . . . . 7 ⊢ ×_c Fn (V × V)
29		fndm 6638	. . . . . . 7 ⊢ ( ×_c Fn (V × V) → dom ×_c = (V × V))
30	28, 29	ax-mp 5	. . . . . 6 ⊢ dom ×_c = (V × V)
31	30	ndmov 7594	. . . . 5 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (𝐶 ×_c 𝐷) = ∅)
32	1, 31	eqtrid 2810	. . . 4 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → 𝑇 = ∅)
33	32	fveq2d 6885	. . 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 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∅c0 4286 ⟨cop 4595 × cxp 5659 dom cdm 5661 Fn wfn 6531 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 1^st c1st 7980 2^nd c2nd 7981 Basecbs 17273 Hom chom 17325 compcco 17326 ×_c cxpc 18228

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-3 12308 df-4 12309 df-5 12310 df-6 12311 df-7 12312 df-8 12313 df-9 12314 df-n0 12509 df-z 12596 df-dec 12716 df-slot 17246 df-ndx 17258 df-base 17274 df-hom 17338 df-cco 17339 df-xpc 18232

This theorem is used by: xpchomfval 18239 xpccofval 18242 xpchom2 18246 xpcco2 18247 xpccatid 18248 1stfval 18251 2ndfval 18254 1stfcl 18257 2ndfcl 18258 prfcl 18263 prf1st 18264 prf2nd 18265 1st2ndprf 18266 catcxpccl 18267 xpcpropd 18268 evlfcl 18282 curf1cl 18288 curf2cl 18291 curfcl 18292 uncf1 18296 uncf2 18297 uncfcurf 18299 diag11 18303 diag12 18304 diag2 18305 curf2ndf 18307 hofcl 18319 yonedalem21 18333 yonedalem22 18338 yonedalem3b 18339 yonedalem3 18340 yonedainv 18341 yonffthlem 18342 elxpcbasex1ALT 50055 elxpcbasex2ALT 50057 xpcfucbas 50058 dfswapf2 50067 swapf1a 50075 swapf1 50078 swapf2val 50079 swapf1f1o 50081 swapf2f1oa 50083 swapfida 50086 oppc1stf 50094 oppc2ndf 50095 cofuswapf1 50100 cofuswapf2 50101

W3C validator