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

Theorem indcthing 50810
Description: An indiscrete category, i.e., a category where all hom-sets have exactly one morphism, is thin. (Contributed by Zhi Wang, 11-Nov-2025.)
Hypotheses
Ref Expression
indcthing.b (𝜑 → 𝐵 = (Base‘𝐶))
indcthing.h (𝜑 → 𝐻 = (Hom ‘𝐶))
indcthing.c (𝜑 → 𝐶 ∈ Cat)
indcthing.i ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐻𝑦) = {𝐹})
Assertion
Ref Expression
indcthing (𝜑 → 𝐶 ∈ ThinCat)
Distinct variable groups:   𝑦,𝐵   𝑥,𝐶,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑥)   𝐹(𝑥, 𝑦)   𝐻(𝑥, 𝑦)

Proof of Theorem indcthing
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 indcthing.b . 2 (𝜑 → 𝐵 = (Base‘𝐶))
2 indcthing.h . 2 (𝜑 → 𝐻 = (Hom ‘𝐶))
3 eqid 2763 . . . 4 {𝐹} = {𝐹}
4 mosn 50139 . . . 4 ({𝐹} = {𝐹} → ∃*𝑓 𝑓 ∈ {𝐹})
53, 4ax-mp 5 . . 3 ∃*𝑓 𝑓 ∈ {𝐹}
6 indcthing.i . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐻𝑦) = {𝐹})
76eleq2d 2850 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑓 ∈ (𝑥𝐻𝑦) ↔ 𝑓 ∈ {𝐹}))
87mobidv 2577 . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑓 𝑓 ∈ {𝐹}))
95, 8mpbiri 261 . 2 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
10 indcthing.c . 2 (𝜑 → 𝐶 ∈ Cat)
111, 2, 9, 10isthincd 50786 1 (𝜑 → 𝐶 ∈ ThinCat)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  {csn 4588  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  Hom chom 17471  Catccat 17870  ThinCatcthinc 50767
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-nul 5264
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-ov 7449  df-thinc 50768
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator