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

Theorem metustel 24782
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 2854 . 2 (𝐵𝐹𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑎))))
3 elex 3474 . . . 4 (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V)
43a1i 11 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ ran (𝑎 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑎))) → 𝐵 ∈ V))
5 cnvexg 7925 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝐷 ∈ V)
6 imaexg 7914 . . . . 5 (𝐷 ∈ V → (𝐷 “ (0[,)𝑎)) ∈ V)
7 eleq1a 2857 . . . . 5 ((𝐷 “ (0[,)𝑎)) ∈ V → (𝐵 = (𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
85, 6, 73syl 19 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → (𝐵 = (𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
98rexlimdvw 3170 . . 3 (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ+ 𝐵 = (𝐷 “ (0[,)𝑎)) → 𝐵 ∈ V))
10 eqid 2762 . . . . 5 (𝑎 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑎))) = (𝑎 ∈ ℝ+ ↦ (𝐷 “ (0[,)𝑎)))
1110elrnmpt 5946 . . . 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 1570  wcel 2145  wrex 3088  Vcvv 3453  cmpt 5190  ccnv 5658  ran crn 5660  cima 5662  cfv 6537  (class class class)co 7417  0cc0 11128  +crp 13046  [,)cico 13404  PsMetcpsmet 21575
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 2215  ax-ext 2734  ax-sep 5255  ax-pow 5334  ax-pr 5402  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-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672
This theorem is used by:  metustto  24785  metustid  24786  metustexhalf  24788  metustfbas  24789  cfilucfil  24791  metucn  24803
  Copyright terms: Public domain W3C validator