| 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 4310 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | 1 | biimpi 219 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
| 3 | 2 | biantrurd 542 | . 2 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴))) |
| 4 | df-eu 2600 | . 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴)) | |
| 5 | 3, 4 | bitr4di 292 | 1 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∃wex 1812 ∈ wcel 2146 ∃*wmo 2568 ∃!weu 2599 ≠ wne 2961 ∅c0 4289 |
| 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-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-eu 2600 df-clab 2745 df-cleq 2758 df-ne 2962 df-dif 3911 df-nul 4290 |
| This theorem is used by: minveclem4a 25619 |
| Copyright terms: Public domain | W3C validator |