| Mathbox for Anthony Hart |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nmotru | Structured version Visualization version GIF version | ||
| Description: There does not exist at most one set such that ⊤ is true. (Contributed by Anthony Hart, 13-Sep-2011.) |
| Ref | Expression |
|---|---|
| nmotru | ⊢ ¬ ∃*𝑥⊤ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | extru 2008 | . . 3 ⊢ ∃𝑥⊤ | |
| 2 | neutru 36951 | . . 3 ⊢ ¬ ∃!𝑥⊤ | |
| 3 | jcn 163 | . . 3 ⊢ (∃𝑥⊤ → (¬ ∃!𝑥⊤ → ¬ (∃𝑥⊤ → ∃!𝑥⊤))) | |
| 4 | 1, 2, 3 | mp2 9 | . 2 ⊢ ¬ (∃𝑥⊤ → ∃!𝑥⊤) |
| 5 | moeu 2613 | . 2 ⊢ (∃*𝑥⊤ ↔ (∃𝑥⊤ → ∃!𝑥⊤)) | |
| 6 | 4, 5 | mtbir 326 | 1 ⊢ ¬ ∃*𝑥⊤ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ⊤wtru 1571 ∃wex 1812 ∃*wmo 2567 ∃!weu 2598 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-12 2216 ax-nul 5271 ax-pow 5338 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-mo 2569 df-eu 2599 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |