| 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 9104 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2146 ≠ wne 2961 Vcvv 3458 ∅c0 4289 class class class wbr 5114 ≺ csdm 8951 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2570 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-en 8953 df-dom 8954 df-sdom 8955 |
| This theorem is used by: 1sdom2 9218 sdom1 9220 marypha1lem 9403 konigthlem 10571 pwcfsdom 10586 cfpwsdom 10587 rankcf 10780 r1tskina 10785 1stcfb 23632 snct 33087 sigapildsys 34576 modelaxreplem1 45720 |
| Copyright terms: Public domain | W3C validator |