| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnblcld | Structured version Visualization version GIF version | ||
| Description: Two ways to write the closed ball centered at zero. (Contributed by Mario Carneiro, 8-Sep-2015.) |
| Ref | Expression |
|---|---|
| cnblcld.1 | ⊢ 𝐷 = (abs ∘ − ) |
| Ref | Expression |
|---|---|
| cnblcld | ⊢ (𝑅 ∈ ℝ* → (◡abs “ (0[,]𝑅)) = {𝑥 ∈ ℂ ∣ (0𝐷𝑥) ≤ 𝑅}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | absf 15389 | . . . . 5 ⊢ abs:ℂ⟶ℝ | |
| 2 | ffn 6705 | . . . . 5 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ) | |
| 3 | elpreima 7053 | . . . . 5 ⊢ (abs Fn ℂ → (𝑥 ∈ (◡abs “ (0[,]𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,]𝑅)))) | |
| 4 | 1, 2, 3 | mp2b 10 | . . . 4 ⊢ (𝑥 ∈ (◡abs “ (0[,]𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,]𝑅))) |
| 5 | df-3an 1103 | . . . . . . 7 ⊢ (((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) ≤ 𝑅) ↔ (((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) ≤ 𝑅)) | |
| 6 | abscl 15329 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ) | |
| 7 | 6 | rexrd 11258 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ*) |
| 8 | absge0 15338 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → 0 ≤ (abs‘𝑥)) | |
| 9 | 7, 8 | jca 520 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → ((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥))) |
| 10 | 9 | adantl 486 | . . . . . . . 8 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥))) |
| 11 | 10 | biantrurd 541 | . . . . . . 7 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ≤ 𝑅 ↔ (((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) ≤ 𝑅))) |
| 12 | 5, 11 | bitr4id 293 | . . . . . 6 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → (((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) ≤ 𝑅) ↔ (abs‘𝑥) ≤ 𝑅)) |
| 13 | 0xr 11255 | . . . . . . 7 ⊢ 0 ∈ ℝ* | |
| 14 | simpl 487 | . . . . . . 7 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → 𝑅 ∈ ℝ*) | |
| 15 | elicc1 13415 | . . . . . . 7 ⊢ ((0 ∈ ℝ* ∧ 𝑅 ∈ ℝ*) → ((abs‘𝑥) ∈ (0[,]𝑅) ↔ ((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) ≤ 𝑅))) | |
| 16 | 13, 14, 15 | sylancr 598 | . . . . . 6 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,]𝑅) ↔ ((abs‘𝑥) ∈ ℝ* ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) ≤ 𝑅))) |
| 17 | 0cn 11197 | . . . . . . . . . 10 ⊢ 0 ∈ ℂ | |
| 18 | cnblcld.1 | . . . . . . . . . . . 12 ⊢ 𝐷 = (abs ∘ − ) | |
| 19 | 18 | cnmetdval 24906 | . . . . . . . . . . 11 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(0 − 𝑥))) |
| 20 | abssub 15378 | . . . . . . . . . . 11 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(0 − 𝑥)) = (abs‘(𝑥 − 0))) | |
| 21 | 19, 20 | eqtrd 2796 | . . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(𝑥 − 0))) |
| 22 | 17, 21 | mpan 702 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘(𝑥 − 0))) |
| 23 | subid1 11477 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → (𝑥 − 0) = 𝑥) | |
| 24 | 23 | fveq2d 6885 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘(𝑥 − 0)) = (abs‘𝑥)) |
| 25 | 22, 24 | eqtrd 2796 | . . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘𝑥)) |
| 26 | 25 | adantl 486 | . . . . . . 7 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘𝑥)) |
| 27 | 26 | breq1d 5118 | . . . . . 6 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → ((0𝐷𝑥) ≤ 𝑅 ↔ (abs‘𝑥) ≤ 𝑅)) |
| 28 | 12, 16, 27 | 3bitr4d 314 | . . . . 5 ⊢ ((𝑅 ∈ ℝ* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,]𝑅) ↔ (0𝐷𝑥) ≤ 𝑅)) |
| 29 | 28 | pm5.32da 589 | . . . 4 ⊢ (𝑅 ∈ ℝ* → ((𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,]𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) ≤ 𝑅))) |
| 30 | 4, 29 | bitrid 286 | . . 3 ⊢ (𝑅 ∈ ℝ* → (𝑥 ∈ (◡abs “ (0[,]𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) ≤ 𝑅))) |
| 31 | 30 | eqabdv 2894 | . 2 ⊢ (𝑅 ∈ ℝ* → (◡abs “ (0[,]𝑅)) = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) ≤ 𝑅)}) |
| 32 | df-rab 3415 | . 2 ⊢ {𝑥 ∈ ℂ ∣ (0𝐷𝑥) ≤ 𝑅} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) ≤ 𝑅)} | |
| 33 | 31, 32 | eqtr4di 2814 | 1 ⊢ (𝑅 ∈ ℝ* → (◡abs “ (0[,]𝑅)) = {𝑥 ∈ ℂ ∣ (0𝐷𝑥) ≤ 𝑅}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 {cab 2739 {crab 3414 class class class wbr 5108 ◡ccnv 5660 “ cima 5664 ∘ ccom 5665 Fn wfn 6531 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℂcc 11097 ℝcr 11098 0cc0 11099 ℝ*cxr 11241 ≤ cle 11243 − cmin 11440 [,]cicc 13374 abscabs 15285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 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 3367 df-reu 3368 df-rab 3415 df-v 3455 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 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9401 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-icc 13378 df-seq 14038 df-exp 14098 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |