| 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 9137 | . 2 ⊢ (𝐴 ∈ V → ∅ ≼ 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∅ ≼ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2146 Vcvv 3454 ∅c0 4281 class class class wbr 5106 ≼ cdom 8985 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 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 4839 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-dom 8989 |
| This theorem is used by: domunsn 9160 mapdom1 9175 mapdom2 9181 fodomfi 9318 marypha1lem 9438 card2inf 9562 iunfictbso 10206 konigthlem 10666 cctop 23339 ovol0 25829 fvconstdomi 50148 |
| Copyright terms: Public domain | W3C validator |