Theorem catprs 49198

Description: A preorder can be extracted from a category. See catprs2 49199 for more details. (Contributed by Zhi Wang, 18-Sep-2024.)

Hypotheses

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

Assertion

Ref	Expression
catprs	⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 ≤ 𝑍)))

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

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)   𝑍(𝑥,𝑦)

Proof of Theorem catprs

Step	Hyp	Ref	Expression
1		eqid 2734	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2734	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2734	. . . . . 6 ⊢ (Id‘𝐶) = (Id‘𝐶)
4		catprs.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ Cat)
5	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐶 ∈ Cat)
6		simpr1 1195	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
7		catprs.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐶))
8	7	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐵 = (Base‘𝐶))
9	6, 8	eleqtrd 2836	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ (Base‘𝐶))
10	1, 2, 3, 5, 9	catidcl 17603	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
11		catprs.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))
12	11	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐻 = (Hom ‘𝐶))
13	12	oveqd 7373	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋𝐻𝑋) = (𝑋(Hom ‘𝐶)𝑋))
14	10, 13	eleqtrrd 2837	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((Id‘𝐶)‘𝑋) ∈ (𝑋𝐻𝑋))
15	14	ne0d 4292	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋𝐻𝑋) ≠ ∅)
16		catprs.1	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑥𝐻𝑦) ≠ ∅))
17	16	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑥𝐻𝑦) ≠ ∅))
18	17, 6, 6	catprslem 49197	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ↔ (𝑋𝐻𝑋) ≠ ∅))
19	15, 18	mpbird 257	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ≤ 𝑋)
20	11	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝐻 = (Hom ‘𝐶))
21	20	oveqd 7373	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋𝐻𝑍) = (𝑋(Hom ‘𝐶)𝑍))
22	7	eleq2d 2820	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ 𝑋 ∈ (Base‘𝐶)))
23	7	eleq2d 2820	. . . . . . . 8 ⊢ (𝜑 → (𝑌 ∈ 𝐵 ↔ 𝑌 ∈ (Base‘𝐶)))
24	7	eleq2d 2820	. . . . . . . 8 ⊢ (𝜑 → (𝑍 ∈ 𝐵 ↔ 𝑍 ∈ (Base‘𝐶)))
25	22, 23, 24	3anbi123d 1438	. . . . . . 7 ⊢ (𝜑 → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ↔ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))))
26	25	pm5.32i 574	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ↔ (𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))))
27		eqid 2734	. . . . . . 7 ⊢ (comp‘𝐶) = (comp‘𝐶)
28	4	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝐶 ∈ Cat)
29		simplr1 1216	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝑋 ∈ (Base‘𝐶))
30		simplr2 1217	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝑌 ∈ (Base‘𝐶))
31		simplr3 1218	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝑍 ∈ (Base‘𝐶))
32	20	oveqd 7373	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝐶)𝑌))
33		simpr2 1196	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
34	17, 6, 33	catprslem 49197	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (𝑋𝐻𝑌) ≠ ∅))
35	34	biimpa 476	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 ≤ 𝑌) → (𝑋𝐻𝑌) ≠ ∅)
36	35	adantrr 717	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋𝐻𝑌) ≠ ∅)
37	32, 36	eqnetrrd 2998	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋(Hom ‘𝐶)𝑌) ≠ ∅)
38	26, 37	sylanbr 582	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋(Hom ‘𝐶)𝑌) ≠ ∅)
39	20	oveqd 7373	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑌𝐻𝑍) = (𝑌(Hom ‘𝐶)𝑍))
40		simpr3 1197	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑍 ∈ 𝐵)
41	17, 33, 40	catprslem 49197	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 ≤ 𝑍 ↔ (𝑌𝐻𝑍) ≠ ∅))
42	41	biimpa 476	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑌 ≤ 𝑍) → (𝑌𝐻𝑍) ≠ ∅)
43	42	adantrl 716	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑌𝐻𝑍) ≠ ∅)
44	39, 43	eqnetrrd 2998	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑌(Hom ‘𝐶)𝑍) ≠ ∅)
45	26, 44	sylanbr 582	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑌(Hom ‘𝐶)𝑍) ≠ ∅)
46	1, 2, 27, 28, 29, 30, 31, 38, 45	catcone0 17608	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐶) ∧ 𝑌 ∈ (Base‘𝐶) ∧ 𝑍 ∈ (Base‘𝐶))) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋(Hom ‘𝐶)𝑍) ≠ ∅)
47	26, 46	sylanb 581	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋(Hom ‘𝐶)𝑍) ≠ ∅)
48	21, 47	eqnetrd 2997	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋𝐻𝑍) ≠ ∅)
49	17, 6, 40	catprslem 49197	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑍 ↔ (𝑋𝐻𝑍) ≠ ∅))
50	49	adantr 480	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → (𝑋 ≤ 𝑍 ↔ (𝑋𝐻𝑍) ≠ ∅))
51	48, 50	mpbird 257	. . 3 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ (𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍)) → 𝑋 ≤ 𝑍)
52	51	ex 412	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 ≤ 𝑍))
53	19, 52	jca 511	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑋 ∧ ((𝑋 ≤ 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 ≤ 𝑍)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2930  ∀wral 3049  ∅c0 4283   class class class wbr 5096  ‘cfv 6490  (class class class)co 7356  Basecbs 17134  Hom chom 17186  compcco 17187  Catccat 17585  Idccid 17586

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-cat 17589  df-cid 17590

This theorem is referenced by:  catprs2  49199