| 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 36447 | . 2 ⊢ ¬ ∃𝑥⊥ | |
| 2 | exmo 2537 | . 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥) | |
| 3 | 1, 2 | mtpor 1771 | 1 ⊢ ∃*𝑥⊥ |
| Colors of variables: wff setvar class |
| Syntax hints: ⊥wfal 1553 ∃wex 1780 ∃*wmo 2533 |
| 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 |
| This theorem depends on definitions: df-bi 207 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-mo 2535 |
| This theorem is referenced by: nrmo 36452 amosym1 36468 |
| Copyright terms: Public domain | W3C validator |