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

Theorem stdbdbl 24836
Description: The standard bounded metric corresponding to 𝐶 generates the same balls as 𝐶 for radii less than 𝑅. (Contributed by Mario Carneiro, 26-Aug-2015.)
Hypothesis
Ref Expression
stdbdmet.1 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))
Assertion
Ref Expression
stdbdbl (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → (𝑃(ball‘𝐷)𝑆) = (𝑃(ball‘𝐶)𝑆))
Distinct variable groups:   𝑥,𝑦,𝐶   𝑥,𝑃,𝑦   𝑥,𝑅,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐷(𝑥, 𝑦)   𝑆(𝑥, 𝑦)

Proof of Theorem stdbdbl
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 simpll2 1232 . . . . . 6 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝑅 ∈ ℝ*)
2 simpr1 1213 . . . . . . 7 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → 𝑃 ∈ 𝑋)
32adantr 486 . . . . . 6 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝑃 ∈ 𝑋)
4 simpr 490 . . . . . 6 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
5 stdbdmet.1 . . . . . . 7 𝐷 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ if((𝑥𝐶𝑦) ≤ 𝑅, (𝑥𝐶𝑦), 𝑅))
65stdbdmetval 24833 . . . . . 6 ((𝑅 ∈ ℝ* ∧ 𝑃 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑃𝐷𝑧) = if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅))
71, 3, 4, 6syl3anc 1398 . . . . 5 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (𝑃𝐷𝑧) = if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅))
87breq1d 5113 . . . 4 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → ((𝑃𝐷𝑧) < 𝑆 ↔ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) < 𝑆))
9 simplr3 1236 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝑆 ≤ 𝑅)
109biantrud 541 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (𝑆 ≤ (𝑃𝐶𝑧) ↔ (𝑆 ≤ (𝑃𝐶𝑧) ∧ 𝑆 ≤ 𝑅)))
11 simpr2 1214 . . . . . . . . 9 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → 𝑆 ∈ ℝ*)
1211adantr 486 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝑆 ∈ ℝ*)
13 simpl1 1210 . . . . . . . . . 10 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → 𝐶 ∈ (∞Met‘𝑋))
1413adantr 486 . . . . . . . . 9 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → 𝐶 ∈ (∞Met‘𝑋))
15 xmetcl 24650 . . . . . . . . 9 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑃𝐶𝑧) ∈ ℝ*)
1614, 3, 4, 15syl3anc 1398 . . . . . . . 8 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (𝑃𝐶𝑧) ∈ ℝ*)
17 xrlemin 13314 . . . . . . . 8 ((𝑆 ∈ ℝ* ∧ (𝑃𝐶𝑧) ∈ ℝ* ∧ 𝑅 ∈ ℝ*) → (𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) ↔ (𝑆 ≤ (𝑃𝐶𝑧) ∧ 𝑆 ≤ 𝑅)))
1812, 16, 1, 17syl3anc 1398 . . . . . . 7 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) ↔ (𝑆 ≤ (𝑃𝐶𝑧) ∧ 𝑆 ≤ 𝑅)))
1910, 18bitr4d 285 . . . . . 6 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (𝑆 ≤ (𝑃𝐶𝑧) ↔ 𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅)))
2019notbid 321 . . . . 5 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (¬ 𝑆 ≤ (𝑃𝐶𝑧) ↔ ¬ 𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅)))
21 xrltnle 11376 . . . . . 6 (((𝑃𝐶𝑧) ∈ ℝ* ∧ 𝑆 ∈ ℝ*) → ((𝑃𝐶𝑧) < 𝑆 ↔ ¬ 𝑆 ≤ (𝑃𝐶𝑧)))
2216, 12, 21syl2anc 596 . . . . 5 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → ((𝑃𝐶𝑧) < 𝑆 ↔ ¬ 𝑆 ≤ (𝑃𝐶𝑧)))
2316, 1ifcld 4529 . . . . . 6 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) ∈ ℝ*)
24 xrltnle 11376 . . . . . 6 ((if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) ∈ ℝ* ∧ 𝑆 ∈ ℝ*) → (if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) < 𝑆 ↔ ¬ 𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅)))
2523, 12, 24syl2anc 596 . . . . 5 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → (if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) < 𝑆 ↔ ¬ 𝑆 ≤ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅)))
2620, 22, 253bitr4d 314 . . . 4 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → ((𝑃𝐶𝑧) < 𝑆 ↔ if((𝑃𝐶𝑧) ≤ 𝑅, (𝑃𝐶𝑧), 𝑅) < 𝑆))
278, 26bitr4d 285 . . 3 ((((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) ∧ 𝑧 ∈ 𝑋) → ((𝑃𝐷𝑧) < 𝑆 ↔ (𝑃𝐶𝑧) < 𝑆))
2827rabbidva 3419 . 2 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → {𝑧 ∈ 𝑋 ∣ (𝑃𝐷𝑧) < 𝑆} = {𝑧 ∈ 𝑋 ∣ (𝑃𝐶𝑧) < 𝑆})
295stdbdxmet 24834 . . . 4 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) → 𝐷 ∈ (∞Met‘𝑋))
3029adantr 486 . . 3 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → 𝐷 ∈ (∞Met‘𝑋))
31 blval 24705 . . 3 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑆) = {𝑧 ∈ 𝑋 ∣ (𝑃𝐷𝑧) < 𝑆})
3230, 2, 11, 31syl3anc 1398 . 2 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → (𝑃(ball‘𝐷)𝑆) = {𝑧 ∈ 𝑋 ∣ (𝑃𝐷𝑧) < 𝑆})
33 blval 24705 . . 3 ((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ*) → (𝑃(ball‘𝐶)𝑆) = {𝑧 ∈ 𝑋 ∣ (𝑃𝐶𝑧) < 𝑆})
3413, 2, 11, 33syl3anc 1398 . 2 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → (𝑃(ball‘𝐶)𝑆) = {𝑧 ∈ 𝑋 ∣ (𝑃𝐶𝑧) < 𝑆})
3528, 32, 343eqtr4d 2806 1 (((𝐶 ∈ (∞Met‘𝑋) ∧ 𝑅 ∈ ℝ* ∧ 0 < 𝑅) ∧ (𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ* ∧ 𝑆 ≤ 𝑅)) → (𝑃(ball‘𝐷)𝑆) = (𝑃(ball‘𝐶)𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {crab 3413  ifcif 4482   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  0cc0 11200  ℝ*cxr 11342   < clt 11343   ≤ cle 11344  ∞Metcxmet 21663  ballcbl 21665
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-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-rp 13121  df-xneg 13241  df-xadd 13242  df-xmul 13243  df-icc 13483  df-psmet 21670  df-xmet 21671  df-bl 21673
This theorem is used by:  stdbdmopn  24837  xlebnum  25286
  Copyright terms: Public domain W3C validator