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 49315
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 49317, 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 2737 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝐵 × 𝐵) × {1o}) = ((𝐵 × 𝐵) × {1o}))
43f1omo 48835 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
5 df-ov 7413 . . . . 5 (𝑥((𝐵 × 𝐵) × {1o})𝑦) = (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩)
65eleq2i 2827 . . . 4 (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
76mobii 2548 . . 3 (∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
84, 7sylibr 234 . 2 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦))
9 indthinc.o . 2 (𝜑 → ∅ = (comp‘𝐶))
10 indthinc.c . 2 (𝜑𝐶𝑉)
11 biid 261 . 2 (((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))) ↔ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))))
12 id 22 . . . . 5 (𝑦𝐵𝑦𝐵)
1312ancli 548 . . . 4 (𝑦𝐵 → (𝑦𝐵𝑦𝐵))
14 1oex 8495 . . . . 5 1o ∈ V
1514ovconst2 7592 . . . 4 ((𝑦𝐵𝑦𝐵) → (𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o)
16 0lt1o 8521 . . . . 5 ∅ ∈ 1o
17 eleq2 2824 . . . . 5 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → (∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦) ↔ ∅ ∈ 1o))
1816, 17mpbiri 258 . . . 4 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
1913, 15, 183syl 18 . . 3 (𝑦𝐵 → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2019adantl 481 . 2 ((𝜑𝑦𝐵) → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2116a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → ∅ ∈ 1o)
22 0ov 7447 . . . . . . 7 (⟨𝑥, 𝑦⟩∅𝑧) = ∅
2322oveqi 7423 . . . . . 6 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = (𝑔𝑓)
24 0ov 7447 . . . . . 6 (𝑔𝑓) = ∅
2523, 24eqtri 2759 . . . . 5 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅
2625a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅)
2714ovconst2 7592 . . . . 5 ((𝑥𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
28273adant2 1131 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
2921, 26, 283eltr4d 2850 . . 3 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
3029ad2antrl 728 . 2 ((𝜑 ∧ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧)))) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
311, 2, 8, 9, 10, 11, 20, 30isthincd2 49290 1 (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦𝐵 ↦ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  ∃*wmo 2538  c0 4313  {csn 4606  cop 4612  cmpt 5206   × cxp 5657  cfv 6536  (class class class)co 7410  1oc1o 8478  Basecbs 17233  Hom chom 17287  compcco 17288  Idccid 17682  ThinCatcthinc 49270
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pr 5407
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-1o 8485  df-cat 17685  df-cid 17686  df-thinc 49271
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator