![]() |
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 9055 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∈ wcel 2106 ≠ wne 2939 Vcvv 3446 ∅c0 4287 class class class wbr 5110 ≺ csdm 8889 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5173 df-id 5536 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-en 8891 df-dom 8892 df-sdom 8893 |
This theorem is referenced by: 1sdom2 9191 sdom1 9193 sdom1OLD 9194 marypha1lem 9378 konigthlem 10513 pwcfsdom 10528 cfpwsdom 10529 rankcf 10722 r1tskina 10727 1stcfb 22833 snct 31698 sigapildsys 32850 |
Copyright terms: Public domain | W3C validator |