![]() |
Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > prstchom | Structured version Visualization version GIF version |
Description: Hom-sets of the
constructed category are dependent on the preorder.
Note that prstchom.x and prstchom.y are redundant here due to our definition of ProsetToCat. However, this should not be assumed as it is definition-dependent. Therefore, the two hypotheses are added for explicitness. (Contributed by Zhi Wang, 20-Sep-2024.) |
Ref | Expression |
---|---|
prstcnid.c | ⊢ (𝜑 → 𝐶 = (ProsetToCat‘𝐾)) |
prstcnid.k | ⊢ (𝜑 → 𝐾 ∈ Proset ) |
prstchom.l | ⊢ (𝜑 → ≤ = (le‘𝐶)) |
prstchom.e | ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶)) |
prstchom.x | ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
prstchom.y | ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
Ref | Expression |
---|---|
prstchom | ⊢ (𝜑 → (𝑋 ≤ 𝑌 ↔ (𝑋𝐻𝑌) ≠ ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prstchom.e | . . 3 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶)) | |
2 | prstcnid.c | . . . 4 ⊢ (𝜑 → 𝐶 = (ProsetToCat‘𝐾)) | |
3 | prstcnid.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ Proset ) | |
4 | prstchom.l | . . . 4 ⊢ (𝜑 → ≤ = (le‘𝐶)) | |
5 | 2, 3, 4 | prstchomval 49000 | . . 3 ⊢ (𝜑 → ( ≤ × {1o}) = (Hom ‘𝐶)) |
6 | 1, 5 | eqtr4d 2780 | . 2 ⊢ (𝜑 → 𝐻 = ( ≤ × {1o})) |
7 | 1oex 8524 | . . 3 ⊢ 1o ∈ V | |
8 | 7 | a1i 11 | . 2 ⊢ (𝜑 → 1o ∈ V) |
9 | 1n0 8534 | . . 3 ⊢ 1o ≠ ∅ | |
10 | 9 | a1i 11 | . 2 ⊢ (𝜑 → 1o ≠ ∅) |
11 | 6, 8, 10 | fvconstrn0 48730 | 1 ⊢ (𝜑 → (𝑋 ≤ 𝑌 ↔ (𝑋𝐻𝑌) ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1539 ∈ wcel 2108 ≠ wne 2940 Vcvv 3481 ∅c0 4342 {csn 4634 class class class wbr 5151 × cxp 5691 ‘cfv 6569 (class class class)co 7438 1oc1o 8507 Basecbs 17254 lecple 17314 Hom chom 17318 Proset cproset 18359 ProsetToCatcprstc 48988 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-cnex 11218 ax-resscn 11219 ax-1cn 11220 ax-icn 11221 ax-addcl 11222 ax-addrcl 11223 ax-mulcl 11224 ax-mulrcl 11225 ax-mulcom 11226 ax-addass 11227 ax-mulass 11228 ax-distr 11229 ax-i2m1 11230 ax-1ne0 11231 ax-1rid 11232 ax-rnegex 11233 ax-rrecex 11234 ax-cnre 11235 ax-pre-lttri 11236 ax-pre-lttrn 11237 ax-pre-ltadd 11238 ax-pre-mulgt0 11239 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-pss 3986 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-iun 5001 df-br 5152 df-opab 5214 df-mpt 5235 df-tr 5269 df-id 5587 df-eprel 5593 df-po 5601 df-so 5602 df-fr 5645 df-we 5647 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-pred 6329 df-ord 6395 df-on 6396 df-lim 6397 df-suc 6398 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-om 7895 df-2nd 8023 df-frecs 8314 df-wrecs 8345 df-recs 8419 df-rdg 8458 df-1o 8514 df-er 8753 df-en 8994 df-dom 8995 df-sdom 8996 df-pnf 11304 df-mnf 11305 df-xr 11306 df-ltxr 11307 df-le 11308 df-sub 11501 df-neg 11502 df-nn 12274 df-2 12336 df-3 12337 df-4 12338 df-5 12339 df-6 12340 df-7 12341 df-8 12342 df-9 12343 df-n0 12534 df-z 12621 df-dec 12741 df-sets 17207 df-slot 17225 df-ndx 17237 df-base 17255 df-ple 17327 df-hom 17331 df-cco 17332 df-prstc 48989 |
This theorem is referenced by: prstchom2 49004 oduoppcciso 49007 postc 49010 |
Copyright terms: Public domain | W3C validator |