Theorem prsthinc 50301

Description: Preordered sets as categories. Similar to example 3.3(4.d) of [Adamek] p. 24, but the hom-sets are not pairwise disjoint. One can define a functor from the category of prosets to the category of small thin categories. See catprs 49848 and catprs2 49849 for inducing a preorder from a category. Example 3.26(2) of [Adamek] p. 33 indicates that it induces a bijection from the equivalence class of isomorphic small thin categories to the equivalence class of order-isomorphic preordered sets. (Contributed by Zhi Wang, 18-Sep-2024.)

Hypotheses

Ref	Expression
indthinc.b	⊢ (𝜑 → 𝐵 = (Base‘𝐶))
prsthinc.h	⊢ (𝜑 → ( ≤ × {1o}) = (Hom ‘𝐶))
prsthinc.o	⊢ (𝜑 → ∅ = (comp‘𝐶))
prsthinc.l	⊢ (𝜑 → ≤ = (le‘𝐶))
prsthinc.p	⊢ (𝜑 → 𝐶 ∈ Proset )

Assertion

Ref	Expression
prsthinc	⊢ (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦 ∈ 𝐵 ↦ ∅)))

Distinct variable groups:   𝑦, ≤   𝑦,𝐵   𝑦,𝐶   𝜑,𝑦

Proof of Theorem prsthinc

