| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rrnheibor | Structured version Visualization version GIF version | ||
| Description: Heine-Borel theorem for Euclidean space. A subset of Euclidean space is compact iff it is closed and bounded. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 22-Sep-2015.) |
| Ref | Expression |
|---|---|
| rrnheibor.1 | ⊢ 𝑋 = (ℝ ↑m 𝐼) |
| rrnheibor.2 | ⊢ 𝑀 = ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) |
| rrnheibor.3 | ⊢ 𝑇 = (MetOpen‘𝑀) |
| rrnheibor.4 | ⊢ 𝑈 = (MetOpen‘(ℝn‘𝐼)) |
| Ref | Expression |
|---|---|
| rrnheibor | ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑌 ∈ (Clsd‘𝑈) ∧ 𝑀 ∈ (Bnd‘𝑌)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rrnheibor.1 | . . . . . 6 ⊢ 𝑋 = (ℝ ↑m 𝐼) | |
| 2 | 1 | rrnmet 38328 | . . . . 5 ⊢ (𝐼 ∈ Fin → (ℝn‘𝐼) ∈ (Met‘𝑋)) |
| 3 | rrnheibor.2 | . . . . . 6 ⊢ 𝑀 = ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) | |
| 4 | metres2 24423 | . . . . . 6 ⊢ (((ℝn‘𝐼) ∈ (Met‘𝑋) ∧ 𝑌 ⊆ 𝑋) → ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (Met‘𝑌)) | |
| 5 | 3, 4 | eqeltrid 2866 | . . . . 5 ⊢ (((ℝn‘𝐼) ∈ (Met‘𝑋) ∧ 𝑌 ⊆ 𝑋) → 𝑀 ∈ (Met‘𝑌)) |
| 6 | 2, 5 | sylan 589 | . . . 4 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → 𝑀 ∈ (Met‘𝑌)) |
| 7 | 6 | biantrurd 540 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑀 ∈ (Met‘𝑌) ∧ 𝑇 ∈ Comp))) |
| 8 | rrnheibor.3 | . . . 4 ⊢ 𝑇 = (MetOpen‘𝑀) | |
| 9 | 8 | heibor 38320 | . . 3 ⊢ ((𝑀 ∈ (Met‘𝑌) ∧ 𝑇 ∈ Comp) ↔ (𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌))) |
| 10 | 7, 9 | bitrdi 289 | . 2 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌)))) |
| 11 | 3 | eleq1i 2853 | . . . 4 ⊢ (𝑀 ∈ (CMet‘𝑌) ↔ ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌)) |
| 12 | 1 | rrncms 38332 | . . . . . 6 ⊢ (𝐼 ∈ Fin → (ℝn‘𝐼) ∈ (CMet‘𝑋)) |
| 13 | 12 | adantr 484 | . . . . 5 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (ℝn‘𝐼) ∈ (CMet‘𝑋)) |
| 14 | rrnheibor.4 | . . . . . 6 ⊢ 𝑈 = (MetOpen‘(ℝn‘𝐼)) | |
| 15 | 14 | cmetss 25378 | . . . . 5 ⊢ ((ℝn‘𝐼) ∈ (CMet‘𝑋) → (((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
| 16 | 13, 15 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
| 17 | 11, 16 | bitrid 285 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑀 ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
| 18 | 1, 3 | rrntotbnd 38335 | . . . 4 ⊢ (𝐼 ∈ Fin → (𝑀 ∈ (TotBnd‘𝑌) ↔ 𝑀 ∈ (Bnd‘𝑌))) |
| 19 | 18 | adantr 484 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑀 ∈ (TotBnd‘𝑌) ↔ 𝑀 ∈ (Bnd‘𝑌))) |
| 20 | 17, 19 | anbi12d 641 | . 2 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → ((𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌)) ↔ (𝑌 ∈ (Clsd‘𝑈) ∧ 𝑀 ∈ (Bnd‘𝑌)))) |
| 21 | 10, 20 | bitrd 281 | 1 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑌 ∈ (Clsd‘𝑈) ∧ 𝑀 ∈ (Bnd‘𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ⊆ wss 3904 × cxp 5645 ↾ cres 5649 ‘cfv 6521 (class class class)co 7396 ↑m cmap 8808 Fincfn 8927 ℝcr 11072 Metcmet 21410 MetOpencmopn 21414 Clsdccld 23076 Compccmp 23446 CMetccmet 25316 TotBndctotbnd 38265 Bndcbnd 38266 ℝncrrn 38324 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-inf2 9596 ax-cc 10392 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-oadd 8441 df-omul 8442 df-er 8678 df-ec 8680 df-map 8810 df-pm 8811 df-ixp 8880 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-fi 9357 df-sup 9388 df-inf 9389 df-oi 9458 df-card 9897 df-acn 9900 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12482 df-z 12569 df-dec 12689 df-uz 12840 df-q 12950 df-rp 12994 df-xneg 13114 df-xadd 13115 df-xmul 13116 df-ico 13355 df-icc 13356 df-fz 13513 df-fzo 13660 df-fl 13802 df-seq 14015 df-exp 14075 df-hash 14344 df-cj 15126 df-re 15127 df-im 15128 df-sqrt 15262 df-abs 15263 df-limsup 15498 df-clim 15515 df-rlim 15516 df-sum 15714 df-gz 16966 df-struct 17183 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-starv 17301 df-sca 17302 df-vsca 17303 df-ip 17304 df-tset 17305 df-ple 17306 df-ds 17308 df-unif 17309 df-hom 17310 df-cco 17311 df-rest 17451 df-topn 17452 df-topgen 17472 df-prds 17476 df-pws 17478 df-psmet 21416 df-xmet 21417 df-met 21418 df-bl 21419 df-mopn 21420 df-fbas 21421 df-fg 21422 df-cnfld 21425 df-top 22954 df-topon 22971 df-topsp 22993 df-bases 23006 df-cld 23079 df-ntr 23080 df-cls 23081 df-nei 23158 df-lm 23289 df-haus 23375 df-cmp 23447 df-fil 23906 df-fm 23998 df-flim 23999 df-flf 24000 df-xms 24380 df-ms 24381 df-cfil 25317 df-cau 25318 df-cmet 25319 df-totbnd 38267 df-bnd 38278 df-rrn 38325 |
| This theorem is referenced by: reheibor 38338 |
| Copyright terms: Public domain | W3C validator |