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 35681 | . . . . 5 ⊢ (𝐼 ∈ Fin → (ℝn‘𝐼) ∈ (Met‘𝑋)) |
3 | rrnheibor.2 | . . . . . 6 ⊢ 𝑀 = ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) | |
4 | metres2 23233 | . . . . . 6 ⊢ (((ℝn‘𝐼) ∈ (Met‘𝑋) ∧ 𝑌 ⊆ 𝑋) → ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (Met‘𝑌)) | |
5 | 3, 4 | eqeltrid 2838 | . . . . 5 ⊢ (((ℝn‘𝐼) ∈ (Met‘𝑋) ∧ 𝑌 ⊆ 𝑋) → 𝑀 ∈ (Met‘𝑌)) |
6 | 2, 5 | sylan 583 | . . . 4 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → 𝑀 ∈ (Met‘𝑌)) |
7 | 6 | biantrurd 536 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑀 ∈ (Met‘𝑌) ∧ 𝑇 ∈ Comp))) |
8 | rrnheibor.3 | . . . 4 ⊢ 𝑇 = (MetOpen‘𝑀) | |
9 | 8 | heibor 35673 | . . 3 ⊢ ((𝑀 ∈ (Met‘𝑌) ∧ 𝑇 ∈ Comp) ↔ (𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌))) |
10 | 7, 9 | bitrdi 290 | . 2 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌)))) |
11 | 3 | eleq1i 2824 | . . . 4 ⊢ (𝑀 ∈ (CMet‘𝑌) ↔ ((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌)) |
12 | 1 | rrncms 35685 | . . . . . 6 ⊢ (𝐼 ∈ Fin → (ℝn‘𝐼) ∈ (CMet‘𝑋)) |
13 | 12 | adantr 484 | . . . . 5 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (ℝn‘𝐼) ∈ (CMet‘𝑋)) |
14 | rrnheibor.4 | . . . . . 6 ⊢ 𝑈 = (MetOpen‘(ℝn‘𝐼)) | |
15 | 14 | cmetss 24185 | . . . . 5 ⊢ ((ℝn‘𝐼) ∈ (CMet‘𝑋) → (((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
16 | 13, 15 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (((ℝn‘𝐼) ↾ (𝑌 × 𝑌)) ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
17 | 11, 16 | syl5bb 286 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑀 ∈ (CMet‘𝑌) ↔ 𝑌 ∈ (Clsd‘𝑈))) |
18 | 1, 3 | rrntotbnd 35688 | . . . 4 ⊢ (𝐼 ∈ Fin → (𝑀 ∈ (TotBnd‘𝑌) ↔ 𝑀 ∈ (Bnd‘𝑌))) |
19 | 18 | adantr 484 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑀 ∈ (TotBnd‘𝑌) ↔ 𝑀 ∈ (Bnd‘𝑌))) |
20 | 17, 19 | anbi12d 634 | . 2 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → ((𝑀 ∈ (CMet‘𝑌) ∧ 𝑀 ∈ (TotBnd‘𝑌)) ↔ (𝑌 ∈ (Clsd‘𝑈) ∧ 𝑀 ∈ (Bnd‘𝑌)))) |
21 | 10, 20 | bitrd 282 | 1 ⊢ ((𝐼 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → (𝑇 ∈ Comp ↔ (𝑌 ∈ (Clsd‘𝑈) ∧ 𝑀 ∈ (Bnd‘𝑌)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2110 ⊆ wss 3857 × cxp 5538 ↾ cres 5542 ‘cfv 6369 (class class class)co 7202 ↑m cmap 8497 Fincfn 8615 ℝcr 10711 Metcmet 20321 MetOpencmopn 20325 Clsdccld 21885 Compccmp 22255 CMetccmet 24123 TotBndctotbnd 35618 Bndcbnd 35619 ℝncrrn 35677 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-inf2 9245 ax-cc 10032 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 ax-pre-sup 10790 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-iin 4897 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-se 5499 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-isom 6378 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-oadd 8195 df-omul 8196 df-er 8380 df-ec 8382 df-map 8499 df-pm 8500 df-ixp 8568 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-fi 9016 df-sup 9047 df-inf 9048 df-oi 9115 df-card 9538 df-acn 9541 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-div 11473 df-nn 11814 df-2 11876 df-3 11877 df-4 11878 df-5 11879 df-6 11880 df-7 11881 df-8 11882 df-9 11883 df-n0 12074 df-z 12160 df-dec 12277 df-uz 12422 df-q 12528 df-rp 12570 df-xneg 12687 df-xadd 12688 df-xmul 12689 df-ico 12924 df-icc 12925 df-fz 13079 df-fzo 13222 df-fl 13350 df-seq 13558 df-exp 13619 df-hash 13880 df-cj 14645 df-re 14646 df-im 14647 df-sqrt 14781 df-abs 14782 df-limsup 15015 df-clim 15032 df-rlim 15033 df-sum 15233 df-gz 16464 df-struct 16686 df-ndx 16687 df-slot 16688 df-base 16690 df-sets 16691 df-ress 16692 df-plusg 16780 df-mulr 16781 df-starv 16782 df-sca 16783 df-vsca 16784 df-ip 16785 df-tset 16786 df-ple 16787 df-ds 16789 df-unif 16790 df-hom 16791 df-cco 16792 df-rest 16899 df-topn 16900 df-topgen 16920 df-prds 16924 df-pws 16926 df-psmet 20327 df-xmet 20328 df-met 20329 df-bl 20330 df-mopn 20331 df-fbas 20332 df-fg 20333 df-cnfld 20336 df-top 21763 df-topon 21780 df-topsp 21802 df-bases 21815 df-cld 21888 df-ntr 21889 df-cls 21890 df-nei 21967 df-lm 22098 df-haus 22184 df-cmp 22256 df-fil 22715 df-fm 22807 df-flim 22808 df-flf 22809 df-xms 23190 df-ms 23191 df-cfil 24124 df-cau 24125 df-cmet 24126 df-totbnd 35620 df-bnd 35631 df-rrn 35678 |
This theorem is referenced by: reheibor 35691 |
Copyright terms: Public domain | W3C validator |