| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nelsubc3 | Structured version Visualization version GIF version | ||
| Description: Remark 4.2(2) of [Adamek] p. 48. There exists a set satisfying all
conditions for a subcategory but the existence of identity morphisms.
Therefore such condition in df-subc 17904 is necessary.
Note that this theorem cheated a little bit because (𝐶 ↾cat 𝐽) is not a category. In fact (𝐶 ↾cat 𝐽) ∈ Cat is a stronger statement than the condition (d) of Definition 4.1(1) of [Adamek] p. 48, as stated here (see the proof of issubc3 17941). To construct such a category, see setc1onsubc 50531 and cnelsubc 50533. (Contributed by Zhi Wang, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| nelsubc3 | ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2oex 8470 | . . 3 ⊢ 2o ∈ V | |
| 2 | eqid 2760 | . . . 4 ⊢ (SetCat‘2o) = (SetCat‘2o) | |
| 3 | 2 | setccat 18177 | . . 3 ⊢ (2o ∈ V → (SetCat‘2o) ∈ Cat) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (SetCat‘2o) ∈ Cat |
| 5 | 1oex 8468 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 5, 5 | xpex 7753 | . . 3 ⊢ (1o × 1o) ∈ V |
| 7 | p0ex 5349 | . . 3 ⊢ {∅} ∈ V | |
| 8 | 6, 7 | xpex 7753 | . 2 ⊢ ((1o × 1o) × {∅}) ∈ V |
| 9 | 1 | a1i 11 | . . . . . 6 ⊢ (⊤ → 2o ∈ V) |
| 10 | 2, 9 | setcbas 18170 | . . . . 5 ⊢ (⊤ → 2o = (Base‘(SetCat‘2o))) |
| 11 | 10 | mptru 1577 | . . . 4 ⊢ 2o = (Base‘(SetCat‘2o)) |
| 12 | 2on0 8473 | . . . . . 6 ⊢ 2o ≠ ∅ | |
| 13 | 2on 8472 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 14 | 13 | onordi 6471 | . . . . . . 7 ⊢ Ord 2o |
| 15 | ordge1n0 8484 | . . . . . . 7 ⊢ (Ord 2o → (1o ⊆ 2o ↔ 2o ≠ ∅)) | |
| 16 | 14, 15 | ax-mp 5 | . . . . . 6 ⊢ (1o ⊆ 2o ↔ 2o ≠ ∅) |
| 17 | 12, 16 | mpbir 234 | . . . . 5 ⊢ 1o ⊆ 2o |
| 18 | 17 | a1i 11 | . . . 4 ⊢ (⊤ → 1o ⊆ 2o) |
| 19 | 1n0 8477 | . . . . 5 ⊢ 1o ≠ ∅ | |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → 1o ≠ ∅) |
| 21 | eqidd 2761 | . . . 4 ⊢ (⊤ → ((1o × 1o) × {∅}) = ((1o × 1o) × {∅})) | |
| 22 | eqid 2760 | . . . 4 ⊢ (Homf ‘(SetCat‘2o)) = (Homf ‘(SetCat‘2o)) | |
| 23 | 11, 18, 20, 21, 22 | nelsubclem 49996 | . . 3 ⊢ (⊤ → (((1o × 1o) × {∅}) Fn (1o × 1o) ∧ (((1o × 1o) × {∅}) ⊆cat (Homf ‘(SetCat‘2o)) ∧ (¬ ∀𝑥 ∈ 1o ((Id‘(SetCat‘2o))‘𝑥) ∈ (𝑥((1o × 1o) × {∅})𝑥) ∧ ∀𝑥 ∈ 1o ∀𝑦 ∈ 1o ∀𝑧 ∈ 1o ∀𝑓 ∈ (𝑥((1o × 1o) × {∅})𝑦)∀𝑔 ∈ (𝑦((1o × 1o) × {∅})𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘(SetCat‘2o))𝑧)𝑓) ∈ (𝑥((1o × 1o) × {∅})𝑧))))) |
| 24 | 23 | mptru 1577 | . 2 ⊢ (((1o × 1o) × {∅}) Fn (1o × 1o) ∧ (((1o × 1o) × {∅}) ⊆cat (Homf ‘(SetCat‘2o)) ∧ (¬ ∀𝑥 ∈ 1o ((Id‘(SetCat‘2o))‘𝑥) ∈ (𝑥((1o × 1o) × {∅})𝑥) ∧ ∀𝑥 ∈ 1o ∀𝑦 ∈ 1o ∀𝑧 ∈ 1o ∀𝑓 ∈ (𝑥((1o × 1o) × {∅})𝑦)∀𝑔 ∈ (𝑦((1o × 1o) × {∅})𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘(SetCat‘2o))𝑧)𝑓) ∈ (𝑥((1o × 1o) × {∅})𝑧)))) |
| 25 | 4, 8, 5, 24 | nelsubc3lem 49999 | 1 ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∃wex 1812 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ⊆ wss 3899 ∅c0 4279 {csn 4584 〈cop 4590 class class class wbr 5103 × cxp 5653 Ord word 6356 Fn wfn 6528 ‘cfv 6533 (class class class)co 7414 1oc1o 8451 2oc2o 8452 Basecbs 17304 compcco 17357 Catccat 17755 Idccid 17756 Homf chomf 17757 ⊆cat cssc 17899 SetCatcsetc 18167 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-2o 8459 df-er 8699 df-map 8831 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12532 df-z 12619 df-dec 12740 df-uz 12891 df-fz 13565 df-struct 17242 df-slot 17277 df-ndx 17289 df-base 17305 df-hom 17369 df-cco 17370 df-cat 17759 df-cid 17760 df-homf 17761 df-ssc 17902 df-setc 18168 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |