Theorem oduoppcciso 50674

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 2760	. 2 ⊢ (CatCat‘𝑈) = (CatCat‘𝑈)
2		eqid 2760	. 2 ⊢ (Base‘𝐷) = (Base‘𝐷)
3		eqid 2760	. 2 ⊢ (Base‘𝑂) = (Base‘𝑂)
4		eqid 2760	. 2 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
5		eqid 2760	. 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 2760	. . . . 5 ⊢ (ODual‘𝐾) = (ODual‘𝐾)
12	11	oduprs 18474	. . . 4 ⊢ (𝐾 ∈ Proset → (ODual‘𝐾) ∈ Proset )
13	10, 12	syl 18	. . 3 ⊢ (𝜑 → (ODual‘𝐾) ∈ Proset )
14	9, 13	prstcthin 50669	. 2 ⊢ (𝜑 → 𝐷 ∈ ThinCat)
15		prstcnid.c	. . . 4 ⊢ (𝜑 → 𝐶 = (ProsetToCat‘𝐾))
16	15, 10	prstcthin 50669	. . 3 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
17		oduoppcbas.o	. . . 4 ⊢ 𝑂 = (oppCat‘𝐶)
18	17	oppcthin 50546	. . 3 ⊢ (𝐶 ∈ ThinCat → 𝑂 ∈ ThinCat)
19	16, 18	syl 18	. 2 ⊢ (𝜑 → 𝑂 ∈ ThinCat)
20		f1oi 6863	. . 3 ⊢ ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝐷)
21	15, 10, 9, 17	oduoppcbas 50673	. . . 4 ⊢ (𝜑 → (Base‘𝐷) = (Base‘𝑂))
22	21	f1oeq3d 6821	. . 3 ⊢ (𝜑 → (( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝐷) ↔ ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝑂)))
23	20, 22	mpbii 236	. 2 ⊢ (𝜑 → ( I ↾ (Base‘𝐷)):(Base‘𝐷)–1-1-onto→(Base‘𝑂))
24		eqid 2760	. . . . . . 7 ⊢ (le‘𝐾) = (le‘𝐾)
25		eqid 2760	. . . . . . 7 ⊢ (le‘(ODual‘𝐾)) = (le‘(ODual‘𝐾))
26	11, 24, 25	oduleg 18464	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷)) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ 𝑦(le‘𝐾)𝑥))
27	26	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ 𝑦(le‘𝐾)𝑥))
28	9	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐷 = (ProsetToCat‘(ODual‘𝐾)))
29	10	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐾 ∈ Proset )
30	29, 12	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (ODual‘𝐾) ∈ Proset )
31		eqidd 2761	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘(ODual‘𝐾)) = (le‘(ODual‘𝐾)))
32	28, 30, 31	prstcleval 50663	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘(ODual‘𝐾)) = (le‘𝐷))
33		eqidd 2761	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Hom ‘𝐷) = (Hom ‘𝐷))
34		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑥 ∈ (Base‘𝐷))
35		simprr 785	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑦 ∈ (Base‘𝐷))
36	28, 30, 32, 33, 34, 35	prstchom 50670	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑥(le‘(ODual‘𝐾))𝑦 ↔ (𝑥(Hom ‘𝐷)𝑦) ≠ ∅))
37	15	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝐶 = (ProsetToCat‘𝐾))
38		eqidd 2761	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘𝐾) = (le‘𝐾))
39	37, 29, 38	prstcleval 50663	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (le‘𝐾) = (le‘𝐶))
40		eqidd 2761	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Hom ‘𝐶) = (Hom ‘𝐶))
41		eqid 2760	. . . . . . . . . 10 ⊢ (Base‘𝐶) = (Base‘𝐶)
42	17, 41	oppcbas 17892	. . . . . . . . 9 ⊢ (Base‘𝐶) = (Base‘𝑂)
43	21, 42	eqtr4di 2813	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐷) = (Base‘𝐶))
44	43	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (Base‘𝐷) = (Base‘𝐶))
45	35, 44	eleqtrd 2862	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑦 ∈ (Base‘𝐶))
46	34, 44	eleqtrd 2862	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → 𝑥 ∈ (Base‘𝐶))
47	37, 29, 39, 40, 45, 46	prstchom 50670	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (𝑦(le‘𝐾)𝑥 ↔ (𝑦(Hom ‘𝐶)𝑥) ≠ ∅))
48	27, 36, 47	3bitr3d 312	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) ≠ ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) ≠ ∅))
49	48	necon4bid 3000	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) = ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) = ∅))
50		fvresi 7178	. . . . . . 7 ⊢ (𝑥 ∈ (Base‘𝐷) → (( I ↾ (Base‘𝐷))‘𝑥) = 𝑥)
51	50	ad2antrl 741	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (( I ↾ (Base‘𝐷))‘𝑥) = 𝑥)
52		fvresi 7178	. . . . . . 7 ⊢ (𝑦 ∈ (Base‘𝐷) → (( I ↾ (Base‘𝐷))‘𝑦) = 𝑦)
53	52	ad2antll 742	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (( I ↾ (Base‘𝐷))‘𝑦) = 𝑦)
54	51, 53	oveq12d 7438	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = (𝑥(Hom ‘𝑂)𝑦))
55		eqid 2760	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
56	55, 17	oppchom 17889	. . . . 5 ⊢ (𝑥(Hom ‘𝑂)𝑦) = (𝑦(Hom ‘𝐶)𝑥)
57	54, 56	eqtrdi 2811	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = (𝑦(Hom ‘𝐶)𝑥))
58	57	eqeq1d 2762	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → (((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = ∅ ↔ (𝑦(Hom ‘𝐶)𝑥) = ∅))
59	49, 58	bitr4d 285	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐷) ∧ 𝑦 ∈ (Base‘𝐷))) → ((𝑥(Hom ‘𝐷)𝑦) = ∅ ↔ ((( I ↾ (Base‘𝐷))‘𝑥)(Hom ‘𝑂)(( I ↾ (Base‘𝐷))‘𝑦)) = ∅))
60	1, 2, 3, 4, 5, 6, 7, 8, 14, 19, 23, 59	thinccisod 50562	1 ⊢ (𝜑 → 𝐷( ≃𝑐 ‘(CatCat‘𝑈))𝑂)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278   class class class wbr 5102   I cid 5544   ↾ cres 5652  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  Hom chom 17439  oppCatcoppc 17885   ≃_𝑐 ccic 17970  CatCatccatc 18273  ODualcodu 18460   Proset cproset 18466  ThinCatcthinc 50525  ProsetToCatcprstc 50657

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-supp 8178  df-tpos 8243  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-map 8849  df-ixp 8926  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-3 12406  df-4 12407  df-5 12408  df-6 12409  df-7 12410  df-8 12411  df-9 12412  df-n0 12607  df-z 12694  df-dec 12815  df-uz 12966  df-fz 13640  df-struct 17325  df-sets 17342  df-slot 17360  df-ndx 17372  df-base 17388  df-ple 17448  df-hom 17452  df-cco 17453  df-cat 17842  df-cid 17843  df-oppc 17886  df-sect 17922  df-inv 17923  df-iso 17924  df-cic 17971  df-func 18033  df-idfu 18034  df-cofu 18035  df-full 18081  df-fth 18082  df-catc 18274  df-odu 18461  df-proset 18468  df-thinc 50526  df-prstc 50658

This theorem is used by: (None)