MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  metustel Structured version   Visualization version   GIF version

Theorem metustel 24874
Description: Define a filter base 𝐹 generated by a metric 𝐷. (Contributed by Thierry Arnoux, 22-Nov-2017.) (Revised by Thierry Arnoux, 11-Feb-2018.)
Hypothesis
Ref Expression
metust.1 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
Assertion
Ref Expression
metustel (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))
Distinct variable groups:   𝐵,𝑎   𝐷,𝑎   𝑋,𝑎
Allowed substitution hint:   𝐹(𝑎)

Proof of Theorem metustel
StepHypRef Expression
1 metust.1 . . 3 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
21eleq2i 2852 . 2 (𝐵 ∈ 𝐹 ↔ 𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))))
3 elex 3471 . . . 4 (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V)
43a1i 11 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V))
5 cnvexg 7936 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → ◡𝐷 ∈ V)
6 imaexg 7925 . . . . 5 (◡𝐷 ∈ V → (◡𝐷 “ (0[,)𝑎)) ∈ V)
7 eleq1a 2855 . . . . 5 ((◡𝐷 “ (0[,)𝑎)) ∈ V → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
85, 6, 73syl 19 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
98rexlimdvw 3168 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
10 eqid 2760 . . . . 5 (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
1110elrnmpt 5939 . . . 4 (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))
1211a1i 11 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ V → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎)))))
134, 9, 12pm5.21ndd 382 . 2 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))
142, 13bitrid 286 1 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑎))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ↦ cmpt 5185  ◡ccnv 5649  ran crn 5651   “ cima 5653  ‘cfv 6538  (class class class)co 7420  0cc0 11203  ℝ+crp 13123  [,)cico 13481  PsMetcpsmet 21667
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663
This theorem is used by:  metustto  24877  metustid  24878  metustexhalf  24880  metustfbas  24881  cfilucfil  24883  metucn  24895
  Copyright terms: Public domain W3C validator