| 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 2853 | . 2 ⊢ (𝐵 ∈ 𝐹 ↔ 𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))) |
| 3 | elex 3472 | . . . 4 ⊢ (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V) | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V)) |
| 5 | cnvexg 7925 | . . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V) | |
| 6 | imaexg 7914 | . . . . 5 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑎)) ∈ V) | |
| 7 | eleq1a 2856 | . . . . 5 ⊢ ((◡𝐷 “ (0[,)𝑎)) ∈ V → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) | |
| 8 | 5, 6, 7 | 3syl 19 | . . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 9 | 8 | rexlimdvw 3169 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 10 | eqid 2761 | . . . . 5 ⊢ (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) | |
| 11 | 10 | elrnmpt 5940 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| 12 | 11 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))) |
| 13 | 4, 9, 12 | pm5.21ndd 382 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| 14 | 2, 13 | bitrid 286 | 1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 Vcvv 3451 ↦ cmpt 5186 ◡ccnv 5650 ran crn 5652 “ cima 5654 ‘cfv 6531 (class class class)co 7412 0cc0 11181 ℝ+crp 13101 [,)cico 13459 PsMetcpsmet 21642 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-xp 5657 df-rel 5658 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 |
| This theorem is used by: metustto 24852 metustid 24853 metustexhalf 24855 metustfbas 24856 cfilucfil 24858 metucn 24870 |
| Copyright terms: Public domain | W3C validator |