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 26079

Description: Transfer itg2cn 25997 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 26001	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		itgcn.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25870	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	abscld 15530	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
7	5	absge0d 15538	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐵))
8		elrege0 13511	. . . . . . 7 ⊢ ((abs‘𝐵) ∈ (0[,)+∞) ↔ ((abs‘𝐵) ∈ ℝ ∧ 0 ≤ (abs‘𝐵)))
9	6, 7, 8	sylanbrc 595	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ (0[,)+∞))
10		0e0icopnf 13515	. . . . . . 7 ⊢ 0 ∈ (0[,)+∞)
11	10	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
12	9, 11	ifclda 4521	. . . . 5 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
13	12	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
14	13	fmpttd 7112	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)):ℝ⟶(0[,)+∞))
15	3, 4	mbfdm2 25871	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
16		mblss 25765	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
17	15, 16	syl 18	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
18		rembl 25774	. . . . 5 ⊢ ℝ ∈ dom vol
19	18	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
20	12	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
21		eldifn 4082	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
22	21	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
23	22	iffalsed 4496	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = 0)
24		iftrue 4491	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = (abs‘𝐵))
25	24	mpteq2ia 5204	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘𝐵))
26	4, 1	iblabs 26063	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
27	6, 7	iblpos 26027	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)))
28	26, 27	mpbid 235	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ))
29	28	simpld 500	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn)
30	25, 29	eqeltrid 2866	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
31	17, 19, 20, 23, 30	mbfss 25880	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
32	28	simprd 501	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)
33		itgcn.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
34	14, 31, 32, 33	itg2cn 25997	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
35		simprr 785	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ⊆ 𝐴)
36	35	sselda 3934	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝐴)
37	5	adantlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
38	36, 37	syldan 603	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝐵 ∈ ℂ)
39	38	abscld 15530	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → (abs‘𝐵) ∈ ℝ)
40		simprl 783	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ∈ dom vol)
41	37	abscld 15530	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
42	26	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
43	35, 40, 41, 42	iblss 26039	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↦ (abs‘𝐵)) ∈ 𝐿¹)
44	38	absge0d 15538	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 0 ≤ (abs‘𝐵))
45	39, 43, 44	itgposval 26030	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))))
46	35	sseld 3933	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 → 𝑥 ∈ 𝐴))
47	46	pm4.71d 571	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴)))
48	47	ifbid 4509	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0))
49		ifan 4539	. . . . . . . . . . . . . . 15 ⊢ if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)
50	48, 49	eqtrdi 2813	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
51	50	mpteq2dv 5203	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
52	51	fveq2d 6886	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
53	45, 52	eqtrd 2797	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
54		nfv 1947	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑢
55		nffvmpt1 6893	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦)
56		nfcv 2924	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥0
57	54, 55, 56	nfif 4516	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)
58		nfcv 2924	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)
59		elequ1 2152	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑢 ↔ 𝑥 ∈ 𝑢))
60		fveq2 6882	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥))
61	59, 60	ifbieq1d 4510	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0) = if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
62	57, 58, 61	cbvmpt 5211	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
63		fvex 6895	. . . . . . . . . . . . . . . . 17 ⊢ (abs‘𝐵) ∈ V
64		c0ex 11228	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ V
65	63, 64	ifex 4536	. . . . . . . . . . . . . . . 16 ⊢ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V
66		eqid 2762	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
67	66	fvmpt2 7002	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V) → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
68	65, 67	mpan2 704	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
69	68	ifeq1d 4505	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
70	69	mpteq2ia 5204	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
71	62, 70	eqtri 2785	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
72	71	fveq2i 6885	. . . . . . . . . . 11 ⊢ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
73	53, 72	eqtr4di 2815	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))))
74	73	breq1d 5117	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫𝑢(abs‘𝐵) d𝑥 < 𝐶 ↔ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
75	74	biimprd 251	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ((∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))
76	75	imim2d 58	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
77	76	expr 462	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (𝑢 ⊆ 𝐴 → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))))
78	77	com23 87	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → (𝑢 ⊆ 𝐴 → ((vol‘𝑢) < 𝑑 → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))))
79	78	imp4a 428	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ dom vol) → (((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
80	79	ralimdva 3176	. . 3 ⊢ (𝜑 → (∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
81	80	reximdv 3179	. 2 ⊢ (𝜑 → (∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
82	34, 81	mpd 16	1 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ∃wrex 3088 Vcvv 3453 ∖ cdif 3899 ⊆ wss 3902 ifcif 4485 class class class wbr 5107 ↦ cmpt 5190 dom cdm 5659 ‘cfv 6537 (class class class)co 7417 ℂcc 11126 ℝcr 11127 0cc0 11128 +∞cpnf 11268 < clt 11271 ≤ cle 11272 ℝ⁺crp 13046 [,)cico 13404 abscabs 15325 volcvol 25697 MblFncmbf 25848 ∫₂citg2 25850 𝐿¹cibl 25851 ∫citg 25852

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 ax-cc 10441 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206 ax-addf 11207

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-disj 5075 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-of 7682 df-ofr 7683 df-om 7867 df-1st 7990 df-2nd 7991 df-supp 8163 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-oadd 8463 df-omul 8464 df-er 8700 df-map 8832 df-pm 8833 df-ixp 8909 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-fsupp 9336 df-fi 9385 df-sup 9416 df-inf 9417 df-oi 9486 df-dju 9910 df-card 9948 df-acn 9951 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-z 12620 df-dec 12741 df-uz 12892 df-q 13002 df-rp 13047 df-xneg 13167 df-xadd 13168 df-xmul 13169 df-ioo 13406 df-ioc 13407 df-ico 13408 df-icc 13409 df-fz 13566 df-fzo 13714 df-fl 13857 df-mod 13935 df-seq 14070 df-exp 14130 df-hash 14399 df-cj 15190 df-re 15191 df-im 15192 df-sqrt 15326 df-abs 15327 df-clim 15579 df-rlim 15580 df-sum 15778 df-struct 17245 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-ress 17329 df-plusg 17361 df-mulr 17362 df-starv 17363 df-sca 17364 df-vsca 17365 df-ip 17366 df-tset 17367 df-ple 17368 df-ds 17370 df-unif 17371 df-hom 17372 df-cco 17373 df-rest 17513 df-topn 17514 df-0g 17532 df-gsum 17533 df-topgen 17534 df-pt 17535 df-prds 17538 df-xrs 17594 df-qtop 17599 df-imas 17600 df-xps 17602 df-mre 17676 df-mrc 17677 df-acs 17679 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-submnd 18898 df-mulg 19197 df-cntz 19450 df-cmn 19915 df-psmet 21583 df-xmet 21584 df-met 21585 df-bl 21586 df-mopn 21587 df-cnfld 21592 df-top 23125 df-topon 23142 df-topsp 23164 df-bases 23177 df-cn 23458 df-cnp 23459 df-cmp 23618 df-tx 23794 df-hmeo 23987 df-xms 24552 df-ms 24553 df-tms 24554 df-cncf 25112 df-ovol 25698 df-vol 25699 df-mbf 25853 df-itg1 25854 df-itg2 25855 df-ibl 25856 df-itg 25857 df-0p 25904

This theorem is used by: ftc1a 26271

W3C validator