Theorem thincn0eu 50089

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

Step	Hyp	Ref	Expression
1		n0 4314	. . . . . 6 ⊢ ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌))
2	1	biimpi 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 ‘𝐶))
8	3, 4, 5, 6, 7	thincmod 50088	. . . . 5 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))
9	2, 8	anim12i 624	. . . 4 ⊢ (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
10		df-eu 2603	. . . 4 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
11	9, 10	sylibr 237	. . 3 ⊢ (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌))
12	11	expcom 418	. 2 ⊢ (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)))
13		euex 2611	. . 3 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌))
14	13, 1	sylibr 237	. 2 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → (𝑋𝐻𝑌) ≠ ∅)
15	12, 14	impbid1 228	1 ⊢ (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567  ∃wex 1806   ∈ wcel 2149  ∃*wmo 2571  ∃!weu 2602   ≠ wne 2964  ∅c0 4294  ‘cfv 6534  (class class class)co 7408  Basecbs 17265  Hom chom 17317  ThinCatcthinc 50075

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-nul 5268

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-iota 6490  df-fv 6542  df-ov 7411  df-thinc 50076

This theorem is referenced by:  fullthinc  50108  prstchom2  50221