cnbl0 - Intuitionistic Logic Explorer

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

Theorem cnbl0 14004

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 11059	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (abs‘𝑥) ∈ ℝ)
3		absge0 11068	. . . . . . . . 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 7956	. . . . . 6 ⊢ 0 ∈ ℝ
9		simpl 109	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → 𝑅 ∈ ℝ^*)
10		elico2 9936	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 𝑅 ∈ ℝ^*) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
11	8, 9, 10	sylancr 414	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ ((abs‘𝑥) ∈ ℝ ∧ 0 ≤ (abs‘𝑥) ∧ (abs‘𝑥) < 𝑅)))
12		0cn 7948	. . . . . . . . 9 ⊢ 0 ∈ ℂ
13		cnblcld.1	. . . . . . . . . . 11 ⊢ 𝐷 = (abs ∘ − )
14	13	cnmetdval 13999	. . . . . . . . . 10 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘(0 − 𝑥)))
15		abssub 11109	. . . . . . . . . 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 8176	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (𝑥 − 0) = 𝑥)
19	18	fveq2d 5519	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (abs‘(𝑥 − 0)) = (abs‘𝑥))
20	17, 19	eqtrd 2210	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (0𝐷𝑥) = (abs‘𝑥))
21	20	adantl 277	. . . . . 6 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → (0𝐷𝑥) = (abs‘𝑥))
22	21	breq1d 4013	. . . . 5 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((0𝐷𝑥) < 𝑅 ↔ (abs‘𝑥) < 𝑅))
23	7, 11, 22	3bitr4d 220	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑥 ∈ ℂ) → ((abs‘𝑥) ∈ (0[,)𝑅) ↔ (0𝐷𝑥) < 𝑅))
24	23	pm5.32da 452	. . 3 ⊢ (𝑅 ∈ ℝ^* → ((𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (0𝐷𝑥) < 𝑅)))
25		absf 11118	. . . . 5 ⊢ abs:ℂ⟶ℝ
26		ffn 5365	. . . . 5 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ)
27	25, 26	ax-mp 5	. . . 4 ⊢ abs Fn ℂ
28		elpreima 5635	. . . 4 ⊢ (abs Fn ℂ → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
29	27, 28	mp1i 10	. . 3 ⊢ (𝑅 ∈ ℝ^* → (𝑥 ∈ (^◡abs “ (0[,)𝑅)) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) ∈ (0[,)𝑅))))
30		cnxmet 14001	. . . . 5 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
31	13, 30	eqeltri 2250	. . . 4 ⊢ 𝐷 ∈ (∞Met‘ℂ)
32		elbl 13861	. . . 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 4003 ^◡ccnv 4625 “ cima 4629 ∘ ccom 4630 Fn wfn 5211 ⟶wf 5212 ‘cfv 5216 (class class class)co 5874 ℂcc 7808 ℝcr 7809 0cc0 7810 ℝ^*cxr 7990 < clt 7991 ≤ cle 7992 − cmin 8127 [,)cico 9889 abscabs 11005 ∞Metcxmet 13410 ballcbl 13412

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 4118 ax-sep 4121 ax-nul 4129 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-iinf 4587 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 ax-caucvg 7930

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 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-tr 4102 df-id 4293 df-po 4296 df-iso 4297 df-iord 4366 df-on 4368 df-ilim 4369 df-suc 4371 df-iom 4590 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-recs 6305 df-frec 6391 df-map 6649 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-reap 8531 df-ap 8538 df-div 8629 df-inn 8919 df-2 8977 df-3 8978 df-4 8979 df-n0 9176 df-z 9253 df-uz 9528 df-rp 9653 df-xadd 9772 df-ico 9893 df-seqfrec 10445 df-exp 10519 df-cj 10850 df-re 10851 df-im 10852 df-rsqrt 11006 df-abs 11007 df-psmet 13417 df-xmet 13418 df-met 13419 df-bl 13420

This theorem is referenced by: (None)

W3C validator