|   | 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 36407 | . 2 ⊢ ¬ ∃𝑥⊥ | |
| 2 | exmo 2541 | . 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥) | |
| 3 | 1, 2 | mtpor 1769 | 1 ⊢ ∃*𝑥⊥ | 
| Colors of variables: wff setvar class | 
| Syntax hints: ⊥wfal 1551 ∃wex 1778 ∃*wmo 2537 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 | 
| This theorem depends on definitions: df-bi 207 df-or 848 df-tru 1542 df-fal 1552 df-ex 1779 df-mo 2539 | 
| This theorem is referenced by: nrmo 36412 amosym1 36428 | 
| Copyright terms: Public domain | W3C validator |