| 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 9099 | . 2 ⊢ (𝐴 ∈ V → ∅ ≼ 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∅ ≼ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2146 Vcvv 3457 ∅c0 4286 class class class wbr 5111 ≼ cdom 8947 |
| 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 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-dom 8951 |
| This theorem is used by: domunsn 9122 mapdom1 9137 mapdom2 9143 fodomfi 9279 marypha1lem 9400 card2inf 9524 iunfictbso 10114 konigthlem 10572 cctop 23217 ovol0 25707 fvconstdomi 49746 |
| Copyright terms: Public domain | W3C validator |