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

Theorem ovoliun 23273
Description: The Lebesgue outer measure function is countably sub-additive. (Many books allow +∞ as a value for one of the sets in the sum, but in our setup we can't do arithmetic on infinity, and in any case the volume of a union containing an infinitely large set is already infinitely large by monotonicity ovolss 23253, so we need not consider this case here, although we do allow the sum itself to be infinite.) (Contributed by Mario Carneiro, 12-Jun-2014.)
Hypotheses
Ref Expression
ovoliun.t 𝑇 = seq1( + , 𝐺)
ovoliun.g 𝐺 = (𝑛 ∈ ℕ ↦ (vol*‘𝐴))
ovoliun.a ((𝜑𝑛 ∈ ℕ) → 𝐴 ⊆ ℝ)
ovoliun.v ((𝜑𝑛 ∈ ℕ) → (vol*‘𝐴) ∈ ℝ)
Assertion
Ref Expression
ovoliun (𝜑 → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ))
Distinct variable group:   𝜑,𝑛
Allowed substitution hints:   𝐴(𝑛)   𝑇(𝑛)   𝐺(𝑛)

Proof of Theorem ovoliun
Dummy variables 𝑘 𝑚 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nnuz 11723 . . . . . . . . . 10 ℕ = (ℤ‘1)
2 1zzd 11408 . . . . . . . . . 10 (𝜑 → 1 ∈ ℤ)
3 ovoliun.v . . . . . . . . . . . 12 ((𝜑𝑛 ∈ ℕ) → (vol*‘𝐴) ∈ ℝ)
4 ovoliun.g . . . . . . . . . . . 12 𝐺 = (𝑛 ∈ ℕ ↦ (vol*‘𝐴))
53, 4fmptd 6385 . . . . . . . . . . 11 (𝜑𝐺:ℕ⟶ℝ)
65ffvelrnda 6359 . . . . . . . . . 10 ((𝜑𝑘 ∈ ℕ) → (𝐺𝑘) ∈ ℝ)
71, 2, 6serfre 12830 . . . . . . . . 9 (𝜑 → seq1( + , 𝐺):ℕ⟶ℝ)
8 ovoliun.t . . . . . . . . . 10 𝑇 = seq1( + , 𝐺)
98feq1i 6036 . . . . . . . . 9 (𝑇:ℕ⟶ℝ ↔ seq1( + , 𝐺):ℕ⟶ℝ)
107, 9sylibr 224 . . . . . . . 8 (𝜑𝑇:ℕ⟶ℝ)
11 frn 6053 . . . . . . . 8 (𝑇:ℕ⟶ℝ → ran 𝑇 ⊆ ℝ)
1210, 11syl 17 . . . . . . 7 (𝜑 → ran 𝑇 ⊆ ℝ)
13 ressxr 10083 . . . . . . 7 ℝ ⊆ ℝ*
1412, 13syl6ss 3615 . . . . . 6 (𝜑 → ran 𝑇 ⊆ ℝ*)
15 supxrcl 12145 . . . . . 6 (ran 𝑇 ⊆ ℝ* → sup(ran 𝑇, ℝ*, < ) ∈ ℝ*)
1614, 15syl 17 . . . . 5 (𝜑 → sup(ran 𝑇, ℝ*, < ) ∈ ℝ*)
17 xrrebnd 11999 . . . . 5 (sup(ran 𝑇, ℝ*, < ) ∈ ℝ* → (sup(ran 𝑇, ℝ*, < ) ∈ ℝ ↔ (-∞ < sup(ran 𝑇, ℝ*, < ) ∧ sup(ran 𝑇, ℝ*, < ) < +∞)))
1816, 17syl 17 . . . 4 (𝜑 → (sup(ran 𝑇, ℝ*, < ) ∈ ℝ ↔ (-∞ < sup(ran 𝑇, ℝ*, < ) ∧ sup(ran 𝑇, ℝ*, < ) < +∞)))
19 mnfxr 10096 . . . . . . 7 -∞ ∈ ℝ*
2019a1i 11 . . . . . 6 (𝜑 → -∞ ∈ ℝ*)
21 1nn 11031 . . . . . . . 8 1 ∈ ℕ
22 ffvelrn 6357 . . . . . . . 8 ((𝑇:ℕ⟶ℝ ∧ 1 ∈ ℕ) → (𝑇‘1) ∈ ℝ)
2310, 21, 22sylancl 694 . . . . . . 7 (𝜑 → (𝑇‘1) ∈ ℝ)
2423rexrd 10089 . . . . . 6 (𝜑 → (𝑇‘1) ∈ ℝ*)
25 mnflt 11957 . . . . . . 7 ((𝑇‘1) ∈ ℝ → -∞ < (𝑇‘1))
2623, 25syl 17 . . . . . 6 (𝜑 → -∞ < (𝑇‘1))
27 ffn 6045 . . . . . . . . 9 (𝑇:ℕ⟶ℝ → 𝑇 Fn ℕ)
2810, 27syl 17 . . . . . . . 8 (𝜑𝑇 Fn ℕ)
29 fnfvelrn 6356 . . . . . . . 8 ((𝑇 Fn ℕ ∧ 1 ∈ ℕ) → (𝑇‘1) ∈ ran 𝑇)
3028, 21, 29sylancl 694 . . . . . . 7 (𝜑 → (𝑇‘1) ∈ ran 𝑇)
31 supxrub 12154 . . . . . . 7 ((ran 𝑇 ⊆ ℝ* ∧ (𝑇‘1) ∈ ran 𝑇) → (𝑇‘1) ≤ sup(ran 𝑇, ℝ*, < ))
3214, 30, 31syl2anc 693 . . . . . 6 (𝜑 → (𝑇‘1) ≤ sup(ran 𝑇, ℝ*, < ))
3320, 24, 16, 26, 32xrltletrd 11992 . . . . 5 (𝜑 → -∞ < sup(ran 𝑇, ℝ*, < ))
3433biantrurd 529 . . . 4 (𝜑 → (sup(ran 𝑇, ℝ*, < ) < +∞ ↔ (-∞ < sup(ran 𝑇, ℝ*, < ) ∧ sup(ran 𝑇, ℝ*, < ) < +∞)))
3518, 34bitr4d 271 . . 3 (𝜑 → (sup(ran 𝑇, ℝ*, < ) ∈ ℝ ↔ sup(ran 𝑇, ℝ*, < ) < +∞))
36 nfcv 2764 . . . . . . . . 9 𝑚𝐴
37 nfcsb1v 3549 . . . . . . . . 9 𝑛𝑚 / 𝑛𝐴
38 csbeq1a 3542 . . . . . . . . 9 (𝑛 = 𝑚𝐴 = 𝑚 / 𝑛𝐴)
3936, 37, 38cbviun 4557 . . . . . . . 8 𝑛 ∈ ℕ 𝐴 = 𝑚 ∈ ℕ 𝑚 / 𝑛𝐴
4039fveq2i 6194 . . . . . . 7 (vol*‘ 𝑛 ∈ ℕ 𝐴) = (vol*‘ 𝑚 ∈ ℕ 𝑚 / 𝑛𝐴)
41 nfcv 2764 . . . . . . . . . 10 𝑚(vol*‘𝐴)
42 nfcv 2764 . . . . . . . . . . 11 𝑛vol*
4342, 37nffv 6198 . . . . . . . . . 10 𝑛(vol*‘𝑚 / 𝑛𝐴)
4438fveq2d 6195 . . . . . . . . . 10 (𝑛 = 𝑚 → (vol*‘𝐴) = (vol*‘𝑚 / 𝑛𝐴))
4541, 43, 44cbvmpt 4749 . . . . . . . . 9 (𝑛 ∈ ℕ ↦ (vol*‘𝐴)) = (𝑚 ∈ ℕ ↦ (vol*‘𝑚 / 𝑛𝐴))
464, 45eqtri 2644 . . . . . . . 8 𝐺 = (𝑚 ∈ ℕ ↦ (vol*‘𝑚 / 𝑛𝐴))
47 ovoliun.a . . . . . . . . . . . 12 ((𝜑𝑛 ∈ ℕ) → 𝐴 ⊆ ℝ)
4847ralrimiva 2966 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ 𝐴 ⊆ ℝ)
49 nfv 1843 . . . . . . . . . . . 12 𝑚 𝐴 ⊆ ℝ
50 nfcv 2764 . . . . . . . . . . . . 13 𝑛
5137, 50nfss 3596 . . . . . . . . . . . 12 𝑛𝑚 / 𝑛𝐴 ⊆ ℝ
5238sseq1d 3632 . . . . . . . . . . . 12 (𝑛 = 𝑚 → (𝐴 ⊆ ℝ ↔ 𝑚 / 𝑛𝐴 ⊆ ℝ))
5349, 51, 52cbvral 3167 . . . . . . . . . . 11 (∀𝑛 ∈ ℕ 𝐴 ⊆ ℝ ↔ ∀𝑚 ∈ ℕ 𝑚 / 𝑛𝐴 ⊆ ℝ)
5448, 53sylib 208 . . . . . . . . . 10 (𝜑 → ∀𝑚 ∈ ℕ 𝑚 / 𝑛𝐴 ⊆ ℝ)
5554ad2antrr 762 . . . . . . . . 9 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → ∀𝑚 ∈ ℕ 𝑚 / 𝑛𝐴 ⊆ ℝ)
5655r19.21bi 2932 . . . . . . . 8 ((((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) ∧ 𝑚 ∈ ℕ) → 𝑚 / 𝑛𝐴 ⊆ ℝ)
573ralrimiva 2966 . . . . . . . . . . 11 (𝜑 → ∀𝑛 ∈ ℕ (vol*‘𝐴) ∈ ℝ)
5841nfel1 2779 . . . . . . . . . . . 12 𝑚(vol*‘𝐴) ∈ ℝ
5943nfel1 2779 . . . . . . . . . . . 12 𝑛(vol*‘𝑚 / 𝑛𝐴) ∈ ℝ
6044eleq1d 2686 . . . . . . . . . . . 12 (𝑛 = 𝑚 → ((vol*‘𝐴) ∈ ℝ ↔ (vol*‘𝑚 / 𝑛𝐴) ∈ ℝ))
6158, 59, 60cbvral 3167 . . . . . . . . . . 11 (∀𝑛 ∈ ℕ (vol*‘𝐴) ∈ ℝ ↔ ∀𝑚 ∈ ℕ (vol*‘𝑚 / 𝑛𝐴) ∈ ℝ)
6257, 61sylib 208 . . . . . . . . . 10 (𝜑 → ∀𝑚 ∈ ℕ (vol*‘𝑚 / 𝑛𝐴) ∈ ℝ)
6362ad2antrr 762 . . . . . . . . 9 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → ∀𝑚 ∈ ℕ (vol*‘𝑚 / 𝑛𝐴) ∈ ℝ)
6463r19.21bi 2932 . . . . . . . 8 ((((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) ∧ 𝑚 ∈ ℕ) → (vol*‘𝑚 / 𝑛𝐴) ∈ ℝ)
65 simplr 792 . . . . . . . 8 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → sup(ran 𝑇, ℝ*, < ) ∈ ℝ)
66 simpr 477 . . . . . . . 8 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → 𝑥 ∈ ℝ+)
678, 46, 56, 64, 65, 66ovoliunlem3 23272 . . . . . . 7 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → (vol*‘ 𝑚 ∈ ℕ 𝑚 / 𝑛𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝑥))
6840, 67syl5eqbr 4688 . . . . . 6 (((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) ∧ 𝑥 ∈ ℝ+) → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝑥))
6968ralrimiva 2966 . . . . 5 ((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) → ∀𝑥 ∈ ℝ+ (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝑥))
70 iunss 4561 . . . . . . . 8 ( 𝑛 ∈ ℕ 𝐴 ⊆ ℝ ↔ ∀𝑛 ∈ ℕ 𝐴 ⊆ ℝ)
7148, 70sylibr 224 . . . . . . 7 (𝜑 𝑛 ∈ ℕ 𝐴 ⊆ ℝ)
72 ovolcl 23246 . . . . . . 7 ( 𝑛 ∈ ℕ 𝐴 ⊆ ℝ → (vol*‘ 𝑛 ∈ ℕ 𝐴) ∈ ℝ*)
7371, 72syl 17 . . . . . 6 (𝜑 → (vol*‘ 𝑛 ∈ ℕ 𝐴) ∈ ℝ*)
74 xralrple 12036 . . . . . 6 (((vol*‘ 𝑛 ∈ ℕ 𝐴) ∈ ℝ* ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) → ((vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ) ↔ ∀𝑥 ∈ ℝ+ (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝑥)))
7573, 74sylan 488 . . . . 5 ((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) → ((vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ) ↔ ∀𝑥 ∈ ℝ+ (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ (sup(ran 𝑇, ℝ*, < ) + 𝑥)))
7669, 75mpbird 247 . . . 4 ((𝜑 ∧ sup(ran 𝑇, ℝ*, < ) ∈ ℝ) → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ))
7776ex 450 . . 3 (𝜑 → (sup(ran 𝑇, ℝ*, < ) ∈ ℝ → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < )))
7835, 77sylbird 250 . 2 (𝜑 → (sup(ran 𝑇, ℝ*, < ) < +∞ → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < )))
79 nltpnft 11995 . . . 4 (sup(ran 𝑇, ℝ*, < ) ∈ ℝ* → (sup(ran 𝑇, ℝ*, < ) = +∞ ↔ ¬ sup(ran 𝑇, ℝ*, < ) < +∞))
8016, 79syl 17 . . 3 (𝜑 → (sup(ran 𝑇, ℝ*, < ) = +∞ ↔ ¬ sup(ran 𝑇, ℝ*, < ) < +∞))
81 pnfge 11964 . . . . 5 ((vol*‘ 𝑛 ∈ ℕ 𝐴) ∈ ℝ* → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ +∞)
8273, 81syl 17 . . . 4 (𝜑 → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ +∞)
83 breq2 4657 . . . 4 (sup(ran 𝑇, ℝ*, < ) = +∞ → ((vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ) ↔ (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ +∞))
8482, 83syl5ibrcom 237 . . 3 (𝜑 → (sup(ran 𝑇, ℝ*, < ) = +∞ → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < )))
8580, 84sylbird 250 . 2 (𝜑 → (¬ sup(ran 𝑇, ℝ*, < ) < +∞ → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < )))
8678, 85pm2.61d 170 1 (𝜑 → (vol*‘ 𝑛 ∈ ℕ 𝐴) ≤ sup(ran 𝑇, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wral 2912  csb 3533  wss 3574   ciun 4520   class class class wbr 4653  cmpt 4729  ran crn 5115   Fn wfn 5883  wf 5884  cfv 5888  (class class class)co 6650  supcsup 8346  cr 9935  1c1 9937   + caddc 9939  +∞cpnf 10071  -∞cmnf 10072  *cxr 10073   < clt 10074  cle 10075  cn 11020  +crp 11832  seqcseq 12801  vol*covol 23231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cc 9257  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-map 7859  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-oi 8415  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-q 11789  df-rp 11833  df-ioo 12179  df-ico 12181  df-fz 12327  df-fzo 12466  df-fl 12593  df-seq 12802  df-exp 12861  df-hash 13118  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-clim 14219  df-rlim 14220  df-sum 14417  df-ovol 23233
This theorem is referenced by:  ovoliun2  23274  voliunlem2  23319  voliunlem3  23320  ex-ovoliunnfl  33452
  Copyright terms: Public domain W3C validator