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 21618 is that it is independent of the indices of the component definitions df-base 16489 and df-tset 16584, and if they are changed in the future, this theorem will not be affected. The advantage over indistps2 21620 is that it is easy to eliminate the hypotheses with eqid 2821 and vtoclg 3567 to result in a closed theorem. Theorems indistpsALT 21621 and indistps2ALT 21622 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 5211 | . . . 4 ⊢ ∅ ∈ V | |
3 | indistps.a | . . . 4 ⊢ 𝐴 ∈ V | |
4 | 2, 3 | unipr 4855 | . . 3 ⊢ ∪ {∅, 𝐴} = (∅ ∪ 𝐴) |
5 | uncom 4129 | . . 3 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅) | |
6 | un0 4344 | . . 3 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
7 | 4, 5, 6 | 3eqtrri 2849 | . 2 ⊢ 𝐴 = ∪ {∅, 𝐴} |
8 | indistop 21610 | . 2 ⊢ {∅, 𝐴} ∈ Top | |
9 | 1, 7, 8 | eltpsi 21552 | 1 ⊢ 𝐾 ∈ TopSp |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 Vcvv 3494 ∪ cun 3934 ∅c0 4291 {cpr 4569 〈cop 4573 ∪ cuni 4838 ‘cfv 6355 ndxcnx 16480 Basecbs 16483 TopSetcts 16571 TopSpctps 21540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-uz 12245 df-fz 12894 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-tset 16584 df-rest 16696 df-topn 16697 df-top 21502 df-topon 21519 df-topsp 21541 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |