Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0dom | Structured version Visualization version GIF version |
Description: Any set dominates the empty set. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
0sdom.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
0dom | ⊢ ∅ ≼ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0sdom.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | 0domg 8680 | . 2 ⊢ (𝐴 ∈ V → ∅ ≼ 𝐴) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ∅ ≼ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2112 Vcvv 3410 ∅c0 4228 class class class wbr 5037 ≼ cdom 8539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5174 ax-nul 5181 ax-pow 5239 ax-pr 5303 ax-un 7466 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ral 3076 df-rex 3077 df-rab 3080 df-v 3412 df-dif 3864 df-un 3866 df-in 3868 df-ss 3878 df-nul 4229 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-op 4533 df-uni 4803 df-br 5038 df-opab 5100 df-id 5435 df-xp 5535 df-rel 5536 df-cnv 5537 df-co 5538 df-dm 5539 df-rn 5540 df-res 5541 df-ima 5542 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-dom 8543 |
This theorem is referenced by: domunsn 8703 mapdom1 8718 mapdom2 8724 fodomfi 8844 marypha1lem 8944 card2inf 9066 iunfictbso 9588 konigthlem 10042 cctop 21721 ovol0 24208 |
Copyright terms: Public domain | W3C validator |