| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > metustel | Structured version Visualization version GIF version | ||
| Description: Define a filter base 𝐹 generated by a metric 𝐷. (Contributed by Thierry Arnoux, 22-Nov-2017.) (Revised by Thierry Arnoux, 11-Feb-2018.) |
| Ref | Expression |
|---|---|
| metust.1 | ⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) |
| Ref | Expression |
|---|---|
| metustel | ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | metust.1 | . . 3 ⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) | |
| 2 | 1 | eleq2i 2821 | . 2 ⊢ (𝐵 ∈ 𝐹 ↔ 𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))) |
| 3 | elex 3471 | . . . 4 ⊢ (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V) | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V)) |
| 5 | cnvexg 7903 | . . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V) | |
| 6 | imaexg 7892 | . . . . 5 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑎)) ∈ V) | |
| 7 | eleq1a 2824 | . . . . 5 ⊢ ((◡𝐷 “ (0[,)𝑎)) ∈ V → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) | |
| 8 | 5, 6, 7 | 3syl 18 | . . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 9 | 8 | rexlimdvw 3140 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 10 | eqid 2730 | . . . . 5 ⊢ (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) | |
| 11 | 10 | elrnmpt 5925 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| 12 | 11 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))) |
| 13 | 4, 9, 12 | pm5.21ndd 379 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| 14 | 2, 13 | bitrid 283 | 1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∃wrex 3054 Vcvv 3450 ↦ cmpt 5191 ◡ccnv 5640 ran crn 5642 “ cima 5644 ‘cfv 6514 (class class class)co 7390 0cc0 11075 ℝ+crp 12958 [,)cico 13315 PsMetcpsmet 21255 |
| 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 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| 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 2879 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-xp 5647 df-rel 5648 df-cnv 5649 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 |
| This theorem is referenced by: metustto 24448 metustid 24449 metustexhalf 24451 metustfbas 24452 cfilucfil 24454 metucn 24466 |
| Copyright terms: Public domain | W3C validator |