Theorem mbfi1fseq 26047

Description: A characterization of measurability in terms of simple functions (this is an if and only if for nonnegative functions, although we don't prove it). Any nonnegative measurable function is the limit of an increasing sequence of nonnegative simple functions. This proof is an example of a poor de Bruijn factor - the formalized proof is much longer than an average hand proof, which usually just describes the function 𝐺 and "leaves the details as an exercise to the reader". (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)

Hypotheses

Ref	Expression
mbfi1fseq.1	⊢ (𝜑 → 𝐹 ∈ MblFn)
mbfi1fseq.2	⊢ (𝜑 → 𝐹:ℝ⟶(0[,)+∞))

Assertion

Ref	Expression
mbfi1fseq	⊢ (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (0𝑝 ∘r ≤ (𝑔‘𝑛) ∧ (𝑔‘𝑛) ∘r ≤ (𝑔‘(𝑛 + 1))) ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔‘𝑛)‘𝑥)) ⇝ (𝐹‘𝑥)))

Distinct variable groups:   𝑔,𝑛,𝑥,𝐹   𝜑,𝑛,𝑥

Allowed substitution hint:   𝜑(𝑔)

Proof of Theorem mbfi1fseq

Dummy variables 𝑗 𝑘 𝑚 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mbfi1fseq.1	. 2 ⊢ (𝜑 → 𝐹 ∈ MblFn)
2		mbfi1fseq.2	. 2 ⊢ (𝜑 → 𝐹:ℝ⟶(0[,)+∞))
3		oveq2 7428	. . . . . 6 ⊢ (𝑗 = 𝑘 → (2↑𝑗) = (2↑𝑘))
4	3	oveq2d 7436	. . . . 5 ⊢ (𝑗 = 𝑘 → ((𝐹‘𝑧) · (2↑𝑗)) = ((𝐹‘𝑧) · (2↑𝑘)))
5	4	fveq2d 6889	. . . 4 ⊢ (𝑗 = 𝑘 → (⌊‘((𝐹‘𝑧) · (2↑𝑗))) = (⌊‘((𝐹‘𝑧) · (2↑𝑘))))
6	5, 3	oveq12d 7438	. . 3 ⊢ (𝑗 = 𝑘 → ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)) = ((⌊‘((𝐹‘𝑧) · (2↑𝑘))) / (2↑𝑘)))
7		fveq2 6885	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝐹‘𝑧) = (𝐹‘𝑦))
8	7	fvoveq1d 7442	. . . 4 ⊢ (𝑧 = 𝑦 → (⌊‘((𝐹‘𝑧) · (2↑𝑘))) = (⌊‘((𝐹‘𝑦) · (2↑𝑘))))
9	8	oveq1d 7435	. . 3 ⊢ (𝑧 = 𝑦 → ((⌊‘((𝐹‘𝑧) · (2↑𝑘))) / (2↑𝑘)) = ((⌊‘((𝐹‘𝑦) · (2↑𝑘))) / (2↑𝑘)))
10	6, 9	cbvmpov 7515	. 2 ⊢ (𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗))) = (𝑘 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑦) · (2↑𝑘))) / (2↑𝑘)))
11		eleq1w 2843	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ ( -𝑚[,]𝑚) ↔ 𝑥 ∈ ( -𝑚[,]𝑚)))
12		oveq2 7428	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) = (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥))
13	12	breq1d 5112	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚 ↔ (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚))
14	13, 12	ifbieq1d 4506	. . . . . 6 ⊢ (𝑦 = 𝑥 → if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚) = if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚))
15	11, 14	ifbieq1d 4506	. . . . 5 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0) = if(𝑥 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0))
16	15	cbvmptv 5208	. . . 4 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0))
17		negeq 11552	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → -𝑚 = -𝑘)
18		id 23	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → 𝑚 = 𝑘)
19	17, 18	oveq12d 7438	. . . . . . 7 ⊢ (𝑚 = 𝑘 → ( -𝑚[,]𝑚) = ( -𝑘[,]𝑘))
20	19	eleq2d 2846	. . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑥 ∈ ( -𝑚[,]𝑚) ↔ 𝑥 ∈ ( -𝑘[,]𝑘)))
21		oveq1 7427	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) = (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥))
22	21, 18	breq12d 5115	. . . . . . 7 ⊢ (𝑚 = 𝑘 → ((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚 ↔ (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘))
23	22, 21, 18	ifbieq12d 4510	. . . . . 6 ⊢ (𝑚 = 𝑘 → if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚) = if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘))
24	20, 23	ifbieq1d 4506	. . . . 5 ⊢ (𝑚 = 𝑘 → if(𝑥 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0) = if(𝑥 ∈ ( -𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0))
25	24	mpteq2dv 5198	. . . 4 ⊢ (𝑚 = 𝑘 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ ( -𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
26	16, 25	eqtrid 2807	. . 3 ⊢ (𝑚 = 𝑘 → (𝑦 ∈ ℝ ↦ if(𝑦 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ ( -𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
27	26	cbvmptv 5208	. 2 ⊢ (𝑚 ∈ ℕ ↦ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ ( -𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0))) = (𝑘 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ ( -𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
28	1, 2, 10, 27	mbfi1fseqlem6 26046	1 ⊢ (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (0𝑝 ∘r ≤ (𝑔‘𝑛) ∧ (𝑔‘𝑛) ∘r ≤ (𝑔‘(𝑛 + 1))) ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔‘𝑛)‘𝑥)) ⇝ (𝐹‘𝑥)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  ifcif 4481   class class class wbr 5102   ↦ cmpt 5185  dom cdm 5650  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ∘_r cofr 7692  ℝcr 11202  0cc0 11203  1c1 11204   + caddc 11206   · cmul 11208  +∞cpnf 11343   ≤ cle 11347   -cneg 11545   / cdiv 11976  ℕcn 12338  2c2 12400  [,)cico 13481  [,]cicc 13482  ⌊cfl 13933  ↑cexp 14207   ⇝ cli 15656  MblFncmbf 25940  ∫₁citg1 25941  0_𝑝c0p 25995

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-inf2 9645  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280  ax-pre-sup 11281

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-ofr 7694  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-2o 8480  df-er 8720  df-map 8852  df-pm 8853  df-en 8977  df-dom 8978  df-sdom 8979  df-fin 8980  df-fi 9406  df-sup 9437  df-inf 9438  df-oi 9507  df-dju 9985  df-card 10023  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-div 11977  df-nn 12339  df-2 12408  df-3 12409  df-n0 12610  df-z 12697  df-uz 12969  df-q 13079  df-rp 13124  df-xneg 13244  df-xadd 13245  df-xmul 13246  df-ioo 13483  df-ico 13485  df-icc 13486  df-fz 13643  df-fzo 13792  df-fl 13935  df-seq 14148  df-exp 14208  df-hash 14478  df-cj 15271  df-re 15272  df-im 15273  df-sqrt 15407  df-abs 15408  df-clim 15660  df-rlim 15661  df-sum 15859  df-rest 17598  df-topgen 17619  df-psmet 21675  df-xmet 21676  df-met 21677  df-bl 21678  df-mopn 21679  df-top 23217  df-topon 23234  df-bases 23269  df-cmp 23710  df-ovol 25790  df-vol 25791  df-mbf 25945  df-itg1 25946  df-0p 25996

This theorem is used by:  mbfi1flimlem  26048  itg2add  26085