| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > distop | Unicode version | ||
| Description: The discrete topology on
a set |
| Ref | Expression |
|---|---|
| distop |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniss 3954 |
. . . . . 6
| |
| 2 | unipw 4355 |
. . . . . 6
| |
| 3 | 1, 2 | sseqtrdi 3296 |
. . . . 5
|
| 4 | vuniex 4582 |
. . . . . 6
| |
| 5 | 4 | elpw 3694 |
. . . . 5
|
| 6 | 3, 5 | sylibr 134 |
. . . 4
|
| 7 | 6 | ax-gen 1502 |
. . 3
|
| 8 | 7 | a1i 9 |
. 2
|
| 9 | velpw 3695 |
. . . . . 6
| |
| 10 | velpw 3695 |
. . . . . . . 8
| |
| 11 | ssinss1 3460 |
. . . . . . . . . 10
| |
| 12 | 11 | a1i 9 |
. . . . . . . . 9
|
| 13 | vex 2824 |
. . . . . . . . . . 11
| |
| 14 | 13 | inex2 4266 |
. . . . . . . . . 10
|
| 15 | 14 | elpw 3694 |
. . . . . . . . 9
|
| 16 | 12, 15 | imbitrrdi 162 |
. . . . . . . 8
|
| 17 | 10, 16 | sylbi 121 |
. . . . . . 7
|
| 18 | 17 | com12 30 |
. . . . . 6
|
| 19 | 9, 18 | sylbi 121 |
. . . . 5
|
| 20 | 19 | ralrimiv 2622 |
. . . 4
|
| 21 | 20 | rgen 2603 |
. . 3
|
| 22 | 21 | a1i 9 |
. 2
|
| 23 | pwexg 4315 |
. . 3
| |
| 24 | istopg 15026 |
. . 3
| |
| 25 | 23, 24 | syl 14 |
. 2
|
| 26 | 8, 22, 25 | mpbir2and 957 |
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-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-un 4576 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-uni 3934 df-top 15025 |
| This theorem is referenced by: topnex 15113 distopon 15114 distps 15118 discld 15163 restdis 15211 txdis 15304 |
| Copyright terms: Public domain | W3C validator |