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

Theorem discthing 50689
Description: A discrete category, i.e., a category where all morphisms are identity morphisms, is thin. Example 3.26(1) of [Adamek] p. 33. (Contributed by Zhi Wang, 11-Nov-2025.)
Hypotheses
Ref Expression
indcthing.b (𝜑 → 𝐵 = (Base‘𝐶))
indcthing.h (𝜑 → 𝐻 = (Hom ‘𝐶))
indcthing.c (𝜑 → 𝐶 ∈ Cat)
discthing.i ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐻𝑦) = if(𝑥 = 𝑦, {𝐼}, ∅))
Assertion
Ref Expression
discthing (𝜑 → 𝐶 ∈ ThinCat)
Distinct variable groups:   𝑦,𝐵   𝑥,𝐶,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑥)   𝐻(𝑥, 𝑦)   𝐼(𝑥, 𝑦)

Proof of Theorem discthing
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 indcthing.b . 2 (𝜑 → 𝐵 = (Base‘𝐶))
2 indcthing.h . 2 (𝜑 → 𝐻 = (Hom ‘𝐶))
3 eleq2w2 2756 . . . . 5 ({𝐼} = if(𝑥 = 𝑦, {𝐼}, ∅) → (𝑖 ∈ {𝐼} ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
43mobidv 2574 . . . 4 ({𝐼} = if(𝑥 = 𝑦, {𝐼}, ∅) → (∃*𝑖 𝑖 ∈ {𝐼} ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
5 eleq2w2 2756 . . . . 5 (∅ = if(𝑥 = 𝑦, {𝐼}, ∅) → (𝑖 ∈ ∅ ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
65mobidv 2574 . . . 4 (∅ = if(𝑥 = 𝑦, {𝐼}, ∅) → (∃*𝑖 𝑖 ∈ ∅ ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
7 eqid 2760 . . . . 5 {𝐼} = {𝐼}
8 mosn 50017 . . . . 5 ({𝐼} = {𝐼} → ∃*𝑖 𝑖 ∈ {𝐼})
97, 8mp1i 14 . . . 4 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑥 = 𝑦) → ∃*𝑖 𝑖 ∈ {𝐼})
10 eqid 2760 . . . . 5 ∅ = ∅
11 mo0 50018 . . . . 5 (∅ = ∅ → ∃*𝑖 𝑖 ∈ ∅)
1210, 11mp1i 14 . . . 4 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ ¬ 𝑥 = 𝑦) → ∃*𝑖 𝑖 ∈ ∅)
134, 6, 9, 12ifbothda 4520 . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅))
14 discthing.i . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐻𝑦) = if(𝑥 = 𝑦, {𝐼}, ∅))
1514eleq2d 2846 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑖 ∈ (𝑥𝐻𝑦) ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
1615mobidv 2574 . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃*𝑖 𝑖 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
1713, 16mpbird 260 . 2 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑖 𝑖 ∈ (𝑥𝐻𝑦))
18 indcthing.c . 2 (𝜑 → 𝐶 ∈ Cat)
191, 2, 17, 18isthincd 50664 1 (𝜑 → 𝐶 ∈ ThinCat)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃*wmo 2562  ∅c0 4278  ifcif 4481  {csn 4584  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  Hom chom 17444  Catccat 17843  ThinCatcthinc 50645
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-ov 7423  df-thinc 50646
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator