Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  indthinc Structured version   Visualization version   GIF version

Theorem indthinc 49966
Description: An indiscrete category in which all hom-sets have exactly one morphism is a thin category. Constructed here is an indiscrete category where all morphisms are . This is a special case of prsthinc 49968, where = (𝐵 × 𝐵). This theorem also implies a functor from the category of sets to the category of small categories. (Contributed by Zhi Wang, 17-Sep-2024.) (Proof shortened by Zhi Wang, 19-Sep-2024.)
Hypotheses
Ref Expression
indthinc.b (𝜑𝐵 = (Base‘𝐶))
indthinc.h (𝜑 → ((𝐵 × 𝐵) × {1o}) = (Hom ‘𝐶))
indthinc.o (𝜑 → ∅ = (comp‘𝐶))
indthinc.c (𝜑𝐶𝑉)
Assertion
Ref Expression
indthinc (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦𝐵 ↦ ∅)))
Distinct variable groups:   𝑦,𝐵   𝑦,𝐶   𝜑,𝑦
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem indthinc
Dummy variables 𝑓 𝑔 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 indthinc.b . 2 (𝜑𝐵 = (Base‘𝐶))
2 indthinc.h . 2 (𝜑 → ((𝐵 × 𝐵) × {1o}) = (Hom ‘𝐶))
3 eqidd 2742 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝐵 × 𝐵) × {1o}) = ((𝐵 × 𝐵) × {1o}))
43f1omo 49397 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
5 df-ov 7363 . . . . 5 (𝑥((𝐵 × 𝐵) × {1o})𝑦) = (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩)
65eleq2i 2833 . . . 4 (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
76mobii 2554 . . 3 (∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
84, 7sylibr 236 . 2 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦))
9 indthinc.o . 2 (𝜑 → ∅ = (comp‘𝐶))
10 indthinc.c . 2 (𝜑𝐶𝑉)
11 biid 263 . 2 (((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))) ↔ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))))
12 id 22 . . . . 5 (𝑦𝐵𝑦𝐵)
1312ancli 554 . . . 4 (𝑦𝐵 → (𝑦𝐵𝑦𝐵))
14 1oex 8409 . . . . 5 1o ∈ V
1514ovconst2 7540 . . . 4 ((𝑦𝐵𝑦𝐵) → (𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o)
16 0lt1o 8433 . . . . 5 ∅ ∈ 1o
17 eleq2 2830 . . . . 5 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → (∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦) ↔ ∅ ∈ 1o))
1816, 17mpbiri 260 . . . 4 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
1913, 15, 183syl 18 . . 3 (𝑦𝐵 → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2019adantl 483 . 2 ((𝜑𝑦𝐵) → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2116a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → ∅ ∈ 1o)
22 0ov 7397 . . . . . . 7 (⟨𝑥, 𝑦⟩∅𝑧) = ∅
2322oveqi 7373 . . . . . 6 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = (𝑔𝑓)
24 0ov 7397 . . . . . 6 (𝑔𝑓) = ∅
2523, 24eqtri 2764 . . . . 5 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅
2625a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅)
2714ovconst2 7540 . . . . 5 ((𝑥𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
28273adant2 1138 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
2921, 26, 283eltr4d 2856 . . 3 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
3029ad2antrl 735 . 2 ((𝜑 ∧ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧)))) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
311, 2, 8, 9, 10, 11, 20, 30isthincd2 49941 1 (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦𝐵 ↦ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wcel 2121  ∃*wmo 2543  c0 4264  {csn 4558  cop 4564  cmpt 5156   × cxp 5619  cfv 6489  (class class class)co 7360  1oc1o 8392  Basecbs 17174  Hom chom 17226  compcco 17227  Idccid 17626  ThinCatcthinc 49921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7317  df-ov 7363  df-1o 8399  df-cat 17629  df-cid 17630  df-thinc 49922
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator