| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0sdom | Structured version Visualization version GIF version | ||
| Description: A set strictly dominates the empty set iff it is not empty. (Contributed by NM, 29-Jul-2004.) |
| Ref | Expression |
|---|---|
| 0sdom.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| 0sdom | ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0sdom.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | 0sdomg 9090 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∈ wcel 2149 ≠ wne 2964 Vcvv 3463 ∅c0 4294 class class class wbr 5110 ≺ csdm 8938 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-mo 2573 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5175 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-en 8940 df-dom 8941 df-sdom 8942 |
| This theorem is referenced by: 1sdom2 9204 sdom1 9206 marypha1lem 9389 konigthlem 10549 pwcfsdom 10564 cfpwsdom 10565 rankcf 10758 r1tskina 10763 1stcfb 23567 snct 32994 sigapildsys 34493 modelaxreplem1 45574 |
| Copyright terms: Public domain | W3C validator |