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 218 | . . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴) |
3 | 2 | biantrurd 535 | . 2 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴))) |
4 | df-eu 2654 | . 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃*𝑥 𝑥 ∈ 𝐴)) | |
5 | 3, 4 | syl6bbr 291 | 1 ⊢ (𝐴 ≠ ∅ → (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 𝑥 ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∃wex 1780 ∈ wcel 2114 ∃*wmo 2620 ∃!weu 2653 ≠ wne 3016 ∅c0 4291 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-dif 3939 df-nul 4292 |
This theorem is referenced by: minveclem4a 24033 |
Copyright terms: Public domain | W3C validator |