Theorem oduoppcciso 50057

Description: The dual of a preordered set and the opposite category are category-isomorphic. Example 3.6(1) of [Adamek] p. 25. (Contributed by Zhi Wang, 22-Sep-2025.)

Hypotheses

Ref	Expression
prstcnid.c	⊢ (𝜑 → 𝐶 = (ProsetToCat‘𝐾))
prstcnid.k	⊢ (𝜑 → 𝐾 ∈ Proset )
oduoppcbas.d	⊢ (𝜑 → 𝐷 = (ProsetToCat‘(ODual‘𝐾)))
oduoppcbas.o	⊢ 𝑂 = (oppCat‘𝐶)
oduoppcciso.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
oduoppcciso.d	⊢ (𝜑 → 𝐷 ∈ 𝑈)
oduoppcciso.o	⊢ (𝜑 → 𝑂 ∈ 𝑈)

Assertion

Ref	Expression
oduoppcciso	⊢ (𝜑 → 𝐷( ≃𝑐 ‘(CatCat‘𝑈))𝑂)

Proof of Theorem oduoppcciso

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. 2 ⊢ (CatCat‘𝑈) = (CatCat‘𝑈)
2		eqid 2737	. 2 ⊢ (Base‘𝐷) = (Base‘𝐷)
3		eqid 2737	. 2 ⊢ (Base‘𝑂) = (Base‘𝑂)
4		eqid 2737	. 2 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
5		eqid 2737	. 2 ⊢ (Hom ‘𝑂) = (Hom ‘𝑂)
6		oduoppcciso.u	. 2 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
7		oduoppcciso.d	. 2 ⊢ (𝜑 → 𝐷 ∈ 𝑈)
8		oduoppcciso.o	. 2 ⊢ (𝜑 → 𝑂 ∈ 𝑈)
9		oduoppcbas.d	. . 3 ⊢ (𝜑 → 𝐷 = (ProsetToCat‘(ODual‘𝐾)))
10		prstcnid.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ Proset )
11		eqid 2737	. . . . 5 ⊢ (ODual‘𝐾) = (ODual‘𝐾)
12	11	oduprs 18261	. . . 4 ⊢ (𝐾 ∈ Proset → (ODual‘𝐾) ∈ Proset )
13	10, 12	syl 17	. . 3 ⊢ (𝜑 → (ODual‘𝐾) ∈ Proset )
14	9, 13	prstcthin 50052	. 2 ⊢ (𝜑 → 𝐷 ∈ ThinCat)
15		prstcnid.c	. . . 4 ⊢ (𝜑 → 𝐶 = (ProsetToCat‘𝐾))
16	15, 10	prstcthin 50052	. . 3 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
17		oduoppcbas.o	. . . 4 ⊢ 𝑂 = (oppCat‘𝐶)
18	17	oppcthin 49929	. . 3 ⊢ (𝐶 ∈ ThinCat → 𝑂 ∈ ThinCat)
19	16, 18	syl 17	. 2 ⊢ (𝜑 → 𝑂 ∈ ThinCat)
20		f1oi 6814	. . 3 ⊢ ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝐷)
21	15, 10, 9, 17	oduoppcbas 50056	. . . 4 ⊢ (𝜑 → (Base‘𝐷) = (Base‘𝑂))
22	21	f1oeq3d 6773	. . 3 ⊢ (𝜑 → (( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝐷) ↔ ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝑂)))
23	20, 22	mpbii 233	. 2 ⊢ (𝜑 → ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝑂))
24		eqid 2737	. . . . . . 7 ⊢ (le‘𝐾) = (le‘𝐾)
25		eqid 2737	. . . . . . 7 ⊢ (le‘(ODual‘𝐾)) = (le‘(ODual‘𝐾))
26	11, 24, 25	oduleg 18251	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷)) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ 𝑦(le‘𝐾)𝑥))
27	26	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ 𝑦(le‘𝐾)𝑥))
28	9	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐷 = (ProsetToCat‘(ODual‘𝐾)))
29	10	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐾 ∈ Proset )
30	29, 12	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (ODual‘𝐾) ∈ Proset )
31		eqidd 2738	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘(ODual‘𝐾)) = (le‘(ODual‘𝐾)))
32	28, 30, 31	prstcleval 50046	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘(ODual‘𝐾)) = (le‘𝐷))
33		eqidd 2738	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Hom ‘𝐷) = (Hom ‘𝐷))
34		simprl 771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑥 ∈ (Base‘𝐷))
35		simprr 773	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑦 ∈ (Base‘𝐷))
36	28, 30, 32, 33, 34, 35	prstchom 50053	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ (𝑥(Hom ‘𝐷)𝑦) ≠ ∅))
37	15	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐶 = (ProsetToCat‘𝐾))
38		eqidd 2738	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘𝐾) = (le‘𝐾))
39	37, 29, 38	prstcleval 50046	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘𝐾) = (le‘𝐶))
40		eqidd 2738	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Hom ‘𝐶) = (Hom ‘𝐶))
41		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝐶) = (Base‘𝐶)
42	17, 41	oppcbas 17679	. . . . . . . . 9 ⊢ (Base‘𝐶) = (Base‘𝑂)
43	21, 42	eqtr4di 2790	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐷) = (Base‘𝐶))
44	43	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Base‘𝐷) = (Base‘𝐶))
45	35, 44	eleqtrd 2839	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑦 ∈ (Base‘𝐶))
46	34, 44	eleqtrd 2839	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑥 ∈ (Base‘𝐶))
47	37, 29, 39, 40, 45, 46	prstchom 50053	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑦(le‘𝐾)𝑥 ↔ (𝑦(Hom ‘𝐶)𝑥) ≠ ∅))
48	27, 36, 47	3bitr3d 309	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) ≠ ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) ≠ ∅))
49	48	necon4bid 2978	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) = ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) = ∅))
50		fvresi 7123	. . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝐷) → (( I ↾ (Base‘𝐷))‘𝑥) = 𝑥)
51	50	ad2antrl 729	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (( I ↾ (Base‘𝐷))‘𝑥) = 𝑥)
52		fvresi 7123	. . . . . . 7 ⊢ (𝑦 ∈ (Base‘𝐷) → (( I ↾ (Base‘𝐷))‘𝑦) = 𝑦)
53	52	ad2antll 730	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (( I ↾ (Base‘𝐷))‘𝑦) = 𝑦)
54	51, 53	oveq12d 7380	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = (𝑥(Hom ‘𝑂)𝑦))
55		eqid 2737	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
56	55, 17	oppchom 17676	. . . . 5 ⊢ (𝑥(Hom ‘𝑂)𝑦) = (𝑦(Hom ‘𝐶)𝑥)
57	54, 56	eqtrdi 2788	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = (𝑦(Hom ‘𝐶)𝑥))
58	57	eqeq1d 2739	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) = ∅))
59	49, 58	bitr4d 282	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) = ∅ ↔ ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = ∅))
60	1, 2, 3, 4, 5, 6, 7, 8, 14, 19, 23, 59	thinccisod 49945	1 ⊢ (𝜑 → 𝐷( ≃𝑐 ‘(CatCat‘𝑈))𝑂)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∅c0 4274   class class class wbr 5086   I cid 5520   ↾ cres 5628  –1-1-onto→wf1o 6493  ‘cfv 6494  (class class class)co 7362  Basecbs 17174  lecple 17222  Hom chom 17226  oppCatcoppc 17672   ≃_𝑐 ccic 17757  CatCatccatc 18060  ODualcodu 18247   Proset cproset 18253  ThinCatcthinc 49908  ProsetToCatcprstc 50040

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-cnex 11089  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-riota 7319  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7813  df-1st 7937  df-2nd 7938  df-supp 8106  df-tpos 8171  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-1o 8400  df-er 8638  df-map 8770  df-ixp 8841  df-en 8889  df-dom 8890  df-sdom 8891  df-fin 8892  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-nn 12170  df-2 12239  df-3 12240  df-4 12241  df-5 12242  df-6 12243  df-7 12244  df-8 12245  df-9 12246  df-n0 12433  df-z 12520  df-dec 12640  df-uz 12784  df-fz 13457  df-struct 17112  df-sets 17129  df-slot 17147  df-ndx 17159  df-base 17175  df-ple 17235  df-hom 17239  df-cco 17240  df-cat 17629  df-cid 17630  df-oppc 17673  df-sect 17709  df-inv 17710  df-iso 17711  df-cic 17758  df-func 17820  df-idfu 17821  df-cofu 17822  df-full 17868  df-fth 17869  df-catc 18061  df-odu 18248  df-proset 18255  df-thinc 49909  df-prstc 50041

This theorem is referenced by: (None)