| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > reg2exmid | Unicode version | ||
| Description: If any inhabited set has
a minimal element (when expressed by |
| Ref | Expression |
|---|---|
| reg2exmid.1 |
|
| Ref | Expression |
|---|---|
| reg2exmid |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2230 |
. . . 4
| |
| 2 | 1 | regexmidlemm 4632 |
. . 3
|
| 3 | reg2exmid.1 |
. . . 4
| |
| 4 | pp0ex 4281 |
. . . . . 6
| |
| 5 | 4 | rabex 4235 |
. . . . 5
|
| 6 | eleq2 2294 |
. . . . . . 7
| |
| 7 | 6 | exbidv 1872 |
. . . . . 6
|
| 8 | raleq 2729 |
. . . . . . 7
| |
| 9 | 8 | rexeqbi1dv 2742 |
. . . . . 6
|
| 10 | 7, 9 | imbi12d 234 |
. . . . 5
|
| 11 | 5, 10 | spcv 2899 |
. . . 4
|
| 12 | 3, 11 | ax-mp 5 |
. . 3
|
| 13 | 2, 12 | ax-mp 5 |
. 2
|
| 14 | 1 | reg2exmidlema 4634 |
. 2
|
| 15 | 13, 14 | ax-mp 5 |
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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-nul 4216 ax-pow 4266 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1810 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-rab 2518 df-v 2803 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-pw 3655 df-sn 3676 df-pr 3677 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |