![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > xblpnf | GIF version |
Description: The infinity ball in an extended metric is the set of all points that are a finite distance from the center. (Contributed by Mario Carneiro, 23-Aug-2015.) |
Ref | Expression |
---|---|
xblpnf | ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝐴 ∈ (𝑃(ball‘𝐷)+∞) ↔ (𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) ∈ ℝ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pnfxr 7987 | . . 3 ⊢ +∞ ∈ ℝ* | |
2 | elbl 13524 | . . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ +∞ ∈ ℝ*) → (𝐴 ∈ (𝑃(ball‘𝐷)+∞) ↔ (𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) < +∞))) | |
3 | 1, 2 | mp3an3 1326 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝐴 ∈ (𝑃(ball‘𝐷)+∞) ↔ (𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) < +∞))) |
4 | xmetcl 13485 | . . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑃𝐷𝐴) ∈ ℝ*) | |
5 | xmetge0 13498 | . . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑃𝐷𝐴)) | |
6 | ge0nemnf 9798 | . . . . . . . 8 ⊢ (((𝑃𝐷𝐴) ∈ ℝ* ∧ 0 ≤ (𝑃𝐷𝐴)) → (𝑃𝐷𝐴) ≠ -∞) | |
7 | 4, 5, 6 | syl2anc 411 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑃𝐷𝐴) ≠ -∞) |
8 | nmnfgt 9792 | . . . . . . . 8 ⊢ ((𝑃𝐷𝐴) ∈ ℝ* → (-∞ < (𝑃𝐷𝐴) ↔ (𝑃𝐷𝐴) ≠ -∞)) | |
9 | 4, 8 | syl 14 | . . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (-∞ < (𝑃𝐷𝐴) ↔ (𝑃𝐷𝐴) ≠ -∞)) |
10 | 7, 9 | mpbird 167 | . . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → -∞ < (𝑃𝐷𝐴)) |
11 | 10 | biantrurd 305 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑃𝐷𝐴) < +∞ ↔ (-∞ < (𝑃𝐷𝐴) ∧ (𝑃𝐷𝐴) < +∞))) |
12 | xrrebnd 9793 | . . . . . 6 ⊢ ((𝑃𝐷𝐴) ∈ ℝ* → ((𝑃𝐷𝐴) ∈ ℝ ↔ (-∞ < (𝑃𝐷𝐴) ∧ (𝑃𝐷𝐴) < +∞))) | |
13 | 4, 12 | syl 14 | . . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑃𝐷𝐴) ∈ ℝ ↔ (-∞ < (𝑃𝐷𝐴) ∧ (𝑃𝐷𝐴) < +∞))) |
14 | 11, 13 | bitr4d 191 | . . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑃𝐷𝐴) < +∞ ↔ (𝑃𝐷𝐴) ∈ ℝ)) |
15 | 14 | 3expa 1203 | . . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝑃𝐷𝐴) < +∞ ↔ (𝑃𝐷𝐴) ∈ ℝ)) |
16 | 15 | pm5.32da 452 | . 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → ((𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) < +∞) ↔ (𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) ∈ ℝ))) |
17 | 3, 16 | bitrd 188 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝐴 ∈ (𝑃(ball‘𝐷)+∞) ↔ (𝐴 ∈ 𝑋 ∧ (𝑃𝐷𝐴) ∈ ℝ))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 ∈ wcel 2148 ≠ wne 2347 class class class wbr 4000 ‘cfv 5211 (class class class)co 5868 ℝcr 7788 0cc0 7789 +∞cpnf 7966 -∞cmnf 7967 ℝ*cxr 7968 < clt 7969 ≤ cle 7970 ∞Metcxmet 13113 ballcbl 13115 |
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-sep 4118 ax-pow 4171 ax-pr 4205 ax-un 4429 ax-setind 4532 ax-cnex 7880 ax-resscn 7881 ax-1cn 7882 ax-1re 7883 ax-icn 7884 ax-addcl 7885 ax-addrcl 7886 ax-mulcl 7887 ax-mulrcl 7888 ax-addcom 7889 ax-mulcom 7890 ax-addass 7891 ax-mulass 7892 ax-distr 7893 ax-i2m1 7894 ax-0lt1 7895 ax-1rid 7896 ax-0id 7897 ax-rnegex 7898 ax-precex 7899 ax-cnre 7900 ax-pre-ltirr 7901 ax-pre-ltwlin 7902 ax-pre-lttrn 7903 ax-pre-ltadd 7905 ax-pre-mulgt0 7906 |
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-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-if 3535 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-iun 3886 df-br 4001 df-opab 4062 df-mpt 4063 df-id 4289 df-po 4292 df-iso 4293 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-rn 4633 df-res 4634 df-ima 4635 df-iota 5173 df-fun 5213 df-fn 5214 df-f 5215 df-fv 5219 df-riota 5824 df-ov 5871 df-oprab 5872 df-mpo 5873 df-1st 6134 df-2nd 6135 df-map 6643 df-pnf 7971 df-mnf 7972 df-xr 7973 df-ltxr 7974 df-le 7975 df-sub 8107 df-neg 8108 df-2 8954 df-xadd 9747 df-psmet 13120 df-xmet 13121 df-bl 13123 |
This theorem is referenced by: blpnf 13533 xmetec 13570 |
Copyright terms: Public domain | W3C validator |