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 50223
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 50225, 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 2764 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝐵 × 𝐵) × {1o}) = ((𝐵 × 𝐵) × {1o}))
43f1omo 49654 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
5 df-ov 7415 . . . . 5 (𝑥((𝐵 × 𝐵) × {1o})𝑦) = (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩)
65eleq2i 2855 . . . 4 (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
76mobii 2576 . . 3 (∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ↔ ∃*𝑓 𝑓 ∈ (((𝐵 × 𝐵) × {1o})‘⟨𝑥, 𝑦⟩))
84, 7sylibr 237 . 2 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦))
9 indthinc.o . 2 (𝜑 → ∅ = (comp‘𝐶))
10 indthinc.c . 2 (𝜑𝐶𝑉)
11 biid 264 . 2 (((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))) ↔ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧))))
12 id 23 . . . . 5 (𝑦𝐵𝑦𝐵)
1312ancli 557 . . . 4 (𝑦𝐵 → (𝑦𝐵𝑦𝐵))
14 1oex 8464 . . . . 5 1o ∈ V
1514ovconst2 7592 . . . 4 ((𝑦𝐵𝑦𝐵) → (𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o)
16 0lt1o 8490 . . . . 5 ∅ ∈ 1o
17 eleq2 2852 . . . . 5 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → (∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦) ↔ ∅ ∈ 1o))
1816, 17mpbiri 261 . . . 4 ((𝑦((𝐵 × 𝐵) × {1o})𝑦) = 1o → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
1913, 15, 183syl 19 . . 3 (𝑦𝐵 → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2019adantl 486 . 2 ((𝜑𝑦𝐵) → ∅ ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑦))
2116a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → ∅ ∈ 1o)
22 0ov 7449 . . . . . . 7 (⟨𝑥, 𝑦⟩∅𝑧) = ∅
2322oveqi 7425 . . . . . 6 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = (𝑔𝑓)
24 0ov 7449 . . . . . 6 (𝑔𝑓) = ∅
2523, 24eqtri 2786 . . . . 5 (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅
2625a1i 11 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) = ∅)
2714ovconst2 7592 . . . . 5 ((𝑥𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
28273adant2 1149 . . . 4 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥((𝐵 × 𝐵) × {1o})𝑧) = 1o)
2921, 26, 283eltr4d 2878 . . 3 ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
3029ad2antrl 740 . 2 ((𝜑 ∧ ((𝑥𝐵𝑦𝐵𝑧𝐵) ∧ (𝑓 ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑦) ∧ 𝑔 ∈ (𝑦((𝐵 × 𝐵) × {1o})𝑧)))) → (𝑔(⟨𝑥, 𝑦⟩∅𝑧)𝑓) ∈ (𝑥((𝐵 × 𝐵) × {1o})𝑧))
311, 2, 8, 9, 10, 11, 20, 30isthincd2 50198 1 (𝜑 → (𝐶 ∈ ThinCat ∧ (Id‘𝐶) = (𝑦𝐵 ↦ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  ∃*wmo 2565  c0 4287  {csn 4590  cop 4596  cmpt 5193   × cxp 5661  cfv 6538  (class class class)co 7412  1oc1o 8447  Basecbs 17270  Hom chom 17322  compcco 17323  Idccid 17722  ThinCatcthinc 50178
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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 7369  df-ov 7415  df-1o 8454  df-cat 17725  df-cid 17726  df-thinc 50179
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator