ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unirnblps GIF version

Theorem unirnblps 15648
Description: The union of the set of balls of a metric space is its base set. (Contributed by NM, 12-Sep-2006.) (Revised by Mario Carneiro, 12-Nov-2013.) (Revised by Thierry Arnoux, 11-Mar-2018.)
Assertion
Ref Expression
unirnblps (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)

Proof of Theorem unirnblps
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 blfps 15635 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋)
21frnd 5546 . . 3 (𝐷 ∈ (PsMet‘𝑋) → ran (ball‘𝐷) ⊆ 𝒫 𝑋)
3 sspwuni 4097 . . 3 (ran (ball‘𝐷) ⊆ 𝒫 𝑋 ↔ ∪ ran (ball‘𝐷) ⊆ 𝑋)
42, 3sylib 122 . 2 (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) ⊆ 𝑋)
5 1rp 10075 . . . 4 1 ∈ ℝ+
6 blcntrps 15641 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 1 ∈ ℝ+) → 𝑥 ∈ (𝑥(ball‘𝐷)1))
75, 6mp3an3 1367 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ (𝑥(ball‘𝐷)1))
8 rpxr 10079 . . . . 5 (1 ∈ ℝ+ → 1 ∈ ℝ*)
95, 8ax-mp 5 . . . 4 1 ∈ ℝ*
10 blelrnps 15645 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 1 ∈ ℝ*) → (𝑥(ball‘𝐷)1) ∈ ran (ball‘𝐷))
119, 10mp3an3 1367 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → (𝑥(ball‘𝐷)1) ∈ ran (ball‘𝐷))
12 elunii 3940 . . 3 ((𝑥 ∈ (𝑥(ball‘𝐷)1) ∧ (𝑥(ball‘𝐷)1) ∈ ran (ball‘𝐷)) → 𝑥 ∈ ∪ ran (ball‘𝐷))
137, 11, 12syl2anc 415 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ∪ ran (ball‘𝐷))
144, 13eqelssd 3267 1 (𝐷 ∈ (PsMet‘𝑋) → ∪ ran (ball‘𝐷) = 𝑋)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   ⊆ wss 3220  𝒫 cpw 3688  ∪ cuni 3935   × cxp 4774  ran crn 4777  ‘cfv 5380  (class class class)co 6088  1c1 8186  ℝ*cxr 8365  ℝ+crp 10071  PsMetcpsmet 14981  ballcbl 14984
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282  ax-0lt1 8291  ax-rnegex 8294
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-rp 10072  df-psmet 14989  df-bl 14992
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator