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 34594 | . 2 ⊢ ¬ ∃𝑥⊥ | |
2 | exmo 2542 | . 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥) | |
3 | 1, 2 | mtpor 1773 | 1 ⊢ ∃*𝑥⊥ |
Colors of variables: wff setvar class |
Syntax hints: ⊥wfal 1551 ∃wex 1782 ∃*wmo 2538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 |
This theorem depends on definitions: df-bi 206 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-mo 2540 |
This theorem is referenced by: nrmo 34599 amosym1 34615 |
Copyright terms: Public domain | W3C validator |