| 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 36547 | . 2 ⊢ ¬ ∃𝑥 ¬ ⊤ | |
| 2 | eunex 5333 | . 2 ⊢ (∃!𝑥⊤ → ∃𝑥 ¬ ⊤) | |
| 3 | 1, 2 | mto 197 | 1 ⊢ ¬ ∃!𝑥⊤ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ⊤wtru 1542 ∃wex 1780 ∃!weu 2566 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-12 2182 ax-nul 5249 ax-pow 5308 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-mo 2537 df-eu 2567 |
| This theorem is referenced by: nmotru 36551 |
| Copyright terms: Public domain | W3C validator |