Theorem isibl 24835

Description: The predicate "𝐹 is integrable". The "integrable" predicate corresponds roughly to the range of validity of ∫𝐴𝐵 d𝑥, which is to say that the expression ∫𝐴𝐵 d𝑥 doesn't make sense unless (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)

Hypotheses

Ref	Expression
isibl.1	⊢ (𝜑 → 𝐺 = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑇), 𝑇, 0)))
isibl.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑇 = (ℜ‘(𝐵 / (i↑𝑘))))
isibl.3	⊢ (𝜑 → dom 𝐹 = 𝐴)
isibl.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵)

Assertion

Ref	Expression
isibl	⊢ (𝜑 → (𝐹 ∈ 𝐿1 ↔ (𝐹 ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘𝐺) ∈ ℝ)))

Distinct variable groups:   𝑥,𝑘,𝐴   𝐵,𝑘   𝑘,𝐹,𝑥   𝜑,𝑘,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝑇(𝑥,𝑘)   𝐺(𝑥,𝑘)

Proof of Theorem isibl

Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6769	. . . . . . . . 9 ⊢ (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) ∈ V
2		breq2 5074	. . . . . . . . . . 11 ⊢ (𝑦 = (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) → (0 ≤ 𝑦 ↔ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘)))))
3	2	anbi2d 628	. . . . . . . . . 10 ⊢ (𝑦 = (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) → ((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦) ↔ (𝑥 ∈ dom 𝑓 ∧ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘))))))
4		id 22	. . . . . . . . . 10 ⊢ (𝑦 = (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) → 𝑦 = (ℜ‘((𝑓‘𝑥) / (i↑𝑘))))
5	3, 4	ifbieq1d 4480	. . . . . . . . 9 ⊢ (𝑦 = (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) → if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘)))), (ℜ‘((𝑓‘𝑥) / (i↑𝑘))), 0))
6	1, 5	csbie 3864	. . . . . . . 8 ⊢ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘)))), (ℜ‘((𝑓‘𝑥) / (i↑𝑘))), 0)
7		dmeq 5801	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
8	7	eleq2d 2824	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑥 ∈ dom 𝑓 ↔ 𝑥 ∈ dom 𝐹))
9		fveq1 6755	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
10	9	fvoveq1d 7277	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) = (ℜ‘((𝐹‘𝑥) / (i↑𝑘))))
11	10	breq2d 5082	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘))) ↔ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))))
12	8, 11	anbi12d 630	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑥 ∈ dom 𝑓 ∧ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘)))) ↔ (𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘))))))
13	12, 10	ifbieq1d 4480	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ (ℜ‘((𝑓‘𝑥) / (i↑𝑘)))), (ℜ‘((𝑓‘𝑥) / (i↑𝑘))), 0) = if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))
14	6, 13	syl5eq 2791	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))
15	14	mpteq2dv 5172	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0)))
16	15	fveq2d 6760	. . . . 5 ⊢ (𝑓 = 𝐹 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))))
17	16	eleq1d 2823	. . . 4 ⊢ (𝑓 = 𝐹 → ((∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0))) ∈ ℝ ↔ (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ))
18	17	ralbidv 3120	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0))) ∈ ℝ ↔ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ))
19		df-ibl 24691	. . 3 ⊢ 𝐿1 = {𝑓 ∈ MblFn ∣ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘((𝑓‘𝑥) / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ dom 𝑓 ∧ 0 ≤ 𝑦), 𝑦, 0))) ∈ ℝ}
20	18, 19	elrab2 3620	. 2 ⊢ (𝐹 ∈ 𝐿1 ↔ (𝐹 ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ))
21		isibl.3	. . . . . . . . . . . 12 ⊢ (𝜑 → dom 𝐹 = 𝐴)
22	21	eleq2d 2824	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ dom 𝐹 ↔ 𝑥 ∈ 𝐴))
23	22	anbi1d 629	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘))))))
24	23	ifbid 4479	. . . . . . . . 9 ⊢ (𝜑 → if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))
25		isibl.4	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵)
26	25	fvoveq1d 7277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐹‘𝑥) / (i↑𝑘))) = (ℜ‘(𝐵 / (i↑𝑘))))
27		isibl.2	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑇 = (ℜ‘(𝐵 / (i↑𝑘))))
28	26, 27	eqtr4d 2781	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘((𝐹‘𝑥) / (i↑𝑘))) = 𝑇)
29	28	ibllem 24834	. . . . . . . . 9 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑇), 𝑇, 0))
30	24, 29	eqtrd 2778	. . . . . . . 8 ⊢ (𝜑 → if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑇), 𝑇, 0))
31	30	mpteq2dv 5172	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑇), 𝑇, 0)))
32		isibl.1	. . . . . . 7 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑇), 𝑇, 0)))
33	31, 32	eqtr4d 2781	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0)) = 𝐺)
34	33	fveq2d 6760	. . . . 5 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) = (∫2‘𝐺))
35	34	eleq1d 2823	. . . 4 ⊢ (𝜑 → ((∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ ↔ (∫2‘𝐺) ∈ ℝ))
36	35	ralbidv 3120	. . 3 ⊢ (𝜑 → (∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ ↔ ∀𝑘 ∈ (0...3)(∫2‘𝐺) ∈ ℝ))
37	36	anbi2d 628	. 2 ⊢ (𝜑 → ((𝐹 ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ dom 𝐹 ∧ 0 ≤ (ℜ‘((𝐹‘𝑥) / (i↑𝑘)))), (ℜ‘((𝐹‘𝑥) / (i↑𝑘))), 0))) ∈ ℝ) ↔ (𝐹 ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘𝐺) ∈ ℝ)))
38	20, 37	syl5bb 282	1 ⊢ (𝜑 → (𝐹 ∈ 𝐿1 ↔ (𝐹 ∈ MblFn ∧ ∀𝑘 ∈ (0...3)(∫2‘𝐺) ∈ ℝ)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ⦋csb 3828  ifcif 4456   class class class wbr 5070   ↦ cmpt 5153  dom cdm 5580  ‘cfv 6418  (class class class)co 7255  ℝcr 10801  0cc0 10802  ici 10804   ≤ cle 10941   / cdiv 11562  3c3 11959  ...cfz 13168  ↑cexp 13710  ℜcre 14736  MblFncmbf 24683  ∫₂citg2 24685  𝐿¹cibl 24686

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-nul 5225

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-dm 5590  df-iota 6376  df-fv 6426  df-ov 7258  df-ibl 24691

This theorem is referenced by:  isibl2  24836  ibl0  24856  iblempty  43396