| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Any set dominates the empty set. |
| Ref | Expression |
|---|---|
| 0dom |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 2726 |
. 2
| |
| 2 | 0ss 2313 |
. 2
| |
| 3 | ssdomg 4426 |
. 2
| |
| 4 | 1, 2, 3 | mp2 43 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: dom0 4484 0sdomg 4485 sdom0 4487 mapdom2 4514 fodomfi 4581 infxpdom 7604 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 966 ax-gen 967 ax-8 968 ax-9 969 ax-10 970 ax-11 971 ax-12 972 ax-13 973 ax-14 974 ax-17 975 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1127 ax-10o 1144 ax-16 1214 ax-11o 1222 ax-ext 1464 ax-rep 2708 ax-sep 2718 ax-nul 2725 ax-pow 2758 ax-pr 2795 ax-un 2882 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 985 df-sb 1176 df-eu 1386 df-mo 1387 df-clab 1470 df-cleq 1475 df-clel 1478 df-ne 1594 df-rex 1657 df-v 1819 df-dif 2060 df-un 2061 df-in 2062 df-ss 2064 df-nul 2292 df-pw 2414 df-sn 2424 df-pr 2425 df-op 2428 df-uni 2518 df-br 2635 df-opab 2682 df-id 2851 df-xp 3200 df-rel 3201 df-cnv 3202 df-co 3203 df-dm 3204 df-rn 3205 df-res 3206 df-ima 3207 df-fun 3208 df-fn 3209 df-f 3210 df-f1 3211 df-fo 3212 df-f1o 3213 df-en 4386 df-dom 4387 |