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 8689 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∈ wcel 2113 ≠ wne 2934 Vcvv 3397 ∅c0 4209 class class class wbr 5027 ≺ csdm 8547 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2161 ax-12 2178 ax-ext 2710 ax-sep 5164 ax-nul 5171 ax-pow 5229 ax-pr 5293 ax-un 7473 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-ral 3058 df-rex 3059 df-rab 3062 df-v 3399 df-dif 3844 df-un 3846 df-in 3848 df-ss 3858 df-nul 4210 df-if 4412 df-pw 4487 df-sn 4514 df-pr 4516 df-op 4520 df-uni 4794 df-br 5028 df-opab 5090 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-fun 6335 df-fn 6336 df-f 6337 df-f1 6338 df-fo 6339 df-f1o 6340 df-er 8313 df-en 8549 df-dom 8550 df-sdom 8551 |
This theorem is referenced by: sdom1 8790 marypha1lem 8963 konigthlem 10061 pwcfsdom 10076 cfpwsdom 10077 rankcf 10270 r1tskina 10275 1stcfb 22189 snct 30615 sigapildsys 31692 |
Copyright terms: Public domain | W3C validator |