| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > onnmin | Unicode version | ||
| Description: No member of a set of ordinal numbers belongs to its minimum. (Contributed by NM, 2-Feb-1997.) (Constructive proof by Mario Carneiro and Jim Kingdon, 21-Jul-2019.) |
| Ref | Expression |
|---|---|
| onnmin |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intss1 3914 |
. . 3
| |
| 2 | elirr 4607 |
. . . 4
| |
| 3 | ssel 3195 |
. . . 4
| |
| 4 | 2, 3 | mtoi 666 |
. . 3
|
| 5 | 1, 4 | syl 14 |
. 2
|
| 6 | 5 | adantl 277 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 ax-setind 4603 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-v 2778 df-dif 3176 df-in 3180 df-ss 3187 df-sn 3649 df-int 3900 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |