| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: No member of a set of ordinal numbers belongs to its minimum. |
| Ref | Expression |
|---|---|
| onnmin |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intss1 2602 |
. . 3
| |
| 2 | 1 | adantl 397 |
. 2
|
| 3 | ontri1 3038 |
. . 3
| |
| 4 | oninton 3069 |
. . . 4
| |
| 5 | ne0i 2337 |
. . . 4
| |
| 6 | 4, 5 | sylan2 462 |
. . 3
|
| 7 | ssel2 2115 |
. . 3
| |
| 8 | 3, 6, 7 | sylanc 482 |
. 2
|
| 9 | 2, 8 | mpbid 202 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: onnminsb 3073 oneqmin 3075 onminex 3077 onmindif2 3118 cardmin 4925 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1003 ax-gen 1004 ax-8 1005 ax-10 1007 ax-11 1008 ax-12 1009 ax-13 1010 ax-14 1011 ax-17 1012 ax-4 1014 ax-5o 1016 ax-6o 1019 ax-9o 1164 ax-10o 1182 ax-16 1252 ax-11o 1260 ax-ext 1504 ax-sep 2758 ax-pow 2798 ax-pr 2835 ax-un 2922 |
| This theorem depends on definitions: df-bi 154 df-or 231 df-an 232 df-3or 788 df-3an 789 df-ex 1022 df-sb 1214 df-eu 1424 df-mo 1425 df-clab 1510 df-cleq 1515 df-clel 1518 df-ne 1634 df-ral 1696 df-rex 1697 df-v 1859 df-dif 2100 df-un 2101 df-in 2102 df-ss 2104 df-nul 2332 df-pw 2454 df-sn 2464 df-pr 2465 df-tp 2467 df-op 2468 df-uni 2558 df-int 2588 df-br 2675 df-opab 2722 df-tr 2736 df-eprel 2888 df-po 2896 df-so 2906 df-fr 2974 df-we 2991 df-ord 3008 df-on 3009 |