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

Theorem thincn0eu 50508
Description: In a thin category, a hom-set being non-empty is equivalent to having a unique element. (Contributed by Zhi Wang, 21-Sep-2024.)
Hypotheses
Ref Expression
thincmo.c (𝜑 → 𝐶 ∈ ThinCat)
thincmo.x (𝜑 → 𝑋 ∈ 𝐵)
thincmo.y (𝜑 → 𝑌 ∈ 𝐵)
thincn0eu.b (𝜑 → 𝐵 = (Base‘𝐶))
thincn0eu.h (𝜑 → 𝐻 = (Hom ‘𝐶))
Assertion
Ref Expression
thincn0eu (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
Distinct variable groups:   𝐵,𝑓   𝐶,𝑓   𝑓,𝐻   𝑓,𝑋   𝑓,𝑌   𝜑,𝑓

Proof of Theorem thincn0eu
StepHypRef Expression
1 n0 4300 . . . . . 6 ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌))
21biimpi 219 . . . . 5 ((𝑋𝐻𝑌) ≠ ∅ → ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌))
3 thincmo.c . . . . . 6 (𝜑 → 𝐶 ∈ ThinCat)
4 thincmo.x . . . . . 6 (𝜑 → 𝑋 ∈ 𝐵)
5 thincmo.y . . . . . 6 (𝜑 → 𝑌 ∈ 𝐵)
6 thincn0eu.b . . . . . 6 (𝜑 → 𝐵 = (Base‘𝐶))
7 thincn0eu.h . . . . . 6 (𝜑 → 𝐻 = (Hom ‘𝐶))
83, 4, 5, 6, 7thincmod 50507 . . . . 5 (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))
92, 8anim12i 625 . . . 4 (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
10 df-eu 2595 . . . 4 (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
119, 10sylibr 237 . . 3 (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌))
1211expcom 419 . 2 (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
13 euex 2603 . . 3 (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌))
1413, 1sylibr 237 . 2 (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → (𝑋𝐻𝑌) ≠ ∅)
1512, 14impbid1 228 1 (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃*wmo 2563  ∃!weu 2594   ≠ wne 2956  ∅c0 4279  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Hom chom 17432  ThinCatcthinc 50494
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-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-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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 6493  df-fv 6545  df-ov 7421  df-thinc 50495
This theorem is used by:  fullthinc  50527  prstchom2  50640
  Copyright terms: Public domain W3C validator