itgcn - Metamath Proof Explorer

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

Theorem itgcn 24435

Description: Transfer itg2cn 24356 to the full Lebesgue integral. (Contributed by Mario Carneiro, 1-Sep-2014.)

**Hypotheses**
Ref	Expression
itgcn.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
itgcn.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
itgcn.3	⊢ (𝜑 → 𝐶 ∈ ℝ⁺)

**Assertion**
Ref	Expression
itgcn	⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))

Distinct variable groups: 𝑢,𝑑,𝑥,𝐴 𝐵,𝑑,𝑢 𝐶,𝑑,𝑢 𝜑,𝑑,𝑢,𝑥 Allowed substitution hints: 𝐵(𝑥) 𝐶(𝑥) 𝑉(𝑥,𝑢,𝑑)

Proof of Theorem itgcn Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		itgcn.2	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
2		iblmbf 24360	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		itgcn.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 24229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	abscld 14788	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
7	5	absge0d 14796	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐵))
8		elrege0 12834	. . . . . . 7 ⊢ ((abs‘𝐵) ∈ (0[,)+∞) ↔ ((abs‘𝐵) ∈ ℝ ∧ 0 ≤ (abs‘𝐵)))
9	6, 7, 8	sylanbrc 585	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ (0[,)+∞))
10		0e0icopnf 12838	. . . . . . 7 ⊢ 0 ∈ (0[,)+∞)
11	10	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
12	9, 11	ifclda 4499	. . . . 5 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
13	12	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
14	13	fmpttd 6872	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)):ℝ⟶(0[,)+∞))
15	3, 4	mbfdm2 24230	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
16		mblss 24124	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
18		rembl 24133	. . . . 5 ⊢ ℝ ∈ dom vol
19	18	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
20	12	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
21		eldifn 4102	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
22	21	adantl 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
23	22	iffalsed 4476	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = 0)
24		iftrue 4471	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = (abs‘𝐵))
25	24	mpteq2ia 5148	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘𝐵))
26	4, 1	iblabs 24421	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
27	6, 7	iblpos 24385	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)))
28	26, 27	mpbid 234	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ))
29	28	simpld 497	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn)
30	25, 29	eqeltrid 2915	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
31	17, 19, 20, 23, 30	mbfss 24239	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
32	28	simprd 498	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)
33		itgcn.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
34	14, 31, 32, 33	itg2cn 24356	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
35		simprr 771	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ⊆ 𝐴)
36	35	sselda 3965	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝐴)
37	5	adantlr 713	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
38	36, 37	syldan 593	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝐵 ∈ ℂ)
39	38	abscld 14788	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → (abs‘𝐵) ∈ ℝ)
40		simprl 769	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ∈ dom vol)
41	37	abscld 14788	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
42	26	adantr 483	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
43	35, 40, 41, 42	iblss 24397	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↦ (abs‘𝐵)) ∈ 𝐿¹)
44	38	absge0d 14796	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 0 ≤ (abs‘𝐵))
45	39, 43, 44	itgposval 24388	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))))
46	35	sseld 3964	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 → 𝑥 ∈ 𝐴))
47	46	pm4.71d 564	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴)))
48	47	ifbid 4487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0))
49		ifan 4516	. . . . . . . . . . . . . . 15 ⊢ if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)
50	48, 49	syl6eq 2870	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
51	50	mpteq2dv 5153	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
52	51	fveq2d 6667	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
53	45, 52	eqtrd 2854	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
54		nfv 1908	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑢
55		nffvmpt1 6674	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦)
56		nfcv 2975	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥0
57	54, 55, 56	nfif 4494	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)
58		nfcv 2975	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)
59		elequ1 2114	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑢 ↔ 𝑥 ∈ 𝑢))
60		fveq2 6663	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥))
61	59, 60	ifbieq1d 4488	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0) = if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
62	57, 58, 61	cbvmpt 5158	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
63		fvex 6676	. . . . . . . . . . . . . . . . 17 ⊢ (abs‘𝐵) ∈ V
64		c0ex 10627	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ V
65	63, 64	ifex 4513	. . . . . . . . . . . . . . . 16 ⊢ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V
66		eqid 2819	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
67	66	fvmpt2 6772	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V) → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
68	65, 67	mpan2 689	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
69	68	ifeq1d 4483	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
70	69	mpteq2ia 5148	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
71	62, 70	eqtri 2842	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
72	71	fveq2i 6666	. . . . . . . . . . 11 ⊢ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
73	53, 72	syl6eqr 2872	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))))
74	73	breq1d 5067	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫𝑢(abs‘𝐵) d𝑥 < 𝐶 ↔ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
75	74	biimprd 250	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ((∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))
76	75	imim2d 57	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
77	76	expr 459	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (𝑢 ⊆ 𝐴 → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))))
78	77	com23 86	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → (𝑢 ⊆ 𝐴 → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))))
79	78	imp4a 425	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
80	79	ralimdva 3175	. . 3 ⊢ (𝜑 → (∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
81	80	reximdv 3271	. 2 ⊢ (𝜑 → (∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
82	34, 81	mpd 15	1 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1530 ∈ wcel 2107 ∀wral 3136 ∃wrex 3137 Vcvv 3493 ∖ cdif 3931 ⊆ wss 3934 ifcif 4465 class class class wbr 5057 ↦ cmpt 5137 dom cdm 5548 ‘cfv 6348 (class class class)co 7148 ℂcc 10527 ℝcr 10528 0cc0 10529 +∞cpnf 10664 < clt 10667 ≤ cle 10668 ℝ⁺crp 12381 [,)cico 12732 abscabs 14585 volcvol 24056 MblFncmbf 24207 ∫₂citg2 24209 𝐿¹cibl 24210 ∫citg 24211

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1904 ax-6 1963 ax-7 2008 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2153 ax-12 2169 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-inf2 9096 ax-cc 9849 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606 ax-pre-sup 10607 ax-addf 10608 ax-mulf 10609

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1082 df-3an 1083 df-tru 1533 df-fal 1543 df-ex 1774 df-nf 1778 df-sb 2063 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-disj 5023 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-of 7401 df-ofr 7402 df-om 7573 df-1st 7681 df-2nd 7682 df-supp 7823 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-1o 8094 df-2o 8095 df-oadd 8098 df-omul 8099 df-er 8281 df-map 8400 df-pm 8401 df-ixp 8454 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-fsupp 8826 df-fi 8867 df-sup 8898 df-inf 8899 df-oi 8966 df-dju 9322 df-card 9360 df-acn 9363 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-div 11290 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-9 11699 df-n0 11890 df-z 11974 df-dec 12091 df-uz 12236 df-q 12341 df-rp 12382 df-xneg 12499 df-xadd 12500 df-xmul 12501 df-ioo 12734 df-ioc 12735 df-ico 12736 df-icc 12737 df-fz 12885 df-fzo 13026 df-fl 13154 df-mod 13230 df-seq 13362 df-exp 13422 df-hash 13683 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-rlim 14838 df-sum 15035 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-starv 16572 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-hom 16581 df-cco 16582 df-rest 16688 df-topn 16689 df-0g 16707 df-gsum 16708 df-topgen 16709 df-pt 16710 df-prds 16713 df-xrs 16767 df-qtop 16772 df-imas 16773 df-xps 16775 df-mre 16849 df-mrc 16850 df-acs 16852 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-submnd 17949 df-mulg 18217 df-cntz 18439 df-cmn 18900 df-psmet 20529 df-xmet 20530 df-met 20531 df-bl 20532 df-mopn 20533 df-cnfld 20538 df-top 21494 df-topon 21511 df-topsp 21533 df-bases 21546 df-cn 21827 df-cnp 21828 df-cmp 21987 df-tx 22162 df-hmeo 22355 df-xms 22922 df-ms 22923 df-tms 22924 df-cncf 23478 df-ovol 24057 df-vol 24058 df-mbf 24212 df-itg1 24213 df-itg2 24214 df-ibl 24215 df-itg 24216 df-0p 24263

This theorem is referenced by: ftc1a 24626

W3C validator