| Mathbox for Anthony Hart |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > neufal | Structured version Visualization version GIF version | ||
| Description: There does not exist exactly one set such that ⊥ is true. (Contributed by Anthony Hart, 13-Sep-2011.) |
| Ref | Expression |
|---|---|
| neufal | ⊢ ¬ ∃!𝑥⊥ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nexfal 36765 | . 2 ⊢ ¬ ∃𝑥⊥ | |
| 2 | euex 2604 | . 2 ⊢ (∃!𝑥⊥ → ∃𝑥⊥) | |
| 3 | 1, 2 | mto 199 | 1 ⊢ ¬ ∃!𝑥⊥ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ⊥wfal 1572 ∃wex 1799 ∃!weu 2595 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1563 df-fal 1573 df-ex 1800 df-eu 2596 |
| This theorem is referenced by: unqsym1 36785 |
| Copyright terms: Public domain | W3C validator |