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 33755 | . 2 ⊢ ¬ ∃𝑥⊥ | |
2 | euex 2662 | . 2 ⊢ (∃!𝑥⊥ → ∃𝑥⊥) | |
3 | 1, 2 | mto 199 | 1 ⊢ ¬ ∃!𝑥⊥ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ⊥wfal 1549 ∃wex 1780 ∃!weu 2653 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-tru 1540 df-fal 1550 df-ex 1781 df-eu 2654 |
This theorem is referenced by: unqsym1 33775 |
Copyright terms: Public domain | W3C validator |