| 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 17893 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 17930). To construct such a category, see setc1onsubc 50439 and cnelsubc 50441. (Contributed by Zhi Wang, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| nelsubc3 | ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2oex 8471 | . . 3 ⊢ 2o ∈ V | |
| 2 | eqid 2765 | . . . 4 ⊢ (SetCat‘2o) = (SetCat‘2o) | |
| 3 | 2 | setccat 18166 | . . 3 ⊢ (2o ∈ V → (SetCat‘2o) ∈ Cat) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (SetCat‘2o) ∈ Cat |
| 5 | 1oex 8469 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 5, 5 | xpex 7758 | . . 3 ⊢ (1o × 1o) ∈ V |
| 7 | p0ex 5357 | . . 3 ⊢ {∅} ∈ V | |
| 8 | 6, 7 | xpex 7758 | . 2 ⊢ ((1o × 1o) × {∅}) ∈ V |
| 9 | 1 | a1i 11 | . . . . . 6 ⊢ (⊤ → 2o ∈ V) |
| 10 | 2, 9 | setcbas 18159 | . . . . 5 ⊢ (⊤ → 2o = (Base‘(SetCat‘2o))) |
| 11 | 10 | mptru 1577 | . . . 4 ⊢ 2o = (Base‘(SetCat‘2o)) |
| 12 | 2on0 8474 | . . . . . 6 ⊢ 2o ≠ ∅ | |
| 13 | 2on 8473 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 14 | 13 | onordi 6478 | . . . . . . 7 ⊢ Ord 2o |
| 15 | ordge1n0 8485 | . . . . . . 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 8478 | . . . . 5 ⊢ 1o ≠ ∅ | |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → 1o ≠ ∅) |
| 21 | eqidd 2766 | . . . 4 ⊢ (⊤ → ((1o × 1o) × {∅}) = ((1o × 1o) × {∅})) | |
| 22 | eqid 2765 | . . . 4 ⊢ (Homf ‘(SetCat‘2o)) = (Homf ‘(SetCat‘2o)) | |
| 23 | 11, 18, 20, 21, 22 | nelsubclem 49904 | . . 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 49907 | 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 2146 ≠ wne 2960 ∀wral 3081 ∃wrex 3091 Vcvv 3457 ⊆ wss 3906 ∅c0 4286 {csn 4591 〈cop 4597 class class class wbr 5111 × cxp 5661 Ord word 6363 Fn wfn 6535 ‘cfv 6540 (class class class)co 7419 1oc1o 8452 2oc2o 8453 Basecbs 17293 compcco 17346 Catccat 17744 Idccid 17745 Homf chomf 17746 ⊆cat cssc 17888 SetCatcsetc 18156 |
| 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-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 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-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 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-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 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-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-ixp 8902 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-z 12609 df-dec 12730 df-uz 12881 df-fz 13554 df-struct 17231 df-slot 17266 df-ndx 17278 df-base 17294 df-hom 17358 df-cco 17359 df-cat 17748 df-cid 17749 df-homf 17750 df-ssc 17891 df-setc 18157 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |