Theorem mbfi1fseq 23294

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𝑝 ∘𝑟 ≤ (𝑔‘𝑛) ∧ (𝑔‘𝑛) ∘𝑟 ≤ (𝑔‘(𝑛 + 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 6557	. . . . . 6 ⊢ (𝑗 = 𝑘 → (2↑𝑗) = (2↑𝑘))
4	3	oveq2d 6565	. . . . 5 ⊢ (𝑗 = 𝑘 → ((𝐹‘𝑧) · (2↑𝑗)) = ((𝐹‘𝑧) · (2↑𝑘)))
5	4	fveq2d 6107	. . . 4 ⊢ (𝑗 = 𝑘 → (⌊‘((𝐹‘𝑧) · (2↑𝑗))) = (⌊‘((𝐹‘𝑧) · (2↑𝑘))))
6	5, 3	oveq12d 6567	. . 3 ⊢ (𝑗 = 𝑘 → ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)) = ((⌊‘((𝐹‘𝑧) · (2↑𝑘))) / (2↑𝑘)))
7		fveq2 6103	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝐹‘𝑧) = (𝐹‘𝑦))
8	7	oveq1d 6564	. . . . 5 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝑧) · (2↑𝑘)) = ((𝐹‘𝑦) · (2↑𝑘)))
9	8	fveq2d 6107	. . . 4 ⊢ (𝑧 = 𝑦 → (⌊‘((𝐹‘𝑧) · (2↑𝑘))) = (⌊‘((𝐹‘𝑦) · (2↑𝑘))))
10	9	oveq1d 6564	. . 3 ⊢ (𝑧 = 𝑦 → ((⌊‘((𝐹‘𝑧) · (2↑𝑘))) / (2↑𝑘)) = ((⌊‘((𝐹‘𝑦) · (2↑𝑘))) / (2↑𝑘)))
11	6, 10	cbvmpt2v 6633	. 2 ⊢ (𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗))) = (𝑘 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑦) · (2↑𝑘))) / (2↑𝑘)))
12		eleq1 2676	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ (-𝑚[,]𝑚) ↔ 𝑥 ∈ (-𝑚[,]𝑚)))
13		oveq2 6557	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) = (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥))
14	13	breq1d 4593	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚 ↔ (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚))
15	14, 13	ifbieq1d 4059	. . . . . 6 ⊢ (𝑦 = 𝑥 → if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚) = if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚))
16	12, 15	ifbieq1d 4059	. . . . 5 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0) = if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0))
17	16	cbvmptv 4678	. . . 4 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0))
18		negeq 10152	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → -𝑚 = -𝑘)
19		id 22	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → 𝑚 = 𝑘)
20	18, 19	oveq12d 6567	. . . . . . 7 ⊢ (𝑚 = 𝑘 → (-𝑚[,]𝑚) = (-𝑘[,]𝑘))
21	20	eleq2d 2673	. . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑥 ∈ (-𝑚[,]𝑚) ↔ 𝑥 ∈ (-𝑘[,]𝑘)))
22		oveq1 6556	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) = (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥))
23	22, 19	breq12d 4596	. . . . . . 7 ⊢ (𝑚 = 𝑘 → ((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚 ↔ (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘))
24	23, 22, 19	ifbieq12d 4063	. . . . . 6 ⊢ (𝑚 = 𝑘 → if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚) = if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘))
25	21, 24	ifbieq1d 4059	. . . . 5 ⊢ (𝑚 = 𝑘 → if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0) = if(𝑥 ∈ (-𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0))
26	25	mpteq2dv 4673	. . . 4 ⊢ (𝑚 = 𝑘 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
27	17, 26	syl5eq 2656	. . 3 ⊢ (𝑚 = 𝑘 → (𝑦 ∈ ℝ ↦ if(𝑦 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
28	27	cbvmptv 4678	. 2 ⊢ (𝑚 ∈ ℕ ↦ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ (-𝑚[,]𝑚), if((𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦) ≤ 𝑚, (𝑚(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑦), 𝑚), 0))) = (𝑘 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑘[,]𝑘), if((𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥) ≤ 𝑘, (𝑘(𝑗 ∈ ℕ, 𝑧 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑧) · (2↑𝑗))) / (2↑𝑗)))𝑥), 𝑘), 0)))
29	1, 2, 11, 28	mbfi1fseqlem6 23293	1 ⊢ (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (0𝑝 ∘𝑟 ≤ (𝑔‘𝑛) ∧ (𝑔‘𝑛) ∘𝑟 ≤ (𝑔‘(𝑛 + 1))) ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔‘𝑛)‘𝑥)) ⇝ (𝐹‘𝑥)))

Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031  ∃wex 1695   ∈ wcel 1977  ∀wral 2896  ifcif 4036   class class class wbr 4583   ↦ cmpt 4643  dom cdm 5038  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551   ∘_𝑟 cofr 6794  ℝcr 9814  0cc0 9815  1c1 9816   + caddc 9818   · cmul 9820  +∞cpnf 9950   ≤ cle 9954  -cneg 10146   / cdiv 10563  ℕcn 10897  2c2 10947  [,)cico 12048  [,]cicc 12049  ⌊cfl 12453  ↑cexp 12722   ⇝ cli 14063  MblFncmbf 23189  ∫₁citg1 23190  0_𝑝c0p 23242

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-ofr 6796  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-fi 8200  df-sup 8231  df-inf 8232  df-oi 8298  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-xneg 11822  df-xadd 11823  df-xmul 11824  df-ioo 12050  df-ico 12052  df-icc 12053  df-fz 12198  df-fzo 12335  df-fl 12455  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-rlim 14068  df-sum 14265  df-rest 15906  df-topgen 15927  df-psmet 19559  df-xmet 19560  df-met 19561  df-bl 19562  df-mopn 19563  df-top 20521  df-bases 20522  df-topon 20523  df-cmp 21000  df-ovol 23040  df-vol 23041  df-mbf 23194  df-itg1 23195  df-0p 23243

This theorem is referenced by:  mbfi1flimlem  23295  itg2add  23332