cnbl0 - Metamath Proof Explorer

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

Theorem cnbl0 24510

Description: Two ways to write the open ball centered at zero. (Contributed by Mario Carneiro, 8-Sep-2015.)

**Hypothesis**
Ref	Expression
cnblcld.1	⊢ 𝐷 = (abs ∘ − )

**Assertion**
Ref	Expression
cnbl0	⊢ (𝑅 ∈ ℝ^* → (^◡abs “ (0[,)𝑅)) = (0(ball‘𝐷)𝑅))

Proof of Theorem cnbl0 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-3an 1089	. . . . . 6 ⊢ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅) ↔ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) < 𝑅))
2		abscl 15229	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ)
3		absge0 15238	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → 0 ≤ (abs‘𝑥))
4	2, 3	jca 512	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)))
5	4	adantl 482	. . . . . . 7 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)))
6	5	biantrurd 533	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) < 𝑅 ↔ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) < 𝑅)))
7	1, 6	bitr4id 289	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅) ↔ (abs‘𝑥) < 𝑅))
8		0re 11220	. . . . . 6 ⊢ 0 ∈ ℝ
9		simpl 483	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → 𝑅 ∈ ℝ^*)
10		elico2 13392	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 𝑅 ∈ ℝ^*) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
11	8, 9, 10	sylancr 587	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
12		0cn 11210	. . . . . . . . 9 ⊢ 0 ∈ ℂ
13		cnblcld.1	. . . . . . . . . . 11 ⊢ 𝐷 = (abs ∘ − )
14	13	cnmetdval 24507	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(0 − 𝑥)))
15		abssub 15277	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(0 − 𝑥)) = (abs‘(𝑥 − 0)))
16	14, 15	eqtrd 2772	. . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
17	12, 16	mpan 688	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
18		subid1 11484	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (𝑥 − 0) = 𝑥)
19	18	fveq2d 6895	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (abs‘(𝑥 − 0)) = (abs‘𝑥))
20	17, 19	eqtrd 2772	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘𝑥))
21	20	adantl 482	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘𝑥))
22	21	breq1d 5158	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((0𝐷𝑥) < 𝑅 ↔ (abs‘𝑥) < 𝑅))
23	7, 11, 22	3bitr4d 310	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ (0𝐷𝑥) < 𝑅))
24	23	pm5.32da 579	. . 3 ⊢ (𝑅 ∈ ℝ^* → ((𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
25		absf 15288	. . . . 5 ⊢ abs:ℂ⟶ℝ
26		ffn 6717	. . . . 5 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ)
27	25, 26	ax-mp 5	. . . 4 ⊢ abs Fn ℂ
28		elpreima 7059	. . . 4 ⊢ (abs Fn ℂ → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
29	27, 28	mp1i 13	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
30		cnxmet 24509	. . . . 5 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
31	13, 30	eqeltri 2829	. . . 4 ⊢ 𝐷 ∈ (∞Met‘ℂ)
32		elbl 24114	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘ℂ) ∧ 0 ∈ ℂ ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
33	31, 12, 32	mp3an12 1451	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
34	24, 29, 33	3bitr4d 310	. 2 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ 𝑥 ∈ (0(ball‘𝐷)𝑅)))
35	34	eqrdv 2730	1 ⊢ (𝑅 ∈ ℝ^* → (^◡abs “ (0[,)𝑅)) = (0(ball‘𝐷)𝑅))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5148 ^◡ccnv 5675 “ cima 5679 ∘ ccom 5680 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 ℝcr 11111 0cc0 11112 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 − cmin 11448 [,)cico 13330 abscabs 15185 ∞Metcxmet 21129 ballcbl 21131

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12979 df-xadd 13097 df-ico 13334 df-seq 13971 df-exp 14032 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-psmet 21136 df-xmet 21137 df-met 21138 df-bl 21139

This theorem is referenced by: psercnlem2 26160 efopnlem1 26388 binomcxplemdvbinom 43414 binomcxplemnotnn0 43417

W3C validator