| 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 2143 ≠ wne 2958 Vcvv 3455 ∅c0 4286 class class class wbr 5109 ≺ csdm 8938 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-en 8940 df-dom 8941 df-sdom 8942 |
| This theorem is referenced by: 1sdom2 9204 sdom1 9206 marypha1lem 9389 konigthlem 10548 pwcfsdom 10563 cfpwsdom 10564 rankcf 10757 r1tskina 10762 1stcfb 23602 snct 33057 sigapildsys 34552 modelaxreplem1 45687 |
| Copyright terms: Public domain | W3C validator |