| 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 37319 | . 2 ⊢ ¬ ∃𝑥 ¬ ⊤ | |
| 2 | eunex 5355 | . 2 ⊢ (∃!𝑥⊤ → ∃𝑥 ¬ ⊤) | |
| 3 | 1, 2 | mto 200 | 1 ⊢ ¬ ∃!𝑥⊤ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ⊤wtru 1570 ∃wex 1811 ∃!weu 2596 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-12 2215 ax-nul 5262 ax-pow 5330 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-nf 1816 df-mo 2567 df-eu 2597 |
| This theorem is used by: nmotru 37323 |
| Copyright terms: Public domain | W3C validator |