| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > blssexps | Structured version Visualization version GIF version | ||
| Description: Two ways to express the existence of a ball subset. (Contributed by NM, 5-May-2007.) (Revised by Mario Carneiro, 12-Nov-2013.) (Revised by Thierry Arnoux, 11-Mar-2018.) |
| Ref | Expression |
|---|---|
| blssexps | ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) ↔ ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | blssps 24592 | . . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ ran (ball‘𝐷) ∧ 𝑃 ∈ 𝑥) → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝑥) | |
| 2 | sstr 3944 | . . . . . . . . 9 ⊢ (((𝑃(ball‘𝐷)𝑟) ⊆ 𝑥 ∧ 𝑥 ⊆ 𝐴) → (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴) | |
| 3 | 2 | expcom 418 | . . . . . . . 8 ⊢ (𝑥 ⊆ 𝐴 → ((𝑃(ball‘𝐷)𝑟) ⊆ 𝑥 → (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 4 | 3 | reximdv 3179 | . . . . . . 7 ⊢ (𝑥 ⊆ 𝐴 → (∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝑥 → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 5 | 1, 4 | syl5com 32 | . . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ ran (ball‘𝐷) ∧ 𝑃 ∈ 𝑥) → (𝑥 ⊆ 𝐴 → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 6 | 5 | 3expa 1135 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ ran (ball‘𝐷)) ∧ 𝑃 ∈ 𝑥) → (𝑥 ⊆ 𝐴 → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 7 | 6 | expimpd 458 | . . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ ran (ball‘𝐷)) → ((𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 8 | 7 | adantlr 727 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑥 ∈ ran (ball‘𝐷)) → ((𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 9 | 8 | rexlimdva 3165 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) → ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| 10 | simpll 778 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → 𝐷 ∈ (PsMet‘𝑋)) | |
| 11 | simplr 780 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → 𝑃 ∈ 𝑋) | |
| 12 | rpxr 13032 | . . . . . 6 ⊢ (𝑟 ∈ ℝ+ → 𝑟 ∈ ℝ*) | |
| 13 | 12 | ad2antrl 740 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → 𝑟 ∈ ℝ*) |
| 14 | blelrnps 24584 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑟 ∈ ℝ*) → (𝑃(ball‘𝐷)𝑟) ∈ ran (ball‘𝐷)) | |
| 15 | 10, 11, 13, 14 | syl3anc 1397 | . . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → (𝑃(ball‘𝐷)𝑟) ∈ ran (ball‘𝐷)) |
| 16 | simprl 782 | . . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → 𝑟 ∈ ℝ+) | |
| 17 | blcntrps 24580 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑟 ∈ ℝ+) → 𝑃 ∈ (𝑃(ball‘𝐷)𝑟)) | |
| 18 | 10, 11, 16, 17 | syl3anc 1397 | . . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → 𝑃 ∈ (𝑃(ball‘𝐷)𝑟)) |
| 19 | simprr 784 | . . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴) | |
| 20 | eleq2 2851 | . . . . . 6 ⊢ (𝑥 = (𝑃(ball‘𝐷)𝑟) → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ (𝑃(ball‘𝐷)𝑟))) | |
| 21 | sseq1 3961 | . . . . . 6 ⊢ (𝑥 = (𝑃(ball‘𝐷)𝑟) → (𝑥 ⊆ 𝐴 ↔ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) | |
| 22 | 20, 21 | anbi12d 643 | . . . . 5 ⊢ (𝑥 = (𝑃(ball‘𝐷)𝑟) → ((𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) ↔ (𝑃 ∈ (𝑃(ball‘𝐷)𝑟) ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴))) |
| 23 | 22 | rspcev 3580 | . . . 4 ⊢ (((𝑃(ball‘𝐷)𝑟) ∈ ran (ball‘𝐷) ∧ (𝑃 ∈ (𝑃(ball‘𝐷)𝑟) ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → ∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴)) |
| 24 | 15, 18, 19, 23 | syl12anc 849 | . . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑟 ∈ ℝ+ ∧ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) → ∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴)) |
| 25 | 24 | rexlimdvaa 3166 | . 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴 → ∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴))) |
| 26 | 9, 25 | impbid 215 | 1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑃 ∈ 𝑋) → (∃𝑥 ∈ ran (ball‘𝐷)(𝑃 ∈ 𝑥 ∧ 𝑥 ⊆ 𝐴) ↔ ∃𝑟 ∈ ℝ+ (𝑃(ball‘𝐷)𝑟) ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ∃wrex 3088 ⊆ wss 3904 ran crn 5661 ‘cfv 6536 (class class class)co 7412 ℝ*cxr 11248 ℝ+crp 13022 PsMetcpsmet 21517 ballcbl 21520 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-inf 9401 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-n0 12511 df-z 12598 df-uz 12869 df-q 12979 df-rp 13023 df-xneg 13143 df-xadd 13144 df-xmul 13145 df-psmet 21525 df-bl 21528 |
| This theorem is used by: metustbl 24734 psmetutop 24735 |
| Copyright terms: Public domain | W3C validator |