| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > n0moeu | Structured version Visualization version GIF version | ||
| Description: A case of equivalence of "at most one" and "only one". (Contributed by FL, 6-Dec-2010.) |
| Ref | Expression |
|---|---|
| n0moeu | ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4284 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | 1 | biimpi 218 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
| 3 | 2 | biantrurd 538 | . 2 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴))) |
| 4 | df-eu 2575 | . 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴)) | |
| 5 | 3, 4 | bitr4di 291 | 1 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∃wex 1787 ∈ wcel 2121 ∃*wmo 2543 ∃!weu 2574 ≠ wne 2936 ∅c0 4264 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-eu 2575 df-clab 2720 df-cleq 2733 df-ne 2937 df-dif 3888 df-nul 4265 |
| This theorem is referenced by: minveclem4a 25419 |
| Copyright terms: Public domain | W3C validator |