Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elbl4 | Structured version Visualization version GIF version |
Description: Membership in a ball, alternative definition. (Contributed by Thierry Arnoux, 26-Jan-2018.) (Revised by Thierry Arnoux, 11-Mar-2018.) |
Ref | Expression |
---|---|
elbl4 | ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵 ∈ (𝐴(ball‘𝐷)𝑅) ↔ 𝐵(◡𝐷 “ (0[,)𝑅))𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rpxr 12397 | . . 3 ⊢ (𝑅 ∈ ℝ+ → 𝑅 ∈ ℝ*) | |
2 | blcomps 23002 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ*) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵 ∈ (𝐴(ball‘𝐷)𝑅) ↔ 𝐴 ∈ (𝐵(ball‘𝐷)𝑅))) | |
3 | 1, 2 | sylanl2 679 | . 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵 ∈ (𝐴(ball‘𝐷)𝑅) ↔ 𝐴 ∈ (𝐵(ball‘𝐷)𝑅))) |
4 | simpll 765 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐷 ∈ (PsMet‘𝑋)) | |
5 | simprr 771 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
6 | simplr 767 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑅 ∈ ℝ+) | |
7 | blval2 23171 | . . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝑅 ∈ ℝ+) → (𝐵(ball‘𝐷)𝑅) = ((◡𝐷 “ (0[,)𝑅)) “ {𝐵})) | |
8 | 7 | eleq2d 2898 | . . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵 ∈ 𝑋 ∧ 𝑅 ∈ ℝ+) → (𝐴 ∈ (𝐵(ball‘𝐷)𝑅) ↔ 𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}))) |
9 | 4, 5, 6, 8 | syl3anc 1367 | . 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴 ∈ (𝐵(ball‘𝐷)𝑅) ↔ 𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}))) |
10 | elimasng 5954 | . . . . 5 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}) ↔ 〈𝐵, 𝐴〉 ∈ (◡𝐷 “ (0[,)𝑅)))) | |
11 | df-br 5066 | . . . . 5 ⊢ (𝐵(◡𝐷 “ (0[,)𝑅))𝐴 ↔ 〈𝐵, 𝐴〉 ∈ (◡𝐷 “ (0[,)𝑅))) | |
12 | 10, 11 | syl6bbr 291 | . . . 4 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}) ↔ 𝐵(◡𝐷 “ (0[,)𝑅))𝐴)) |
13 | 12 | ancoms 461 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}) ↔ 𝐵(◡𝐷 “ (0[,)𝑅))𝐴)) |
14 | 13 | adantl 484 | . 2 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴 ∈ ((◡𝐷 “ (0[,)𝑅)) “ {𝐵}) ↔ 𝐵(◡𝐷 “ (0[,)𝑅))𝐴)) |
15 | 3, 9, 14 | 3bitrd 307 | 1 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ∈ ℝ+) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵 ∈ (𝐴(ball‘𝐷)𝑅) ↔ 𝐵(◡𝐷 “ (0[,)𝑅))𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 ∈ wcel 2110 {csn 4566 〈cop 4572 class class class wbr 5065 ◡ccnv 5553 “ cima 5557 ‘cfv 6354 (class class class)co 7155 0cc0 10536 ℝ*cxr 10673 ℝ+crp 12388 [,)cico 12739 PsMetcpsmet 20528 ballcbl 20531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-1st 7688 df-2nd 7689 df-er 8288 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-2 11699 df-rp 12389 df-xneg 12506 df-xadd 12507 df-xmul 12508 df-ico 12743 df-psmet 20536 df-bl 20539 |
This theorem is referenced by: metucn 23180 |
Copyright terms: Public domain | W3C validator |