![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > is2ndc | Structured version Visualization version GIF version |
Description: The property of being second-countable. (Contributed by Jeff Hankins, 17-Jan-2010.) (Revised by Mario Carneiro, 21-Mar-2015.) |
Ref | Expression |
---|---|
is2ndc | ⊢ (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-2ndc 23469 | . . 3 ⊢ 2ndω = {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)} | |
2 | 1 | eleq2i 2836 | . 2 ⊢ (𝐽 ∈ 2ndω ↔ 𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)}) |
3 | simpr 484 | . . . . 5 ⊢ ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → (topGen‘𝑥) = 𝐽) | |
4 | fvex 6933 | . . . . 5 ⊢ (topGen‘𝑥) ∈ V | |
5 | 3, 4 | eqeltrrdi 2853 | . . . 4 ⊢ ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V) |
6 | 5 | rexlimivw 3157 | . . 3 ⊢ (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽) → 𝐽 ∈ V) |
7 | eqeq2 2752 | . . . . 5 ⊢ (𝑗 = 𝐽 → ((topGen‘𝑥) = 𝑗 ↔ (topGen‘𝑥) = 𝐽)) | |
8 | 7 | anbi2d 629 | . . . 4 ⊢ (𝑗 = 𝐽 → ((𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))) |
9 | 8 | rexbidv 3185 | . . 3 ⊢ (𝑗 = 𝐽 → (∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗) ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽))) |
10 | 6, 9 | elab3 3702 | . 2 ⊢ (𝐽 ∈ {𝑗 ∣ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝑗)} ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) |
11 | 2, 10 | bitri 275 | 1 ⊢ (𝐽 ∈ 2ndω ↔ ∃𝑥 ∈ TopBases (𝑥 ≼ ω ∧ (topGen‘𝑥) = 𝐽)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 {cab 2717 ∃wrex 3076 Vcvv 3488 class class class wbr 5166 ‘cfv 6573 ωcom 7903 ≼ cdom 9001 topGenctg 17497 TopBasesctb 22973 2ndωc2ndc 23467 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-nul 5324 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-rex 3077 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-sn 4649 df-pr 4651 df-uni 4932 df-iota 6525 df-fv 6581 df-2ndc 23469 |
This theorem is referenced by: 2ndctop 23476 2ndci 23477 2ndcsb 23478 2ndcredom 23479 2ndc1stc 23480 2ndcrest 23483 2ndcctbss 23484 2ndcdisj 23485 2ndcomap 23487 2ndcsep 23488 dis2ndc 23489 tx2ndc 23680 |
Copyright terms: Public domain | W3C validator |