| Mathbox for Anthony Hart |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > neutru | 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 |
|---|---|
| neutru | ⊢ ¬ ∃!𝑥⊤ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nexntru 36935 | . 2 ⊢ ¬ ∃𝑥 ¬ ⊤ | |
| 2 | eunex 5361 | . 2 ⊢ (∃!𝑥⊤ → ∃𝑥 ¬ ⊤) | |
| 3 | 1, 2 | mto 200 | 1 ⊢ ¬ ∃!𝑥⊤ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ⊤wtru 1571 ∃wex 1809 ∃!weu 2596 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-12 2213 ax-nul 5269 ax-pow 5336 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-nf 1814 df-mo 2567 df-eu 2597 |
| This theorem is referenced by: nmotru 36939 |
| Copyright terms: Public domain | W3C validator |