Dummy variables 𝑓 𝑔 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		indthinc.b	. 2 ⊢ (𝜑 → 𝐵 = (Base‘𝐶))
2		prsthinc.h	. 2 ⊢ (𝜑 → ( ≤ × {1o}) = (Hom ‘𝐶))
3		eqidd 2766	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ( ≤ × {1o}) = ( ≤ × {1o}))
4	3	f1omo 49730	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑓 𝑓 ∈ (( ≤ × {1o})‘⟨𝑥, 𝑦⟩))
5		df-ov 7422	. . . . 5 ⊢ (𝑥( ≤ × {1o})𝑦) = (( ≤ × {1o})‘⟨𝑥, 𝑦⟩)
6	5	eleq2i 2857	. . . 4 ⊢ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ↔ 𝑓 ∈ (( ≤ × {1o})‘⟨𝑥, 𝑦⟩))
7	6	mobii 2578	. . 3 ⊢ (∃*𝑓 𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ↔ ∃*𝑓 𝑓 ∈ (( ≤ × {1o})‘⟨𝑥, 𝑦⟩))
8	4, 7	sylibr 237	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥( ≤ × {1o})𝑦))
9		prsthinc.o	. 2 ⊢ (𝜑 → ∅ = (comp‘𝐶))
10		prsthinc.p	. 2 ⊢ (𝜑 → 𝐶 ∈ Proset )
11		biid 264	. 2 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧))) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧))))
12		0lt1o 8495	. . 3 ⊢ ∅ ∈ 1o
13	1	eleq2d 2851	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ (Base‘𝐶)))
14		eqid 2765	. . . . . . . 8 ⊢ (Base‘𝐶) = (Base‘𝐶)
15		eqid 2765	. . . . . . . 8 ⊢ (le‘𝐶) = (le‘𝐶)
16	14, 15	prsref 18378	. . . . . . 7 ⊢ ((𝐶 ∈ Proset ∧ 𝑦 ∈ (Base‘𝐶)) → 𝑦(le‘𝐶)𝑦)
17	10, 16	sylan 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (Base‘𝐶)) → 𝑦(le‘𝐶)𝑦)
18	13, 17	sylbida 604	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦(le‘𝐶)𝑦)
19		prsthinc.l	. . . . . . 7 ⊢ (𝜑 → ≤ = (le‘𝐶))
20	19	breqd 5122	. . . . . 6 ⊢ (𝜑 → (𝑦 ≤ 𝑦 ↔ 𝑦(le‘𝐶)𝑦))
21	20	biimpar 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑦(le‘𝐶)𝑦) → 𝑦 ≤ 𝑦)
22	18, 21	syldan 603	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝑦 ≤ 𝑦)
23		eqidd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ( ≤ × {1o}) = ( ≤ × {1o}))
24		1oex 8469	. . . . . 6 ⊢ 1o ∈ V
25	24	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 1o ∈ V)
26		1n0 8478	. . . . . 6 ⊢ 1o ≠ ∅
27	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 1o ≠ ∅)
28	23, 25, 27	fvconstr 49699	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 ≤ 𝑦 ↔ (𝑦( ≤ × {1o})𝑦) = 1o))
29	22, 28	mpbid 235	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦( ≤ × {1o})𝑦) = 1o)
30	12, 29	eleqtrrid 2872	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∅ ∈ (𝑦( ≤ × {1o})𝑦))
31		0ov 7456	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩∅𝑧) = ∅
32	31	oveqi 7432	. . . . 5 ⊢ (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = (𝑔∅𝑓)
33		0ov 7456	. . . . 5 ⊢ (𝑔∅𝑓) = ∅
34	32, 33	eqtri 2788	. . . 4 ⊢ (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅
35	34, 12	eqeltri 2861	. . 3 ⊢ (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ 1o
36		simpl 488	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝜑)
37	10	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝐶 ∈ Proset )
38	1	eleq2d 2851	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐶)))
39	1	eleq2d 2851	. . . . . . . . 9 ⊢ (𝜑 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ (Base‘𝐶)))
40	38, 13, 39	3anbi123d 1464	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ↔ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))))
41	40	biimpa 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶)))
42	41	adantrr 730	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶)))
43		eqidd 2766	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → ( ≤ × {1o}) = ( ≤ × {1o}))
44		simprrl 793	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑓 ∈ (𝑥( ≤ × {1o})𝑦))
45	43, 44	fvconstr2 49701	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑥 ≤ 𝑦)
46	19	breqd 5122	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ≤ 𝑦 ↔ 𝑥(le‘𝐶)𝑦))
47	46	biimpd 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ≤ 𝑦 → 𝑥(le‘𝐶)𝑦))
48	36, 45, 47	sylc 66	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑥(le‘𝐶)𝑦)
49		simprrr 794	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑔 ∈ (𝑦( ≤ × {1o})𝑧))
50	43, 49	fvconstr2 49701	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑦 ≤ 𝑧)
51	19	breqd 5122	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ≤ 𝑧 ↔ 𝑦(le‘𝐶)𝑧))
52	51	biimpd 232	. . . . . . 7 ⊢ (𝜑 → (𝑦 ≤ 𝑧 → 𝑦(le‘𝐶)𝑧))
53	36, 50, 52	sylc 66	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑦(le‘𝐶)𝑧)
54	14, 15	prstr 18379	. . . . . 6 ⊢ ((𝐶 ∈ Proset ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶)) ∧ (𝑥(le‘𝐶)𝑦 ∧ 𝑦(le‘𝐶)𝑧)) → 𝑥(le‘𝐶)𝑧)
55	37, 42, 48, 53, 54	syl112anc 1401	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑥(le‘𝐶)𝑧)
56	19	breqd 5122	. . . . . 6 ⊢ (𝜑 → (𝑥 ≤ 𝑧 ↔ 𝑥(le‘𝐶)𝑧))
57	56	biimprd 251	. . . . 5 ⊢ (𝜑 → (𝑥(le‘𝐶)𝑧 → 𝑥 ≤ 𝑧))
58	36, 55, 57	sylc 66	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 𝑥 ≤ 𝑧)
59	24	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 1o ∈ V)
60	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → 1o ≠ ∅)
61	43, 59, 60	fvconstr 49699	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → (𝑥 ≤ 𝑧 ↔ (𝑥( ≤ × {1o})𝑧) = 1o))
62	58, 61	mpbid 235	. . 3 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → (𝑥( ≤ × {1o})𝑧) = 1o)
63	35, 62	eleqtrrid 2872	. 2 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) ∧ (𝑓 ∈ (𝑥( ≤ × {1o})𝑦) ∧ 𝑔 ∈ (𝑦( ≤ × {1o})𝑧)))) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥( ≤ × {1o})𝑧))
64	1, 2, 8, 9, 10, 11, 30, 63	isthincd2 50274	1 ⊢ (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦 ∈ 𝐵 ↦ ∅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃*wmo 2567   ≠ wne 2960  Vcvv 3457  ∅c0 4286  {csn 4591  ⟨cop 4597   class class class wbr 5111   ↦ cmpt 5194   × cxp 5661  ‘cfv 6540  (class class class)co 7419  1_oc1o 8452  Basecbs 17293  lecple 17341  Hom chom 17345  compcco 17346  Idccid 17745   Proset cproset 18372  ThinCatcthinc 50254

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-1o 8459  df-cat 17748  df-cid 17749  df-proset 18374  df-thinc 50255

This theorem is used by:  prstcthin  50398