cnbl0 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cnbl0		GIF version

Theorem cnbl0 14330

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 981	. . . . . 6 ⊢ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅) ↔ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) < 𝑅))
2		abscl 11074	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ)
3		absge0 11083	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → 0 ≤ (abs‘𝑥))
4	2, 3	jca 306	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)))
5	4	adantl 277	. . . . . . 7 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)))
6	5	biantrurd 305	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) < 𝑅 ↔ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) < 𝑅)))
7	1, 6	bitr4id 199	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅) ↔ (abs‘𝑥) < 𝑅))
8		0re 7971	. . . . . 6 ⊢ 0 ∈ ℝ
9		simpl 109	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → 𝑅 ∈ ℝ^*)
10		elico2 9951	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 𝑅 ∈ ℝ^*) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
11	8, 9, 10	sylancr 414	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
12		0cn 7963	. . . . . . . . 9 ⊢ 0 ∈ ℂ
13		cnblcld.1	. . . . . . . . . . 11 ⊢ 𝐷 = (abs ∘ − )
14	13	cnmetdval 14325	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(0 − 𝑥)))
15		abssub 11124	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(0 − 𝑥)) = (abs‘(𝑥 − 0)))
16	14, 15	eqtrd 2220	. . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
17	12, 16	mpan 424	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
18		subid1 8191	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (𝑥 − 0) = 𝑥)
19	18	fveq2d 5531	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (abs‘(𝑥 − 0)) = (abs‘𝑥))
20	17, 19	eqtrd 2220	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘𝑥))
21	20	adantl 277	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘𝑥))
22	21	breq1d 4025	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((0𝐷𝑥) < 𝑅 ↔ (abs‘𝑥) < 𝑅))
23	7, 11, 22	3bitr4d 220	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ (0𝐷𝑥) < 𝑅))
24	23	pm5.32da 452	. . 3 ⊢ (𝑅 ∈ ℝ^* → ((𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
25		absf 11133	. . . . 5 ⊢ abs:ℂ⟶ℝ
26		ffn 5377	. . . . 5 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ)
27	25, 26	ax-mp 5	. . . 4 ⊢ abs Fn ℂ
28		elpreima 5648	. . . 4 ⊢ (abs Fn ℂ → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
29	27, 28	mp1i 10	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
30		cnxmet 14327	. . . . 5 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
31	13, 30	eqeltri 2260	. . . 4 ⊢ 𝐷 ∈ (∞Met‘ℂ)
32		elbl 14187	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘ℂ) ∧ 0 ∈ ℂ ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
33	31, 12, 32	mp3an12 1337	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
34	24, 29, 33	3bitr4d 220	. 2 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ 𝑥 ∈ (0(ball‘𝐷)𝑅)))
35	34	eqrdv 2185	1 ⊢ (𝑅 ∈ ℝ^* → (^◡abs “ (0[,)𝑅)) = (0(ball‘𝐷)𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 979 = wceq 1363 ∈ wcel 2158 class class class wbr 4015 ^◡ccnv 4637 “ cima 4641 ∘ ccom 4642 Fn wfn 5223 ⟶wf 5224 ‘cfv 5228 (class class class)co 5888 ℂcc 7823 ℝcr 7824 0cc0 7825 ℝ^*cxr 8005 < clt 8006 ≤ cle 8007 − cmin 8142 [,)cico 9904 abscabs 11020 ∞Metcxmet 13722 ballcbl 13724

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7916 ax-resscn 7917 ax-1cn 7918 ax-1re 7919 ax-icn 7920 ax-addcl 7921 ax-addrcl 7922 ax-mulcl 7923 ax-mulrcl 7924 ax-addcom 7925 ax-mulcom 7926 ax-addass 7927 ax-mulass 7928 ax-distr 7929 ax-i2m1 7930 ax-0lt1 7931 ax-1rid 7932 ax-0id 7933 ax-rnegex 7934 ax-precex 7935 ax-cnre 7936 ax-pre-ltirr 7937 ax-pre-ltwlin 7938 ax-pre-lttrn 7939 ax-pre-apti 7940 ax-pre-ltadd 7941 ax-pre-mulgt0 7942 ax-pre-mulext 7943 ax-arch 7944 ax-caucvg 7945

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-if 3547 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-po 4308 df-iso 4309 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6155 df-2nd 6156 df-recs 6320 df-frec 6406 df-map 6664 df-pnf 8008 df-mnf 8009 df-xr 8010 df-ltxr 8011 df-le 8012 df-sub 8144 df-neg 8145 df-reap 8546 df-ap 8553 df-div 8644 df-inn 8934 df-2 8992 df-3 8993 df-4 8994 df-n0 9191 df-z 9268 df-uz 9543 df-rp 9668 df-xadd 9787 df-ico 9908 df-seqfrec 10460 df-exp 10534 df-cj 10865 df-re 10866 df-im 10867 df-rsqrt 11021 df-abs 11022 df-psmet 13729 df-xmet 13730 df-met 13731 df-bl 13732

This theorem is referenced by: (None)

W3C validator