![]() |
Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > thincn0eu | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
thincmo.c | ⊢ (𝜑 → 𝐶 ∈ ThinCat) |
thincmo.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
thincmo.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
thincn0eu.b | ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) |
thincn0eu.h | ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶)) |
Ref | Expression |
---|---|
thincn0eu | ⊢ (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4359 | . . . . . 6 ⊢ ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌)) | |
2 | 1 | biimpi 216 | . . . . 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 48752 | . . . . 5 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌)) |
9 | 2, 8 | anim12i 612 | . . . 4 ⊢ (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))) |
10 | df-eu 2565 | . . . 4 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ (∃𝑓 𝑓 ∈ (𝑋𝐻𝑌) ∧ ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))) | |
11 | 9, 10 | sylibr 234 | . . 3 ⊢ (((𝑋𝐻𝑌) ≠ ∅ ∧ 𝜑) → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌)) |
12 | 11 | expcom 413 | . 2 ⊢ (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ → ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌))) |
13 | euex 2573 | . . 3 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → ∃𝑓 𝑓 ∈ (𝑋𝐻𝑌)) | |
14 | 13, 1 | sylibr 234 | . 2 ⊢ (∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌) → (𝑋𝐻𝑌) ≠ ∅) |
15 | 12, 14 | impbid1 225 | 1 ⊢ (𝜑 → ((𝑋𝐻𝑌) ≠ ∅ ↔ ∃!𝑓 𝑓 ∈ (𝑋𝐻𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1535 ∃wex 1774 ∈ wcel 2104 ∃*wmo 2534 ∃!weu 2564 ≠ wne 2936 ∅c0 4339 ‘cfv 6558 (class class class)co 7425 Basecbs 17234 Hom chom 17298 ThinCatcthinc 48740 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1963 ax-7 2003 ax-8 2106 ax-9 2114 ax-10 2137 ax-11 2153 ax-12 2173 ax-ext 2704 ax-nul 5307 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1087 df-tru 1538 df-fal 1548 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2536 df-eu 2565 df-clab 2711 df-cleq 2725 df-clel 2812 df-nfc 2888 df-ne 2937 df-ral 3058 df-rex 3067 df-rab 3433 df-v 3479 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4915 df-br 5150 df-iota 6510 df-fv 6566 df-ov 7428 df-thinc 48741 |
This theorem is referenced by: fullthinc 48767 prstchom2 48799 |
Copyright terms: Public domain | W3C validator |