Theorem catprs2 48974

Description: A category equipped with the induced preorder, where an object 𝑥 is defined to be "less than or equal to" 𝑦 iff there is a morphism from 𝑥 to 𝑦, is a preordered set, or a proset. The category might not be thin. See catprsc 48975 and catprsc2 48976 for constructions satisfying the hypothesis "catprs.1". See catprs 48973 for a more primitive version. See prsthinc 49426 for constructing a thin category from a proset. (Contributed by Zhi Wang, 18-Sep-2024.)

Hypotheses

Ref	Expression
catprs.1	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑥𝐻𝑦) ≠ ∅))
catprs.b	⊢ (𝜑 → 𝐵 = (Base‘𝐶))
catprs.h	⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))
catprs.c	⊢ (𝜑 → 𝐶 ∈ Cat)
catprs2.l	⊢ (𝜑 → ≤ = (le‘𝐶))

Assertion

Ref	Expression
catprs2	⊢ (𝜑 → 𝐶 ∈ Proset )

Distinct variable groups:   𝑥, ≤ ,𝑦   𝑥,𝐵,𝑦   𝑥,𝐻,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐶(𝑥,𝑦)

Proof of Theorem catprs2

Dummy variables 𝑤 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		catprs.1	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑥𝐻𝑦) ≠ ∅))
2		catprs.b	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐶))
3		catprs.h	. . . 4 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))
4		catprs.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
5	1, 2, 3, 4	catprs 48973	. . 3 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵)) → (𝑤 ≤ 𝑤 ∧ ((𝑤 ≤ 𝑣 ∧ 𝑣 ≤ 𝑢) → 𝑤 ≤ 𝑢)))
6	5	ralrimivvva 3181	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ∀𝑢 ∈ 𝐵 (𝑤 ≤ 𝑤 ∧ ((𝑤 ≤ 𝑣 ∧ 𝑣 ≤ 𝑢) → 𝑤 ≤ 𝑢)))
7		catprs2.l	. . 3 ⊢ (𝜑 → ≤ = (le‘𝐶))
8	2, 7, 4	isprsd 48916	. 2 ⊢ (𝜑 → (𝐶 ∈ Proset ↔ ∀𝑤 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ∀𝑢 ∈ 𝐵 (𝑤 ≤ 𝑤 ∧ ((𝑤 ≤ 𝑣 ∧ 𝑣 ≤ 𝑢) → 𝑤 ≤ 𝑢))))
9	6, 8	mpbird 257	1 ⊢ (𝜑 → 𝐶 ∈ Proset )

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∅c0 4292   class class class wbr 5102  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  lecple 17203  Hom chom 17207  Catccat 17601   Proset cproset 18229

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pr 5382

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-cat 17605  df-cid 17606  df-proset 18231

This theorem is referenced by: (None)