| 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 2858 | . 2 ⊢ (𝐵 ∈ 𝐹 ↔ 𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))) |
| 3 | elex 3479 | . . . 4 ⊢ (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V) | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V)) |
| 5 | cnvexg 7930 | . . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V) | |
| 6 | imaexg 7919 | . . . . 5 ⊢ (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑎)) ∈ V) | |
| 7 | eleq1a 2861 | . . . . 5 ⊢ ((◡𝐷 “ (0[,)𝑎)) ∈ V → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) | |
| 8 | 5, 6, 7 | 3syl 19 | . . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 9 | 8 | rexlimdvw 3174 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V)) |
| 10 | eqid 2766 | . . . . 5 ⊢ (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) | |
| 11 | 10 | elrnmpt 5953 | . . . 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 2146 ∃wrex 3092 Vcvv 3458 ↦ cmpt 5197 ◡ccnv 5665 ran crn 5667 “ cima 5669 ‘cfv 6543 (class class class)co 7423 0cc0 11118 ℝ+crp 13034 [,)cico 13392 PsMetcpsmet 21543 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-xp 5672 df-rel 5673 df-cnv 5674 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 |
| This theorem is used by: metustto 24747 metustid 24748 metustexhalf 24750 metustfbas 24751 cfilucfil 24753 metucn 24765 |
| Copyright terms: Public domain | W3C validator |