![]() |
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 4345 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
2 | 1 | biimpi 215 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
3 | 2 | biantrurd 533 | . 2 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴))) |
4 | df-eu 2563 | . 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴)) | |
5 | 3, 4 | bitr4di 288 | 1 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∃wex 1781 ∈ wcel 2106 ∃*wmo 2532 ∃!weu 2562 ≠ wne 2940 ∅c0 4321 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-eu 2563 df-clab 2710 df-cleq 2724 df-ne 2941 df-dif 3950 df-nul 4322 |
This theorem is referenced by: minveclem4a 24938 |
Copyright terms: Public domain | W3C validator |