| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Ordinal 1 is strictly dominated by ordinal 2. |
| Ref | Expression |
|---|---|
| 1sdom2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | p0ex 2828 |
. . 3
| |
| 2 | 1 | canth2 4629 |
. 2
|
| 3 | df1o2 4276 |
. 2
| |
| 4 | df2o2 4277 |
. . 3
| |
| 5 | pwpw0 2533 |
. . 3
| |
| 6 | 4, 5 | eqtr4i 1541 |
. 2
|
| 7 | 2, 3, 6 | 3brtr4i 2716 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: pm54.43 4715 unpde2eg22 10826 top2ind 11050 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 998 ax-gen 999 ax-8 1000 ax-9 1001 ax-10 1002 ax-11 1003 ax-12 1004 ax-13 1005 ax-14 1006 ax-17 1007 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-10o 1177 ax-16 1247 ax-11o 1255 ax-ext 1500 ax-rep 2767 ax-sep 2777 ax-pow 2818 ax-pr 2855 ax-un 3089 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-ex 1017 df-sb 1209 df-eu 1421 df-mo 1422 df-clab 1506 df-cleq 1511 df-clel 1514 df-ne 1630 df-ral 1695 df-rex 1696 df-rab 1698 df-v 1858 df-dif 2101 df-un 2102 df-in 2103 df-ss 2105 df-nul 2333 df-pw 2459 df-sn 2470 df-pr 2471 df-op 2474 df-uni 2570 df-br 2693 df-opab 2741 df-id 2913 df-suc 2981 df-xp 3265 df-rel 3266 df-cnv 3267 df-co 3268 df-dm 3269 df-rn 3270 df-res 3271 df-ima 3272 df-fun 3273 df-fn 3274 df-f 3275 df-f1 3276 df-fo 3277 df-f1o 3278 df-fv 3279 df-1o 4269 df-2o 4270 df-en 4509 df-dom 4510 df-sdom 4511 |