| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elutop | Structured version Visualization version GIF version | ||
| Description: Open sets in the topology induced by an uniform structure 𝑈 on 𝑋 (Contributed by Thierry Arnoux, 30-Nov-2017.) |
| Ref | Expression |
|---|---|
| elutop | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | utopval 24193 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎}) | |
| 2 | 1 | eleq2d 2823 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ 𝐴 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎})) |
| 3 | sseq2 3962 | . . . . . 6 ⊢ (𝑎 = 𝐴 → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ (𝑣 “ {𝑥}) ⊆ 𝐴)) | |
| 4 | 3 | rexbidv 3162 | . . . . 5 ⊢ (𝑎 = 𝐴 → (∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 5 | 4 | raleqbi1dv 3310 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 6 | 5 | elrab 3648 | . . 3 ⊢ (𝐴 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 7 | 2, 6 | bitrdi 287 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴))) |
| 8 | elex 3463 | . . . . 5 ⊢ (𝐴 ∈ 𝒫 𝑋 → 𝐴 ∈ V) | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ 𝒫 𝑋 → 𝐴 ∈ V)) |
| 10 | elfvex 6879 | . . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V) | |
| 11 | 10 | adantr 480 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ V) |
| 12 | simpr 484 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋) | |
| 13 | 11, 12 | ssexd 5273 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V) |
| 14 | 13 | ex 412 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ⊆ 𝑋 → 𝐴 ∈ V)) |
| 15 | elpwg 4559 | . . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋))) |
| 17 | 9, 14, 16 | pm5.21ndd 379 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) |
| 18 | 17 | anbi1d 632 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ((𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴))) |
| 19 | 7, 18 | bitrd 279 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 {crab 3401 Vcvv 3442 ⊆ wss 3903 𝒫 cpw 4556 {csn 4582 “ cima 5637 ‘cfv 6502 UnifOncust 24161 unifTopcutop 24191 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-iota 6458 df-fun 6504 df-fv 6510 df-ust 24162 df-utop 24192 |
| This theorem is referenced by: utoptop 24195 utopbas 24196 restutop 24198 restutopopn 24199 ucncn 24245 |
| Copyright terms: Public domain | W3C validator |