| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A set dominates its subsets. Theorem 16 of [Suppes] p. 94. |
| Ref | Expression |
|---|---|
| ssdom2g |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssexg 3457 |
. . 3
| |
| 2 | 1 | expcom 403 |
. 2
|
| 3 | ssdomg 5467 |
. 2
| |
| 4 | 2, 3 | syli 65 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: undom 5497 pwuninel 5550 2pwuninel 5551 limenpsi 5599 php 5607 php2 5608 php3 5609 onomeneq 5612 0sdom1dom 5618 brdom3 5963 brdom5 5964 brdom4 5965 imadomg 5968 cardsdomel 6004 xpnnen 8768 ruc 8818 infdif 8837 infdif2 8838 alephadd 8851 alephmul 8852 alephexp1 8853 alephsuc3 8854 alephexp2 8855 cctop 8922 sndw 14428 intrtael 15256 carinttar 15279 abrexdom 15739 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-13 1311 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-rep 3428 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 ax-un 3790 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-3an 860 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-rex 2110 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-op 3053 df-uni 3178 df-br 3339 df-opab 3396 df-id 3586 df-xp 4000 df-rel 4001 df-cnv 4002 df-co 4003 df-dm 4004 df-rn 4005 df-res 4006 df-ima 4007 df-fun 4008 df-fn 4009 df-f 4010 df-f1 4011 df-fo 4012 df-f1o 4013 df-en 5427 df-dom 5428 |