Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > blf | GIF version |
Description: Mapping of a ball. (Contributed by NM, 7-May-2007.) (Revised by Mario Carneiro, 23-Aug-2015.) |
Ref | Expression |
---|---|
blf | ⊢ (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrab2 3182 | . . . . . 6 ⊢ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋 | |
2 | xmetrel 12512 | . . . . . . . 8 ⊢ Rel ∞Met | |
3 | relelfvdm 5453 | . . . . . . . 8 ⊢ ((Rel ∞Met ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝑋 ∈ dom ∞Met) | |
4 | 2, 3 | mpan 420 | . . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met) |
5 | elpw2g 4081 | . . . . . . 7 ⊢ (𝑋 ∈ dom ∞Met → ({𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋)) | |
6 | 4, 5 | syl 14 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ({𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ⊆ 𝑋)) |
7 | 1, 6 | mpbiri 167 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋) |
8 | 7 | a1d 22 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((𝑥 ∈ 𝑋 ∧ 𝑟 ∈ ℝ*) → {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋)) |
9 | 8 | ralrimivv 2513 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ* {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋) |
10 | eqid 2139 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) = (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}) | |
11 | 10 | fmpo 6099 | . . 3 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑟 ∈ ℝ* {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟} ∈ 𝒫 𝑋 ↔ (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋) |
12 | 9, 11 | sylib 121 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋) |
13 | blfval 12555 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷) = (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟})) | |
14 | 13 | feq1d 5259 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋 ↔ (𝑥 ∈ 𝑋, 𝑟 ∈ ℝ* ↦ {𝑦 ∈ 𝑋 ∣ (𝑥𝐷𝑦) < 𝑟}):(𝑋 × ℝ*)⟶𝒫 𝑋)) |
15 | 12, 14 | mpbird 166 | 1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (ball‘𝐷):(𝑋 × ℝ*)⟶𝒫 𝑋) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 ∀wral 2416 {crab 2420 ⊆ wss 3071 𝒫 cpw 3510 class class class wbr 3929 × cxp 4537 dom cdm 4539 Rel wrel 4544 ⟶wf 5119 ‘cfv 5123 (class class class)co 5774 ∈ cmpo 5776 ℝ*cxr 7799 < clt 7800 ∞Metcxmet 12149 ballcbl 12151 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-map 6544 df-pnf 7802 df-mnf 7803 df-xr 7804 df-psmet 12156 df-xmet 12157 df-bl 12159 |
This theorem is referenced by: blrn 12581 blelrn 12589 blssm 12590 unirnbl 12592 blin2 12601 xmettx 12679 |
Copyright terms: Public domain | W3C validator |