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 50513
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 2757 . . . . 5 ({𝐼} = if(𝑥 = 𝑦, {𝐼}, ∅) → (𝑖 ∈ {𝐼} ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
43mobidv 2575 . . . 4 ({𝐼} = if(𝑥 = 𝑦, {𝐼}, ∅) → (∃*𝑖 𝑖 ∈ {𝐼} ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
5 eleq2w2 2757 . . . . 5 (∅ = if(𝑥 = 𝑦, {𝐼}, ∅) → (𝑖 ∈ ∅ ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
65mobidv 2575 . . . 4 (∅ = if(𝑥 = 𝑦, {𝐼}, ∅) → (∃*𝑖 𝑖 ∈ ∅ ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
7 eqid 2761 . . . . 5 {𝐼} = {𝐼}
8 mosn 49867 . . . . 5 ({𝐼} = {𝐼} → ∃*𝑖 𝑖 ∈ {𝐼})
97, 8mp1i 14 . . . 4 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑥 = 𝑦) → ∃*𝑖 𝑖 ∈ {𝐼})
10 eqid 2761 . . . . 5 ∅ = ∅
11 mo0 49868 . . . . 5 (∅ = ∅ → ∃*𝑖 𝑖 ∈ ∅)
1210, 11mp1i 14 . . . 4 (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ ¬ 𝑥 = 𝑦) → ∃*𝑖 𝑖 ∈ ∅)
134, 6, 9, 12ifbothda 4521 . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅))
14 discthing.i . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐻𝑦) = if(𝑥 = 𝑦, {𝐼}, ∅))
1514eleq2d 2847 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑖 ∈ (𝑥𝐻𝑦) ↔ 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
1615mobidv 2575 . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃*𝑖 𝑖 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑖 𝑖 ∈ if(𝑥 = 𝑦, {𝐼}, ∅)))
1713, 16mpbird 260 . 2 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑖 𝑖 ∈ (𝑥𝐻𝑦))
18 indcthing.c . 2 (𝜑 → 𝐶 ∈ Cat)
191, 2, 17, 18isthincd 50488 1 (𝜑 → 𝐶 ∈ ThinCat)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃*wmo 2563  ∅c0 4279  ifcif 4482  {csn 4584  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Hom chom 17419  Catccat 17818  ThinCatcthinc 50469
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6487  df-fv 6539  df-ov 7415  df-thinc 50470
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator