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 25291

Description: Transfer itg2cn 25210 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 25214	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		itgcn.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25082	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	abscld 15365	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
7	5	absge0d 15373	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐵))
8		elrege0 13413	. . . . . . 7 ⊢ ((abs‘𝐵) ∈ (0[,)+∞) ↔ ((abs‘𝐵) ∈ ℝ ∧ 0 ≤ (abs‘𝐵)))
9	6, 7, 8	sylanbrc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ (0[,)+∞))
10		0e0icopnf 13417	. . . . . . 7 ⊢ 0 ∈ (0[,)+∞)
11	10	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
12	9, 11	ifclda 4557	. . . . 5 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
13	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
14	13	fmpttd 7099	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)):ℝ⟶(0[,)+∞))
15	3, 4	mbfdm2 25083	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
16		mblss 24977	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
18		rembl 24986	. . . . 5 ⊢ ℝ ∈ dom vol
19	18	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
20	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
21		eldifn 4123	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
22	21	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
23	22	iffalsed 4533	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = 0)
24		iftrue 4528	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = (abs‘𝐵))
25	24	mpteq2ia 5244	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘𝐵))
26	4, 1	iblabs 25275	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
27	6, 7	iblpos 25239	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)))
28	26, 27	mpbid 231	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ))
29	28	simpld 495	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn)
30	25, 29	eqeltrid 2836	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
31	17, 19, 20, 23, 30	mbfss 25092	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
32	28	simprd 496	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)
33		itgcn.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
34	14, 31, 32, 33	itg2cn 25210	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
35		simprr 771	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ⊆ 𝐴)
36	35	sselda 3978	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝐴)
37	5	adantlr 713	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
38	36, 37	syldan 591	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝐵 ∈ ℂ)
39	38	abscld 15365	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → (abs‘𝐵) ∈ ℝ)
40		simprl 769	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ∈ dom vol)
41	37	abscld 15365	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
42	26	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
43	35, 40, 41, 42	iblss 25251	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↦ (abs‘𝐵)) ∈ 𝐿¹)
44	38	absge0d 15373	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 0 ≤ (abs‘𝐵))
45	39, 43, 44	itgposval 25242	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))))
46	35	sseld 3977	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 → 𝑥 ∈ 𝐴))
47	46	pm4.71d 562	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴)))
48	47	ifbid 4545	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0))
49		ifan 4575	. . . . . . . . . . . . . . 15 ⊢ if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)
50	48, 49	eqtrdi 2787	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
51	50	mpteq2dv 5243	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
52	51	fveq2d 6882	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
53	45, 52	eqtrd 2771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
54		nfv 1917	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑢
55		nffvmpt1 6889	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦)
56		nfcv 2902	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥0
57	54, 55, 56	nfif 4552	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)
58		nfcv 2902	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)
59		elequ1 2113	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑢 ↔ 𝑥 ∈ 𝑢))
60		fveq2 6878	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥))
61	59, 60	ifbieq1d 4546	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0) = if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
62	57, 58, 61	cbvmpt 5252	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
63		fvex 6891	. . . . . . . . . . . . . . . . 17 ⊢ (abs‘𝐵) ∈ V
64		c0ex 11190	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ V
65	63, 64	ifex 4572	. . . . . . . . . . . . . . . 16 ⊢ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V
66		eqid 2731	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
67	66	fvmpt2 6995	. . . . . . . . . . . . . . . 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 4541	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
70	69	mpteq2ia 5244	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
71	62, 70	eqtri 2759	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
72	71	fveq2i 6881	. . . . . . . . . . 11 ⊢ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
73	53, 72	eqtr4di 2789	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))))
74	73	breq1d 5151	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫𝑢(abs‘𝐵) d𝑥 < 𝐶 ↔ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
75	74	biimprd 247	. . . . . . . 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 457	. . . . . 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 423	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
80	79	ralimdva 3166	. . 3 ⊢ (𝜑 → (∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
81	80	reximdv 3169	. 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 396 = wceq 1541 ∈ wcel 2106 ∀wral 3060 ∃wrex 3069 Vcvv 3473 ∖ cdif 3941 ⊆ wss 3944 ifcif 4522 class class class wbr 5141 ↦ cmpt 5224 dom cdm 5669 ‘cfv 6532 (class class class)co 7393 ℂcc 11090 ℝcr 11091 0cc0 11092 +∞cpnf 11227 < clt 11230 ≤ cle 11231 ℝ⁺crp 12956 [,)cico 13308 abscabs 15163 volcvol 24909 MblFncmbf 25060 ∫₂citg2 25062 𝐿¹cibl 25063 ∫citg 25064

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-inf2 9618 ax-cc 10412 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 ax-pre-sup 11170 ax-addf 11171 ax-mulf 11172

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-tp 4627 df-op 4629 df-uni 4902 df-int 4944 df-iun 4992 df-iin 4993 df-disj 5107 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-isom 6541 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-of 7653 df-ofr 7654 df-om 7839 df-1st 7957 df-2nd 7958 df-supp 8129 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-2o 8449 df-oadd 8452 df-omul 8453 df-er 8686 df-map 8805 df-pm 8806 df-ixp 8875 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-fsupp 9345 df-fi 9388 df-sup 9419 df-inf 9420 df-oi 9487 df-dju 9878 df-card 9916 df-acn 9919 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-div 11854 df-nn 12195 df-2 12257 df-3 12258 df-4 12259 df-5 12260 df-6 12261 df-7 12262 df-8 12263 df-9 12264 df-n0 12455 df-z 12541 df-dec 12660 df-uz 12805 df-q 12915 df-rp 12957 df-xneg 13074 df-xadd 13075 df-xmul 13076 df-ioo 13310 df-ioc 13311 df-ico 13312 df-icc 13313 df-fz 13467 df-fzo 13610 df-fl 13739 df-mod 13817 df-seq 13949 df-exp 14010 df-hash 14273 df-cj 15028 df-re 15029 df-im 15030 df-sqrt 15164 df-abs 15165 df-clim 15414 df-rlim 15415 df-sum 15615 df-struct 17062 df-sets 17079 df-slot 17097 df-ndx 17109 df-base 17127 df-ress 17156 df-plusg 17192 df-mulr 17193 df-starv 17194 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-hom 17203 df-cco 17204 df-rest 17350 df-topn 17351 df-0g 17369 df-gsum 17370 df-topgen 17371 df-pt 17372 df-prds 17375 df-xrs 17430 df-qtop 17435 df-imas 17436 df-xps 17438 df-mre 17512 df-mrc 17513 df-acs 17515 df-mgm 18543 df-sgrp 18592 df-mnd 18603 df-submnd 18648 df-mulg 18923 df-cntz 19147 df-cmn 19614 df-psmet 20870 df-xmet 20871 df-met 20872 df-bl 20873 df-mopn 20874 df-cnfld 20879 df-top 22325 df-topon 22342 df-topsp 22364 df-bases 22378 df-cn 22660 df-cnp 22661 df-cmp 22820 df-tx 22995 df-hmeo 23188 df-xms 23755 df-ms 23756 df-tms 23757 df-cncf 24323 df-ovol 24910 df-vol 24911 df-mbf 25065 df-itg1 25066 df-itg2 25067 df-ibl 25068 df-itg 25069 df-0p 25116

This theorem is referenced by: ftc1a 25483

W3C validator