cnbl0 - Intuitionistic Logic Explorer

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

Theorem cnbl0 14195

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 980	. . . . . 6 ⊢ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅) ↔ (((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥)) ∧ (abs‘𝑥) < 𝑅))
2		abscl 11063	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ)
3		absge0 11072	. . . . . . . . 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 7960	. . . . . 6 ⊢ 0 ∈ ℝ
9		simpl 109	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → 𝑅 ∈ ℝ^*)
10		elico2 9940	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 𝑅 ∈ ℝ^*) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
11	8, 9, 10	sylancr 414	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
12		0cn 7952	. . . . . . . . 9 ⊢ 0 ∈ ℂ
13		cnblcld.1	. . . . . . . . . . 11 ⊢ 𝐷 = (abs ∘ − )
14	13	cnmetdval 14190	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(0 − 𝑥)))
15		abssub 11113	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (abs‘(0 − 𝑥)) = (abs‘(𝑥 − 0)))
16	14, 15	eqtrd 2210	. . . . . . . . 9 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
17	12, 16	mpan 424	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘(𝑥 − 0)))
18		subid1 8180	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (𝑥 − 0) = 𝑥)
19	18	fveq2d 5521	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (abs‘(𝑥 − 0)) = (abs‘𝑥))
20	17, 19	eqtrd 2210	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘𝑥))
21	20	adantl 277	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘𝑥))
22	21	breq1d 4015	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((0𝐷𝑥) < 𝑅 ↔ (abs‘𝑥) < 𝑅))
23	7, 11, 22	3bitr4d 220	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ (0𝐷𝑥) < 𝑅))
24	23	pm5.32da 452	. . 3 ⊢ (𝑅 ∈ ℝ^* → ((𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
25		absf 11122	. . . . 5 ⊢ abs:ℂ⟶ℝ
26		ffn 5367	. . . . 5 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ)
27	25, 26	ax-mp 5	. . . 4 ⊢ abs Fn ℂ
28		elpreima 5638	. . . 4 ⊢ (abs Fn ℂ → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
29	27, 28	mp1i 10	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
30		cnxmet 14192	. . . . 5 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
31	13, 30	eqeltri 2250	. . . 4 ⊢ 𝐷 ∈ (∞Met‘ℂ)
32		elbl 14052	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘ℂ) ∧ 0 ∈ ℂ ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
33	31, 12, 32	mp3an12 1327	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (0(ball‘𝐷)𝑅) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
34	24, 29, 33	3bitr4d 220	. 2 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ 𝑥 ∈ (0(ball‘𝐷)𝑅)))
35	34	eqrdv 2175	1 ⊢ (𝑅 ∈ ℝ^* → (^◡abs “ (0[,)𝑅)) = (0(ball‘𝐷)𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 class class class wbr 4005 ^◡ccnv 4627 “ cima 4631 ∘ ccom 4632 Fn wfn 5213 ⟶wf 5214 ‘cfv 5218 (class class class)co 5878 ℂcc 7812 ℝcr 7813 0cc0 7814 ℝ^*cxr 7994 < clt 7995 ≤ cle 7996 − cmin 8131 [,)cico 9893 abscabs 11009 ∞Metcxmet 13587 ballcbl 13589

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-mulrcl 7913 ax-addcom 7914 ax-mulcom 7915 ax-addass 7916 ax-mulass 7917 ax-distr 7918 ax-i2m1 7919 ax-0lt1 7920 ax-1rid 7921 ax-0id 7922 ax-rnegex 7923 ax-precex 7924 ax-cnre 7925 ax-pre-ltirr 7926 ax-pre-ltwlin 7927 ax-pre-lttrn 7928 ax-pre-apti 7929 ax-pre-ltadd 7930 ax-pre-mulgt0 7931 ax-pre-mulext 7932 ax-arch 7933 ax-caucvg 7934

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-1st 6144 df-2nd 6145 df-recs 6309 df-frec 6395 df-map 6653 df-pnf 7997 df-mnf 7998 df-xr 7999 df-ltxr 8000 df-le 8001 df-sub 8133 df-neg 8134 df-reap 8535 df-ap 8542 df-div 8633 df-inn 8923 df-2 8981 df-3 8982 df-4 8983 df-n0 9180 df-z 9257 df-uz 9532 df-rp 9657 df-xadd 9776 df-ico 9897 df-seqfrec 10449 df-exp 10523 df-cj 10854 df-re 10855 df-im 10856 df-rsqrt 11010 df-abs 11011 df-psmet 13594 df-xmet 13595 df-met 13596 df-bl 13597

This theorem is referenced by: (None)

W3C validator