![]() |
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 9170 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∈ wcel 2108 ≠ wne 2946 Vcvv 3488 ∅c0 4352 class class class wbr 5166 ≺ csdm 9002 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-en 9004 df-dom 9005 df-sdom 9006 |
This theorem is referenced by: 1sdom2 9303 sdom1 9305 sdom1OLD 9306 marypha1lem 9502 konigthlem 10637 pwcfsdom 10652 cfpwsdom 10653 rankcf 10846 r1tskina 10851 1stcfb 23474 snct 32727 sigapildsys 34126 |
Copyright terms: Public domain | W3C validator |