| 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 24126 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎}) | |
| 2 | 1 | eleq2d 2815 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ 𝐴 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎})) |
| 3 | sseq2 3981 | . . . . . 6 ⊢ (𝑎 = 𝐴 → ((𝑣 “ {𝑥}) ⊆ 𝑎 ↔ (𝑣 “ {𝑥}) ⊆ 𝐴)) | |
| 4 | 3 | rexbidv 3159 | . . . . 5 ⊢ (𝑎 = 𝐴 → (∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 5 | 4 | raleqbi1dv 3314 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎 ↔ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 6 | 5 | elrab 3667 | . . 3 ⊢ (𝐴 ∈ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑎 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑎} ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴)) |
| 7 | 2, 6 | bitrdi 287 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝐴))) |
| 8 | elex 3476 | . . . . 5 ⊢ (𝐴 ∈ 𝒫 𝑋 → 𝐴 ∈ V) | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ 𝒫 𝑋 → 𝐴 ∈ V)) |
| 10 | elfvex 6903 | . . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V) | |
| 11 | 10 | adantr 480 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ V) |
| 12 | simpr 484 | . . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋) | |
| 13 | 11, 12 | ssexd 5287 | . . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V) |
| 14 | 13 | ex 412 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ⊆ 𝑋 → 𝐴 ∈ V)) |
| 15 | elpwg 4574 | . . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) | |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋))) |
| 17 | 9, 14, 16 | pm5.21ndd 379 | . . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) |
| 18 | 17 | anbi1d 631 | . 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 1540 ∈ wcel 2109 ∀wral 3046 ∃wrex 3055 {crab 3411 Vcvv 3455 ⊆ wss 3922 𝒫 cpw 4571 {csn 4597 “ cima 5649 ‘cfv 6519 UnifOncust 24093 unifTopcutop 24124 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5259 ax-nul 5269 ax-pow 5328 ax-pr 5395 ax-un 7718 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2880 df-ne 2928 df-ral 3047 df-rex 3056 df-rab 3412 df-v 3457 df-sbc 3762 df-csb 3871 df-dif 3925 df-un 3927 df-in 3929 df-ss 3939 df-nul 4305 df-if 4497 df-pw 4573 df-sn 4598 df-pr 4600 df-op 4604 df-uni 4880 df-br 5116 df-opab 5178 df-mpt 5197 df-id 5541 df-xp 5652 df-rel 5653 df-cnv 5654 df-co 5655 df-dm 5656 df-rn 5657 df-res 5658 df-iota 6472 df-fun 6521 df-fv 6527 df-ust 24094 df-utop 24125 |
| This theorem is referenced by: utoptop 24128 utopbas 24129 restutop 24131 restutopopn 24132 ucncn 24178 |
| Copyright terms: Public domain | W3C validator |