| 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 18002 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 18039). To construct such a category, see setc1onsubc 50882 and cnelsubc 50884. (Contributed by Zhi Wang, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| nelsubc3 | ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2oex 8502 | . . 3 ⊢ 2o ∈ V | |
| 2 | eqid 2763 | . . . 4 ⊢ (SetCat‘2o) = (SetCat‘2o) | |
| 3 | 2 | setccat 18275 | . . 3 ⊢ (2o ∈ V → (SetCat‘2o) ∈ Cat) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (SetCat‘2o) ∈ Cat |
| 5 | 1oex 8500 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 5, 5 | xpex 7777 | . . 3 ⊢ (1o × 1o) ∈ V |
| 7 | p0ex 5350 | . . 3 ⊢ {∅} ∈ V | |
| 8 | 6, 7 | xpex 7777 | . 2 ⊢ ((1o × 1o) × {∅}) ∈ V |
| 9 | 1 | a1i 11 | . . . . . 6 ⊢ (⊤ → 2o ∈ V) |
| 10 | 2, 9 | setcbas 18268 | . . . . 5 ⊢ (⊤ → 2o = (Base‘(SetCat‘2o))) |
| 11 | 10 | mptru 1576 | . . . 4 ⊢ 2o = (Base‘(SetCat‘2o)) |
| 12 | 2on0 8505 | . . . . . 6 ⊢ 2o ≠ ∅ | |
| 13 | 2on 8504 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 14 | 13 | onordi 6483 | . . . . . . 7 ⊢ Ord 2o |
| 15 | ordge1n0 8516 | . . . . . . 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 8509 | . . . . 5 ⊢ 1o ≠ ∅ | |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → 1o ≠ ∅) |
| 21 | eqidd 2764 | . . . 4 ⊢ (⊤ → ((1o × 1o) × {∅}) = ((1o × 1o) × {∅})) | |
| 22 | eqid 2763 | . . . 4 ⊢ (Homf ‘(SetCat‘2o)) = (Homf ‘(SetCat‘2o)) | |
| 23 | 11, 18, 20, 21, 22 | nelsubclem 50323 | . . 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 1576 | . 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 50326 | 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 1569 ⊤wtru 1570 ∃wex 1811 ∈ wcel 2146 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∅c0 4281 {csn 4588 〈cop 4838 class class class wbr 5106 × cxp 5653 Ord word 6368 Fn wfn 6542 ‘cfv 6547 (class class class)co 7430 1oc1o 8483 2oc2o 8484 Basecbs 17402 compcco 17455 Catccat 17853 Idccid 17854 Homf chomf 17855 ⊆cat cssc 17997 SetCatcsetc 18265 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 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 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7888 df-1st 8011 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-1o 8490 df-2o 8491 df-er 8731 df-map 8863 df-ixp 8940 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-nn 12349 df-2 12418 df-3 12419 df-4 12420 df-5 12421 df-6 12422 df-7 12423 df-8 12424 df-9 12425 df-n0 12620 df-z 12707 df-dec 12828 df-uz 12979 df-fz 13653 df-struct 17340 df-slot 17375 df-ndx 17387 df-base 17403 df-hom 17467 df-cco 17468 df-cat 17857 df-cid 17858 df-homf 17859 df-ssc 18000 df-setc 18266 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |