| 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 18037 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 18074). To construct such a category, see setc1onsubc 51132 and cnelsubc 51134. (Contributed by Zhi Wang, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| nelsubc3 | ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2oex 8526 | . . 3 ⊢ 2o ∈ V | |
| 2 | eqid 2763 | . . . 4 ⊢ (SetCat‘2o) = (SetCat‘2o) | |
| 3 | 2 | setccat 18310 | . . 3 ⊢ (2o ∈ V → (SetCat‘2o) ∈ Cat) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (SetCat‘2o) ∈ Cat |
| 5 | 1oex 8524 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 5, 5 | xpex 7799 | . . 3 ⊢ (1o × 1o) ∈ V |
| 7 | p0ex 5353 | . . 3 ⊢ {∅} ∈ V | |
| 8 | 6, 7 | xpex 7799 | . 2 ⊢ ((1o × 1o) × {∅}) ∈ V |
| 9 | 1 | a1i 11 | . . . . . 6 ⊢ (⊤ → 2o ∈ V) |
| 10 | 2, 9 | setcbas 18303 | . . . . 5 ⊢ (⊤ → 2o = (Base‘(SetCat‘2o))) |
| 11 | 10 | mptru 1577 | . . . 4 ⊢ 2o = (Base‘(SetCat‘2o)) |
| 12 | 2on0 8529 | . . . . . 6 ⊢ 2o ≠ ∅ | |
| 13 | 2on 8528 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 14 | 13 | onordi 6502 | . . . . . . 7 ⊢ Ord 2o |
| 15 | ordge1n0 8540 | . . . . . . 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 8533 | . . . . 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 50573 | . . 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 50576 | 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 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∅c0 4281 {csn 4588 〈cop 4840 class class class wbr 5108 × cxp 5656 Ord word 6387 Fn wfn 6561 ‘cfv 6566 (class class class)co 7451 1oc1o 8507 2oc2o 8508 Basecbs 17431 compcco 17484 Catccat 17888 Idccid 17889 Homf chomf 17890 ⊆cat cssc 18032 SetCatcsetc 18300 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-map 8887 df-ixp 8964 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-struct 17369 df-slot 17404 df-ndx 17416 df-base 17432 df-hom 17497 df-cco 17498 df-cat 17892 df-cid 17893 df-homf 17894 df-ssc 18035 df-setc 18301 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |