| 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 4306 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | 1 | biimpi 219 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
| 3 | 2 | biantrurd 541 | . 2 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴))) |
| 4 | df-eu 2596 | . 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴)) | |
| 5 | 3, 4 | bitr4di 292 | 1 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∃wex 1808 ∈ wcel 2142 ∃*wmo 2564 ∃!weu 2595 ≠ wne 2957 ∅c0 4285 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-eu 2596 df-clab 2741 df-cleq 2754 df-ne 2958 df-dif 3907 df-nul 4286 |
| This theorem is used by: minveclem4a 25600 |
| Copyright terms: Public domain | W3C validator |