MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ovoliunlem3 Structured version   Visualization version   GIF version

Theorem ovoliunlem3 25882
Description: Lemma for ovoliun 25883. (Contributed by Mario Carneiro, 12-Jun-2014.)
Hypotheses
Ref Expression
ovoliun.t 𝑇 = seq1( + , 𝐺)
ovoliun.g 𝐺 = (𝑛 ∈ ℕ ↦ (vol*‘𝐴))
ovoliun.a ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ⊆ ℝ)
ovoliun.v ((𝜑 ∧ 𝑛 ∈ ℕ) → (vol*‘𝐴) ∈ ℝ)
ovoliun.r (𝜑 → sup(ran 𝑇, ℝ*, < ) ∈ ℝ)
ovoliun.b (𝜑 → 𝐵 ∈ ℝ+)
Assertion
Ref Expression
ovoliunlem3 (𝜑 → (vol*‘∪ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))
Distinct variable groups:   𝐵,𝑛   𝜑,𝑛   𝑛,𝐺   𝑇,𝑛
Allowed substitution hint:   𝐴(𝑛)

Proof of Theorem ovoliunlem3
Dummy variables 𝑓 𝑔 𝑗 𝑘 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfcv 2929 . . . 4 Ⅎ𝑚𝐴
2 nfcsb1v 3874 . . . 4 Ⅎ𝑛⦋𝑚 / 𝑛⦌𝐴
3 csbeq1a 3864 . . . 4 (𝑛 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑛⦌𝐴)
41, 2, 3cbviun 4997 . . 3 ∪ 𝑛 ∈ ℕ 𝐴 = ∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴
54fveq2i 6918 . 2 (vol*‘∪ 𝑛 ∈ ℕ 𝐴) = (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴)
6 ovoliun.a . . . . . 6 ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ⊆ ℝ)
7 ovoliun.v . . . . . 6 ((𝜑 ∧ 𝑛 ∈ ℕ) → (vol*‘𝐴) ∈ ℝ)
8 ovoliun.b . . . . . . 7 (𝜑 → 𝐵 ∈ ℝ+)
9 2nn 12455 . . . . . . . . 9 2 ∈ ℕ
10 nnnn0 12652 . . . . . . . . 9 (𝑛 ∈ ℕ → 𝑛 ∈ ℕ0)
11 nnexpcl 14256 . . . . . . . . 9 ((2 ∈ ℕ ∧ 𝑛 ∈ ℕ0) → (2↑𝑛) ∈ ℕ)
129, 10, 11sylancr 599 . . . . . . . 8 (𝑛 ∈ ℕ → (2↑𝑛) ∈ ℕ)
1312nnrpd 13201 . . . . . . 7 (𝑛 ∈ ℕ → (2↑𝑛) ∈ ℝ+)
14 rpdivcl 13186 . . . . . . 7 ((𝐵 ∈ ℝ+ ∧ (2↑𝑛) ∈ ℝ+) → (𝐵 / (2↑𝑛)) ∈ ℝ+)
158, 13, 14syl2an 608 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵 / (2↑𝑛)) ∈ ℝ+)
16 eqid 2766 . . . . . . 7 seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
1716ovolgelb 25858 . . . . . 6 ((𝐴 ⊆ ℝ ∧ (vol*‘𝐴) ∈ ℝ ∧ (𝐵 / (2↑𝑛)) ∈ ℝ+) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))
186, 7, 15, 17syl3anc 1401 . . . . 5 ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))
1918ralrimiva 3161 . . . 4 (𝜑 → ∀𝑛 ∈ ℕ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))
20 ovex 7483 . . . . 5 (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∈ V
21 nnenom 14162 . . . . 5 ℕ ≈ ω
22 coeq2 5846 . . . . . . . . 9 (𝑓 = (𝑔‘𝑛) → ((,) ∘ 𝑓) = ((,) ∘ (𝑔‘𝑛)))
2322rneqd 5931 . . . . . . . 8 (𝑓 = (𝑔‘𝑛) → ran ((,) ∘ 𝑓) = ran ((,) ∘ (𝑔‘𝑛)))
2423unieqd 4884 . . . . . . 7 (𝑓 = (𝑔‘𝑛) → ∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ (𝑔‘𝑛)))
2524sseq2d 3944 . . . . . 6 (𝑓 = (𝑔‘𝑛) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ↔ 𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛))))
26 coeq2 5846 . . . . . . . . . 10 (𝑓 = (𝑔‘𝑛) → ((abs ∘ − ) ∘ 𝑓) = ((abs ∘ − ) ∘ (𝑔‘𝑛)))
2726seqeq3d 14191 . . . . . . . . 9 (𝑓 = (𝑔‘𝑛) → seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))))
2827rneqd 5931 . . . . . . . 8 (𝑓 = (𝑔‘𝑛) → ran seq1( + , ((abs ∘ − ) ∘ 𝑓)) = ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))))
2928supeq1d 9474 . . . . . . 7 (𝑓 = (𝑔‘𝑛) → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ))
3029breq1d 5117 . . . . . 6 (𝑓 = (𝑔‘𝑛) → (sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))) ↔ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))
3125, 30anbi12d 644 . . . . 5 (𝑓 = (𝑔‘𝑛) → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))))
3220, 21, 31axcc4 10555 . . . 4 (∀𝑛 ∈ ℕ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))) → ∃𝑔(𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))))
3319, 32syl 18 . . 3 (𝜑 → ∃𝑔(𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))))
34 xpnnen 16421 . . . . . . 7 (ℕ × ℕ) ≈ ℕ
3534ensymi 9068 . . . . . 6 ℕ ≈ (ℕ × ℕ)
36 bren 9020 . . . . . 6 (ℕ ≈ (ℕ × ℕ) ↔ ∃𝑗 𝑗:ℕ⟶1-1onto(ℕ × ℕ))
3735, 36mpbi 233 . . . . 5 ∃𝑗 𝑗:ℕ⟶1-1onto(ℕ × ℕ)
38 ovoliun.t . . . . . . . 8 𝑇 = seq1( + , 𝐺)
39 ovoliun.g . . . . . . . . 9 𝐺 = (𝑛 ∈ ℕ ↦ (vol*‘𝐴))
40 nfcv 2929 . . . . . . . . . 10 Ⅎ𝑚(vol*‘𝐴)
41 nfcv 2929 . . . . . . . . . . 11 Ⅎ𝑛vol*
4241, 2nffv 6925 . . . . . . . . . 10 Ⅎ𝑛(vol*‘⦋𝑚 / 𝑛⦌𝐴)
433fveq2d 6919 . . . . . . . . . 10 (𝑛 = 𝑚 → (vol*‘𝐴) = (vol*‘⦋𝑚 / 𝑛⦌𝐴))
4440, 42, 43cbvmpt 5212 . . . . . . . . 9 (𝑛 ∈ ℕ ↦ (vol*‘𝐴)) = (𝑚 ∈ ℕ ↦ (vol*‘⦋𝑚 / 𝑛⦌𝐴))
4539, 44eqtri 2789 . . . . . . . 8 𝐺 = (𝑚 ∈ ℕ ↦ (vol*‘⦋𝑚 / 𝑛⦌𝐴))
466ralrimiva 3161 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ 𝐴 ⊆ ℝ)
47 nfv 1951 . . . . . . . . . . . 12 Ⅎ𝑚 𝐴 ⊆ ℝ
48 nfcv 2929 . . . . . . . . . . . . 13 Ⅎ𝑛ℝ
492, 48nfss 3905 . . . . . . . . . . . 12 Ⅎ𝑛⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ
503sseq1d 3943 . . . . . . . . . . . 12 (𝑛 = 𝑚 → (𝐴 ⊆ ℝ ↔ ⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ))
5147, 49, 50cbvralw 3308 . . . . . . . . . . 11 (∀𝑛 ∈ ℕ 𝐴 ⊆ ℝ ↔ ∀𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ)
5246, 51sylib 221 . . . . . . . . . 10 (𝜑 → ∀𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ)
5352r19.21bi 3258 . . . . . . . . 9 ((𝜑 ∧ 𝑚 ∈ ℕ) → ⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ)
5453ad4ant14 765 . . . . . . . 8 ((((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) ∧ 𝑚 ∈ ℕ) → ⦋𝑚 / 𝑛⦌𝐴 ⊆ ℝ)
557ralrimiva 3161 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ (vol*‘𝐴) ∈ ℝ)
5640nfel1 2945 . . . . . . . . . . . 12 Ⅎ𝑚(vol*‘𝐴) ∈ ℝ
5742nfel1 2945 . . . . . . . . . . . 12 Ⅎ𝑛(vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ
5843eleq1d 2852 . . . . . . . . . . . 12 (𝑛 = 𝑚 → ((vol*‘𝐴) ∈ ℝ ↔ (vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ))
5956, 57, 58cbvralw 3308 . . . . . . . . . . 11 (∀𝑛 ∈ ℕ (vol*‘𝐴) ∈ ℝ ↔ ∀𝑚 ∈ ℕ (vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ)
6055, 59sylib 221 . . . . . . . . . 10 (𝜑 → ∀𝑚 ∈ ℕ (vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ)
6160r19.21bi 3258 . . . . . . . . 9 ((𝜑 ∧ 𝑚 ∈ ℕ) → (vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ)
6261ad4ant14 765 . . . . . . . 8 ((((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) ∧ 𝑚 ∈ ℕ) → (vol*‘⦋𝑚 / 𝑛⦌𝐴) ∈ ℝ)
63 ovoliun.r . . . . . . . . 9 (𝜑 → sup(ran 𝑇, ℝ*, < ) ∈ ℝ)
6463ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → sup(ran 𝑇, ℝ*, < ) ∈ ℝ)
658ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → 𝐵 ∈ ℝ+)
66 eqid 2766 . . . . . . . 8 seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))) = seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚)))
67 eqid 2766 . . . . . . . 8 seq1( + , ((abs ∘ − ) ∘ (𝑘 ∈ ℕ ↦ ((𝑔‘(1st ‘(𝑗‘𝑘)))‘(2nd ‘(𝑗‘𝑘)))))) = seq1( + , ((abs ∘ − ) ∘ (𝑘 ∈ ℕ ↦ ((𝑔‘(1st ‘(𝑗‘𝑘)))‘(2nd ‘(𝑗‘𝑘))))))
68 eqid 2766 . . . . . . . 8 (𝑘 ∈ ℕ ↦ ((𝑔‘(1st ‘(𝑗‘𝑘)))‘(2nd ‘(𝑗‘𝑘)))) = (𝑘 ∈ ℕ ↦ ((𝑔‘(1st ‘(𝑗‘𝑘)))‘(2nd ‘(𝑗‘𝑘))))
69 simplr 781 . . . . . . . 8 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → 𝑗:ℕ⟶1-1onto(ℕ × ℕ))
70 simprl 783 . . . . . . . 8 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → 𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ))
71 simprr 785 . . . . . . . . . . 11 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))
72 nfv 1951 . . . . . . . . . . . 12 Ⅎ𝑚(𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))
73 nfcv 2929 . . . . . . . . . . . . . 14 Ⅎ𝑛∪ ran ((,) ∘ (𝑔‘𝑚))
742, 73nfss 3905 . . . . . . . . . . . . 13 Ⅎ𝑛⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚))
75 nfcv 2929 . . . . . . . . . . . . . 14 Ⅎ𝑛sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < )
76 nfcv 2929 . . . . . . . . . . . . . 14 Ⅎ𝑛 ≤
77 nfcv 2929 . . . . . . . . . . . . . . 15 Ⅎ𝑛 +
78 nfcv 2929 . . . . . . . . . . . . . . 15 Ⅎ𝑛(𝐵 / (2↑𝑚))
7942, 77, 78nfov 7480 . . . . . . . . . . . . . 14 Ⅎ𝑛((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))
8075, 76, 79nfbr 5157 . . . . . . . . . . . . 13 Ⅎ𝑛sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))
8174, 80nfan 1936 . . . . . . . . . . . 12 Ⅎ𝑛(⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚))))
82 fveq2 6915 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑚 → (𝑔‘𝑛) = (𝑔‘𝑚))
8382coeq2d 5850 . . . . . . . . . . . . . . . 16 (𝑛 = 𝑚 → ((,) ∘ (𝑔‘𝑛)) = ((,) ∘ (𝑔‘𝑚)))
8483rneqd 5931 . . . . . . . . . . . . . . 15 (𝑛 = 𝑚 → ran ((,) ∘ (𝑔‘𝑛)) = ran ((,) ∘ (𝑔‘𝑚)))
8584unieqd 4884 . . . . . . . . . . . . . 14 (𝑛 = 𝑚 → ∪ ran ((,) ∘ (𝑔‘𝑛)) = ∪ ran ((,) ∘ (𝑔‘𝑚)))
863, 85sseq12d 3945 . . . . . . . . . . . . 13 (𝑛 = 𝑚 → (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ↔ ⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚))))
8782coeq2d 5850 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑚 → ((abs ∘ − ) ∘ (𝑔‘𝑛)) = ((abs ∘ − ) ∘ (𝑔‘𝑚)))
8887seqeq3d 14191 . . . . . . . . . . . . . . . 16 (𝑛 = 𝑚 → seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))) = seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))))
8988rneqd 5931 . . . . . . . . . . . . . . 15 (𝑛 = 𝑚 → ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))) = ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))))
9089supeq1d 9474 . . . . . . . . . . . . . 14 (𝑛 = 𝑚 → sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ))
91 oveq2 7458 . . . . . . . . . . . . . . . 16 (𝑛 = 𝑚 → (2↑𝑛) = (2↑𝑚))
9291oveq2d 7466 . . . . . . . . . . . . . . 15 (𝑛 = 𝑚 → (𝐵 / (2↑𝑛)) = (𝐵 / (2↑𝑚)))
9343, 92oveq12d 7468 . . . . . . . . . . . . . 14 (𝑛 = 𝑚 → ((vol*‘𝐴) + (𝐵 / (2↑𝑛))) = ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚))))
9490, 93breq12d 5120 . . . . . . . . . . . . 13 (𝑛 = 𝑚 → (sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))) ↔ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))))
9586, 94anbi12d 644 . . . . . . . . . . . 12 (𝑛 = 𝑚 → ((𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))) ↔ (⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚))))))
9672, 81, 95cbvralw 3308 . . . . . . . . . . 11 (∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))) ↔ ∀𝑚 ∈ ℕ (⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))))
9771, 96sylib 221 . . . . . . . . . 10 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → ∀𝑚 ∈ ℕ (⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))))
9897r19.21bi 3258 . . . . . . . . 9 ((((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) ∧ 𝑚 ∈ ℕ) → (⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚)))))
9998simpld 500 . . . . . . . 8 ((((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) ∧ 𝑚 ∈ ℕ) → ⦋𝑚 / 𝑛⦌𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑚)))
10098simprd 501 . . . . . . . 8 ((((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) ∧ 𝑚 ∈ ℕ) → sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑚))), ℝ*, < ) ≤ ((vol*‘⦋𝑚 / 𝑛⦌𝐴) + (𝐵 / (2↑𝑚))))
10138, 45, 54, 62, 64, 65, 66, 67, 68, 69, 70, 99, 100ovoliunlem2 25881 . . . . . . 7 (((𝜑 ∧ 𝑗:ℕ⟶1-1onto(ℕ × ℕ)) ∧ (𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛)))))) → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))
102101exp31 425 . . . . . 6 (𝜑 → (𝑗:ℕ⟶1-1onto(ℕ × ℕ) → ((𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))) → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))))
103102exlimdv 1970 . . . . 5 (𝜑 → (∃𝑗 𝑗:ℕ⟶1-1onto(ℕ × ℕ) → ((𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))) → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))))
10437, 103mpi 21 . . . 4 (𝜑 → ((𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))) → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵)))
105104exlimdv 1970 . . 3 (𝜑 → (∃𝑔(𝑔:ℕ⟶(( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐴 ⊆ ∪ ran ((,) ∘ (𝑔‘𝑛)) ∧ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑔‘𝑛))), ℝ*, < ) ≤ ((vol*‘𝐴) + (𝐵 / (2↑𝑛))))) → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵)))
10633, 105mpd 16 . 2 (𝜑 → (vol*‘∪ 𝑚 ∈ ℕ ⦋𝑚 / 𝑛⦌𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))
1075, 106eqbrtrid 5145 1 (𝜑 → (vol*‘∪ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093  ⦋csb 3850   ⊆ wss 3899   ∩ cin 4091  ∪ cuni 4871  ∪ ciun 4955   class class class wbr 5107   ↦ cmpt 5191   × cxp 5655  ran crn 5658   ∘ ccom 5661  ⟶wf 6561  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033   ↑m cmap 8884   ≈ cen 9007  supcsup 9468  ℝcr 11237  1c1 11239   + caddc 11241  ℝ*cxr 11380   < clt 11381   ≤ cle 11382   − cmin 11579   / cdiv 12012  ℕcn 12374  2c2 12436  ℕ0cn0 12645  ℝ+crp 13159  (,)cioo 13515  seqcseq 14183  ↑cexp 14243  abscabs 15443  vol*covol 25840
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-inf2 9678  ax-cc 10551  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315  ax-pre-sup 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-isom 6574  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-pm 8887  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-sup 9470  df-inf 9471  df-oi 9540  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-div 12013  df-nn 12375  df-2 12444  df-3 12445  df-n0 12646  df-z 12733  df-uz 13005  df-rp 13160  df-ioo 13519  df-ico 13521  df-fz 13679  df-fzo 13828  df-fl 13971  df-seq 14184  df-exp 14244  df-hash 14515  df-cj 15308  df-re 15309  df-im 15310  df-sqrt 15444  df-abs 15445  df-clim 15698  df-rlim 15699  df-sum 15897  df-ovol 25842
This theorem is used by:  ovoliun  25883
  Copyright terms: Public domain W3C validator