| 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 17987 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 18024). To construct such a category, see setc1onsubc 50709 and cnelsubc 50711. (Contributed by Zhi Wang, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| nelsubc3 | ⊢ ∃𝑐 ∈ Cat ∃𝑗∃𝑠(𝑗 Fn (𝑠 × 𝑠) ∧ (𝑗 ⊆cat (Homf ‘𝑐) ∧ (¬ ∀𝑥 ∈ 𝑠 ((Id‘𝑐)‘𝑥) ∈ (𝑥𝑗𝑥) ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥𝑗𝑦)∀𝑔 ∈ (𝑦𝑗𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥𝑗𝑧)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2oex 8488 | . . 3 ⊢ 2o ∈ V | |
| 2 | eqid 2761 | . . . 4 ⊢ (SetCat‘2o) = (SetCat‘2o) | |
| 3 | 2 | setccat 18260 | . . 3 ⊢ (2o ∈ V → (SetCat‘2o) ∈ Cat) |
| 4 | 1, 3 | ax-mp 5 | . 2 ⊢ (SetCat‘2o) ∈ Cat |
| 5 | 1oex 8486 | . . . 4 ⊢ 1o ∈ V | |
| 6 | 5, 5 | xpex 7767 | . . 3 ⊢ (1o × 1o) ∈ V |
| 7 | p0ex 5346 | . . 3 ⊢ {∅} ∈ V | |
| 8 | 6, 7 | xpex 7767 | . 2 ⊢ ((1o × 1o) × {∅}) ∈ V |
| 9 | 1 | a1i 11 | . . . . . 6 ⊢ (⊤ → 2o ∈ V) |
| 10 | 2, 9 | setcbas 18253 | . . . . 5 ⊢ (⊤ → 2o = (Base‘(SetCat‘2o))) |
| 11 | 10 | mptru 1577 | . . . 4 ⊢ 2o = (Base‘(SetCat‘2o)) |
| 12 | 2on0 8491 | . . . . . 6 ⊢ 2o ≠ ∅ | |
| 13 | 2on 8490 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 14 | 13 | onordi 6476 | . . . . . . 7 ⊢ Ord 2o |
| 15 | ordge1n0 8502 | . . . . . . 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 8495 | . . . . 5 ⊢ 1o ≠ ∅ | |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → 1o ≠ ∅) |
| 21 | eqidd 2762 | . . . 4 ⊢ (⊤ → ((1o × 1o) × {∅}) = ((1o × 1o) × {∅})) | |
| 22 | eqid 2761 | . . . 4 ⊢ (Homf ‘(SetCat‘2o)) = (Homf ‘(SetCat‘2o)) | |
| 23 | 11, 18, 20, 21, 22 | nelsubclem 50174 | . . 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 50177 | 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 2956 ∀wral 3077 ∃wrex 3087 Vcvv 3451 ⊆ wss 3899 ∅c0 4279 {csn 4584 〈cop 4590 class class class wbr 5103 × cxp 5649 Ord word 6361 Fn wfn 6533 ‘cfv 6538 (class class class)co 7420 1oc1o 8469 2oc2o 8470 Basecbs 17387 compcco 17440 Catccat 17838 Idccid 17839 Homf chomf 17840 ⊆cat cssc 17982 SetCatcsetc 18250 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-er 8717 df-map 8849 df-ixp 8926 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-struct 17325 df-slot 17360 df-ndx 17372 df-base 17388 df-hom 17452 df-cco 17453 df-cat 17842 df-cid 17843 df-homf 17844 df-ssc 17985 df-setc 18251 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |