| 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 9161 | . 2 ⊢ (𝐴 ∈ V → ∅ ≼ 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∅ ≼ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2147 Vcvv 3454 ∅c0 4281 class class class wbr 5108 ≼ cdom 9009 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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 2102 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-dom 9013 |
| This theorem is used by: domunsn 9184 mapdom1 9199 mapdom2 9205 fodomfi 9342 marypha1lem 9462 card2inf 9586 iunfictbso 10232 konigthlem 10692 cctop 23379 ovol0 25869 fvconstdomi 50398 |
| Copyright terms: Public domain | W3C validator |