| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elovolm | Structured version Visualization version GIF version | ||
| Description: Elementhood in the set 𝑀 of approximations to the outer measure. (Contributed by Mario Carneiro, 16-Mar-2014.) |
| Ref | Expression |
|---|---|
| elovolm.1 | ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} |
| Ref | Expression |
|---|---|
| elovolm | ⊢ (𝐵 ∈ 𝑀 ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2740 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ↔ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) | |
| 2 | 1 | anbi2d 631 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 3 | 2 | rexbidv 3161 | . . 3 ⊢ (𝑦 = 𝐵 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 4 | elovolm.1 | . . 3 ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} | |
| 5 | 3, 4 | elrab2 3637 | . 2 ⊢ (𝐵 ∈ 𝑀 ↔ (𝐵 ∈ ℝ* ∧ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 6 | elovolmlem 25441 | . . . . . . . . . 10 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ↔ 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ))) | |
| 7 | eqid 2736 | . . . . . . . . . . 11 ⊢ ((abs ∘ − ) ∘ 𝑓) = ((abs ∘ − ) ∘ 𝑓) | |
| 8 | eqid 2736 | . . . . . . . . . . 11 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓)) | |
| 9 | 7, 8 | ovolsf 25439 | . . . . . . . . . 10 ⊢ (𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞)) |
| 10 | 6, 9 | sylbi 217 | . . . . . . . . 9 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞)) |
| 11 | icossxr 13385 | . . . . . . . . 9 ⊢ (0[,)+∞) ⊆ ℝ* | |
| 12 | fss 6684 | . . . . . . . . 9 ⊢ ((seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ ℝ*) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ*) | |
| 13 | 10, 11, 12 | sylancl 587 | . . . . . . . 8 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ*) |
| 14 | frn 6675 | . . . . . . . 8 ⊢ (seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ* → ran seq1( + , ((abs ∘ − ) ∘ 𝑓)) ⊆ ℝ*) | |
| 15 | supxrcl 13267 | . . . . . . . 8 ⊢ (ran seq1( + , ((abs ∘ − ) ∘ 𝑓)) ⊆ ℝ* → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ∈ ℝ*) | |
| 16 | 13, 14, 15 | 3syl 18 | . . . . . . 7 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ∈ ℝ*) |
| 17 | eleq1 2824 | . . . . . . 7 ⊢ (𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) → (𝐵 ∈ ℝ* ↔ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ∈ ℝ*)) | |
| 18 | 16, 17 | syl5ibrcom 247 | . . . . . 6 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) → (𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) → 𝐵 ∈ ℝ*)) |
| 19 | 18 | imp 406 | . . . . 5 ⊢ ((𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → 𝐵 ∈ ℝ*) |
| 20 | 19 | adantrl 717 | . . . 4 ⊢ ((𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) → 𝐵 ∈ ℝ*) |
| 21 | 20 | rexlimiva 3130 | . . 3 ⊢ (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → 𝐵 ∈ ℝ*) |
| 22 | 21 | pm4.71ri 560 | . 2 ⊢ (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐵 ∈ ℝ* ∧ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 23 | 5, 22 | bitr4i 278 | 1 ⊢ (𝐵 ∈ 𝑀 ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 {crab 3389 ∩ cin 3888 ⊆ wss 3889 ∪ cuni 4850 × cxp 5629 ran crn 5632 ∘ ccom 5635 ⟶wf 6494 (class class class)co 7367 ↑m cmap 8773 supcsup 9353 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 +∞cpnf 11176 ℝ*cxr 11178 < clt 11179 ≤ cle 11180 − cmin 11377 ℕcn 12174 (,)cioo 13298 [,)cico 13300 seqcseq 13963 abscabs 15196 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 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 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-ico 13304 df-fz 13462 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 |
| This theorem is referenced by: elovolmr 25443 ovolmge0 25444 ovolicc2 25489 |
| Copyright terms: Public domain | W3C validator |