| Mathbox for Anthony Hart |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mofal | Structured version Visualization version GIF version | ||
| Description: There exist at most one set such that ⊥ is true. (Contributed by Anthony Hart, 13-Sep-2011.) |
| Ref | Expression |
|---|---|
| mofal | ⊢ ∃*𝑥⊥ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nexfal 37317 | . 2 ⊢ ¬ ∃𝑥⊥ | |
| 2 | exmo 2567 | . 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥) | |
| 3 | 1, 2 | mtpor 1802 | 1 ⊢ ∃*𝑥⊥ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊥wfal 1581 ∃wex 1811 ∃*wmo 2562 |
| 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 1942 ax-6 1999 ax-7 2040 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-fal 1582 df-ex 1812 df-mo 2564 |
| This theorem is used by: nrmo 37322 amosym1 37338 |
| Copyright terms: Public domain | W3C validator |