| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ovollb | Structured version Visualization version GIF version | ||
| Description: The outer volume is a lower bound on the sum of all interval coverings of 𝐴. (Contributed by Mario Carneiro, 15-Jun-2014.) |
| Ref | Expression |
|---|---|
| ovollb.1 | ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) |
| Ref | Expression |
|---|---|
| ovollb | ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → (vol*‘𝐴) ≤ sup(ran 𝑆, ℝ*, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 484 | . . . 4 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) | |
| 2 | ioof 13384 | . . . . . . 7 ⊢ (,):(ℝ* × ℝ*)⟶𝒫 ℝ | |
| 3 | simpl 482 | . . . . . . . 8 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) | |
| 4 | inss2 4197 | . . . . . . . . 9 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ) | |
| 5 | rexpssxrxp 11195 | . . . . . . . . 9 ⊢ (ℝ × ℝ) ⊆ (ℝ* × ℝ*) | |
| 6 | 4, 5 | sstri 3953 | . . . . . . . 8 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*) |
| 7 | fss 6686 | . . . . . . . 8 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)) → 𝐹:ℕ⟶(ℝ* × ℝ*)) | |
| 8 | 3, 6, 7 | sylancl 586 | . . . . . . 7 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → 𝐹:ℕ⟶(ℝ* × ℝ*)) |
| 9 | fco 6694 | . . . . . . 7 ⊢ (((,):(ℝ* × ℝ*)⟶𝒫 ℝ ∧ 𝐹:ℕ⟶(ℝ* × ℝ*)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ) | |
| 10 | 2, 8, 9 | sylancr 587 | . . . . . 6 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → ((,) ∘ 𝐹):ℕ⟶𝒫 ℝ) |
| 11 | 10 | frnd 6678 | . . . . 5 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → ran ((,) ∘ 𝐹) ⊆ 𝒫 ℝ) |
| 12 | sspwuni 5059 | . . . . 5 ⊢ (ran ((,) ∘ 𝐹) ⊆ 𝒫 ℝ ↔ ∪ ran ((,) ∘ 𝐹) ⊆ ℝ) | |
| 13 | 11, 12 | sylib 218 | . . . 4 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → ∪ ran ((,) ∘ 𝐹) ⊆ ℝ) |
| 14 | 1, 13 | sstrd 3954 | . . 3 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → 𝐴 ⊆ ℝ) |
| 15 | eqid 2729 | . . . 4 ⊢ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} | |
| 16 | 15 | ovolval 25407 | . . 3 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < )) |
| 17 | 14, 16 | syl 17 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → (vol*‘𝐴) = inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < )) |
| 18 | ssrab2 4039 | . . 3 ⊢ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} ⊆ ℝ* | |
| 19 | ovollb.1 | . . . 4 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
| 20 | 15, 19 | elovolmr 25410 | . . 3 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → sup(ran 𝑆, ℝ*, < ) ∈ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}) |
| 21 | infxrlb 13271 | . . 3 ⊢ (({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} ⊆ ℝ* ∧ sup(ran 𝑆, ℝ*, < ) ∈ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}) → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) ≤ sup(ran 𝑆, ℝ*, < )) | |
| 22 | 18, 20, 21 | sylancr 587 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) ≤ sup(ran 𝑆, ℝ*, < )) |
| 23 | 17, 22 | eqbrtrd 5124 | 1 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → (vol*‘𝐴) ≤ sup(ran 𝑆, ℝ*, < )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 {crab 3402 ∩ cin 3910 ⊆ wss 3911 𝒫 cpw 4559 ∪ cuni 4867 class class class wbr 5102 × cxp 5629 ran crn 5632 ∘ ccom 5635 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 ↑m cmap 8776 supcsup 9367 infcinf 9368 ℝcr 11043 1c1 11045 + caddc 11047 ℝ*cxr 11183 < clt 11184 ≤ cle 11185 − cmin 11381 ℕcn 12162 (,)cioo 13282 seqcseq 13942 abscabs 15176 vol*covol 25396 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-n0 12419 df-z 12506 df-uz 12770 df-rp 12928 df-ioo 13286 df-ico 13288 df-fz 13445 df-seq 13943 df-exp 14003 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-ovol 25398 |
| This theorem is referenced by: ovollb2lem 25422 ovolunlem1 25431 ovoliunlem1 25436 ovoliunlem2 25437 ovolscalem1 25447 uniioovol 25513 uniioombllem3 25519 uniioombllem4 25520 uniioombllem5 25521 mblfinlem3 37646 mblfinlem4 37647 ismblfin 37648 |
| Copyright terms: Public domain | W3C validator |