Theorem oppcbasOLD 17429

Description: Obsolete version of oppcbas 17428 as of 18-Oct-2024. Base set of an opposite category. (Contributed by Mario Carneiro, 2-Jan-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
oppcbas.1	⊢ 𝑂 = (oppCat‘𝐶)
oppcbas.2	⊢ 𝐵 = (Base‘𝐶)

Assertion

Ref	Expression
oppcbasOLD	⊢ 𝐵 = (Base‘𝑂)

Proof of Theorem oppcbasOLD

Dummy variables 𝑢 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oppcbas.2	. 2 ⊢ 𝐵 = (Base‘𝐶)
2		baseid 16915	. . . . . 6 ⊢ Base = Slot (Base‘ndx)
3		1re 10975	. . . . . . . 8 ⊢ 1 ∈ ℝ
4		1nn 11984	. . . . . . . . 9 ⊢ 1 ∈ ℕ
5		4nn0 12252	. . . . . . . . 9 ⊢ 4 ∈ ℕ0
6		1nn0 12249	. . . . . . . . 9 ⊢ 1 ∈ ℕ0
7		1lt10 12576	. . . . . . . . 9 ⊢ 1 < ;10
8	4, 5, 6, 7	declti 12475	. . . . . . . 8 ⊢ 1 < ;14
9	3, 8	ltneii 11088	. . . . . . 7 ⊢ 1 ≠ ;14
10		basendx 16921	. . . . . . . 8 ⊢ (Base‘ndx) = 1
11		homndx 17121	. . . . . . . 8 ⊢ (Hom ‘ndx) = ;14
12	10, 11	neeq12i 3010	. . . . . . 7 ⊢ ((Base‘ndx) ≠ (Hom ‘ndx) ↔ 1 ≠ ;14)
13	9, 12	mpbir 230	. . . . . 6 ⊢ (Base‘ndx) ≠ (Hom ‘ndx)
14	2, 13	setsnid 16910	. . . . 5 ⊢ (Base‘𝐶) = (Base‘(𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩))
15		5nn 12059	. . . . . . . . . 10 ⊢ 5 ∈ ℕ
16		4lt5 12150	. . . . . . . . . 10 ⊢ 4 < 5
17	6, 5, 15, 16	declt 12465	. . . . . . . . 9 ⊢ ;14 < ;15
18		4nn 12056	. . . . . . . . . . . 12 ⊢ 4 ∈ ℕ
19	6, 18	decnncl 12457	. . . . . . . . . . 11 ⊢ ;14 ∈ ℕ
20	19	nnrei 11982	. . . . . . . . . 10 ⊢ ;14 ∈ ℝ
21	6, 15	decnncl 12457	. . . . . . . . . . 11 ⊢ ;15 ∈ ℕ
22	21	nnrei 11982	. . . . . . . . . 10 ⊢ ;15 ∈ ℝ
23	3, 20, 22	lttri 11101	. . . . . . . . 9 ⊢ ((1 < ;14 ∧ ;14 < ;15) → 1 < ;15)
24	8, 17, 23	mp2an 689	. . . . . . . 8 ⊢ 1 < ;15
25	3, 24	ltneii 11088	. . . . . . 7 ⊢ 1 ≠ ;15
26		ccondx 17123	. . . . . . . 8 ⊢ (comp‘ndx) = ;15
27	10, 26	neeq12i 3010	. . . . . . 7 ⊢ ((Base‘ndx) ≠ (comp‘ndx) ↔ 1 ≠ ;15)
28	25, 27	mpbir 230	. . . . . 6 ⊢ (Base‘ndx) ≠ (comp‘ndx)
29	2, 28	setsnid 16910	. . . . 5 ⊢ (Base‘(𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩)) = (Base‘((𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝐶) × (Base‘𝐶)), 𝑧 ∈ (Base‘𝐶) ↦ tpos (⟨𝑧, (2nd ‘𝑢)⟩(comp‘𝐶)(1st ‘𝑢)))⟩))
30	14, 29	eqtri 2766	. . . 4 ⊢ (Base‘𝐶) = (Base‘((𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝐶) × (Base‘𝐶)), 𝑧 ∈ (Base‘𝐶) ↦ tpos (⟨𝑧, (2nd ‘𝑢)⟩(comp‘𝐶)(1st ‘𝑢)))⟩))
31		eqid 2738	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
32		eqid 2738	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
33		eqid 2738	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
34		oppcbas.1	. . . . . 6 ⊢ 𝑂 = (oppCat‘𝐶)
35	31, 32, 33, 34	oppcval 17422	. . . . 5 ⊢ (𝐶 ∈ V → 𝑂 = ((𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝐶) × (Base‘𝐶)), 𝑧 ∈ (Base‘𝐶) ↦ tpos (⟨𝑧, (2nd ‘𝑢)⟩(comp‘𝐶)(1st ‘𝑢)))⟩))
36	35	fveq2d 6778	. . . 4 ⊢ (𝐶 ∈ V → (Base‘𝑂) = (Base‘((𝐶 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝐶)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝐶) × (Base‘𝐶)), 𝑧 ∈ (Base‘𝐶) ↦ tpos (⟨𝑧, (2nd ‘𝑢)⟩(comp‘𝐶)(1st ‘𝑢)))⟩)))
37	30, 36	eqtr4id 2797	. . 3 ⊢ (𝐶 ∈ V → (Base‘𝐶) = (Base‘𝑂))
38		base0 16917	. . . 4 ⊢ ∅ = (Base‘∅)
39		fvprc 6766	. . . 4 ⊢ (¬ 𝐶 ∈ V → (Base‘𝐶) = ∅)
40		fvprc 6766	. . . . . 6 ⊢ (¬ 𝐶 ∈ V → (oppCat‘𝐶) = ∅)
41	34, 40	eqtrid 2790	. . . . 5 ⊢ (¬ 𝐶 ∈ V → 𝑂 = ∅)
42	41	fveq2d 6778	. . . 4 ⊢ (¬ 𝐶 ∈ V → (Base‘𝑂) = (Base‘∅))
43	38, 39, 42	3eqtr4a 2804	. . 3 ⊢ (¬ 𝐶 ∈ V → (Base‘𝐶) = (Base‘𝑂))
44	37, 43	pm2.61i 182	. 2 ⊢ (Base‘𝐶) = (Base‘𝑂)
45	1, 44	eqtri 2766	1 ⊢ 𝐵 = (Base‘𝑂)

Syntax hints:  ¬ wn 3   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  Vcvv 3432  ∅c0 4256  ⟨cop 4567   class class class wbr 5074   × cxp 5587  ‘cfv 6433  (class class class)co 7275   ∈ cmpo 7277  1^st c1st 7829  2^nd c2nd 7830  tpos ctpos 8041  1c1 10872   < clt 11009  4c4 12030  5c5 12031  ;cdc 12437   sSet csts 16864  ndxcnx 16894  Basecbs 16912  Hom chom 16973  compcco 16974  oppCatcoppc 17420

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-2nd 7832  df-tpos 8042  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-3 12037  df-4 12038  df-5 12039  df-6 12040  df-7 12041  df-8 12042  df-9 12043  df-n0 12234  df-z 12320  df-dec 12438  df-sets 16865  df-slot 16883  df-ndx 16895  df-base 16913  df-hom 16986  df-cco 16987  df-oppc 17421

This theorem is referenced by: (None)