| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > met2ndc | Structured version Visualization version GIF version | ||
| Description: A metric space is second-countable iff it is separable (has a countable dense subset). (Contributed by Mario Carneiro, 13-Apr-2015.) |
| Ref | Expression |
|---|---|
| methaus.1 | ⊢ 𝐽 = (MetOpen‘𝐷) |
| Ref | Expression |
|---|---|
| met2ndc | ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . . 4 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | 1 | 2ndcsep 23647 | . . 3 ⊢ (𝐽 ∈ 2ndω → ∃𝑥 ∈ 𝒫 ∪ 𝐽(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = ∪ 𝐽)) |
| 3 | methaus.1 | . . . . . 6 ⊢ 𝐽 = (MetOpen‘𝐷) | |
| 4 | 3 | mopnuni 24629 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽) |
| 5 | 4 | pweqd 4581 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝒫 𝑋 = 𝒫 ∪ 𝐽) |
| 6 | 4 | eqeq2d 2776 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (((cls‘𝐽)‘𝑥) = 𝑋 ↔ ((cls‘𝐽)‘𝑥) = ∪ 𝐽)) |
| 7 | 6 | anbi2d 642 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋) ↔ (𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = ∪ 𝐽))) |
| 8 | 5, 7 | rexeqbidv 3341 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋) ↔ ∃𝑥 ∈ 𝒫 ∪ 𝐽(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = ∪ 𝐽))) |
| 9 | 2, 8 | imbitrrid 249 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐽 ∈ 2ndω → ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))) |
| 10 | elpwi 4571 | . . . 4 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋) | |
| 11 | 3 | met2ndci 24710 | . . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ⊆ 𝑋 ∧ 𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋)) → 𝐽 ∈ 2ndω) |
| 12 | 11 | 3exp2 1373 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑥 ⊆ 𝑋 → (𝑥 ≼ ω → (((cls‘𝐽)‘𝑥) = 𝑋 → 𝐽 ∈ 2ndω)))) |
| 13 | 12 | imp4a 428 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑥 ⊆ 𝑋 → ((𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋) → 𝐽 ∈ 2ndω))) |
| 14 | 10, 13 | syl5 35 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑥 ∈ 𝒫 𝑋 → ((𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋) → 𝐽 ∈ 2ndω))) |
| 15 | 14 | rexlimdv 3166 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋) → 𝐽 ∈ 2ndω)) |
| 16 | 9, 15 | impbid 215 | 1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ 𝒫 𝑋(𝑥 ≼ ω ∧ ((cls‘𝐽)‘𝑥) = 𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 ⊆ wss 3906 𝒫 cpw 4564 ∪ cuni 4874 class class class wbr 5111 ‘cfv 6540 ωcom 7864 ≼ cdom 8943 ∞Metcxmet 21537 MetOpencmopn 21542 clsccl 23205 2ndωc2ndc 23625 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-inf2 9613 ax-cc 10430 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-sup 9405 df-inf 9406 df-oi 9475 df-card 9937 df-acn 9940 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-n0 12516 df-z 12603 df-uz 12875 df-q 12985 df-rp 13029 df-xneg 13149 df-xadd 13150 df-xmul 13151 df-topgen 17514 df-psmet 21544 df-xmet 21545 df-bl 21547 df-mopn 21548 df-top 23081 df-topon 23098 df-bases 23133 df-cld 23206 df-ntr 23207 df-cls 23208 df-2ndc 23627 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |