![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > indistps | Structured version Visualization version GIF version |
Description: The indiscrete topology on a set 𝐴 expressed as a topological space, using implicit structure indices. The advantage of this version over indistpsx 21615 is that it is independent of the indices of the component definitions df-base 16481 and df-tset 16576, and if they are changed in the future, this theorem will not be affected. The advantage over indistps2 21617 is that it is easy to eliminate the hypotheses with eqid 2798 and vtoclg 3515 to result in a closed theorem. Theorems indistpsALT 21618 and indistps2ALT 21619 show that the two forms can be derived from each other. (Contributed by FL, 19-Jul-2006.) |
Ref | Expression |
---|---|
indistps.a | ⊢ 𝐴 ∈ V |
indistps.k | ⊢ 𝐾 = {〈(Base‘ndx), 𝐴〉, 〈(TopSet‘ndx), {∅, 𝐴}〉} |
Ref | Expression |
---|---|
indistps | ⊢ 𝐾 ∈ TopSp |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | indistps.k | . 2 ⊢ 𝐾 = {〈(Base‘ndx), 𝐴〉, 〈(TopSet‘ndx), {∅, 𝐴}〉} | |
2 | 0ex 5175 | . . . 4 ⊢ ∅ ∈ V | |
3 | indistps.a | . . . 4 ⊢ 𝐴 ∈ V | |
4 | 2, 3 | unipr 4817 | . . 3 ⊢ ∪ {∅, 𝐴} = (∅ ∪ 𝐴) |
5 | uncom 4080 | . . 3 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅) | |
6 | un0 4298 | . . 3 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
7 | 4, 5, 6 | 3eqtrri 2826 | . 2 ⊢ 𝐴 = ∪ {∅, 𝐴} |
8 | indistop 21607 | . 2 ⊢ {∅, 𝐴} ∈ Top | |
9 | 1, 7, 8 | eltpsi 21549 | 1 ⊢ 𝐾 ∈ TopSp |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∪ cun 3879 ∅c0 4243 {cpr 4527 〈cop 4531 ∪ cuni 4800 ‘cfv 6324 ndxcnx 16472 Basecbs 16475 TopSetcts 16563 TopSpctps 21537 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-tset 16576 df-rest 16688 df-topn 16689 df-top 21499 df-topon 21516 df-topsp 21538 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |