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 26072

Description: Transfer itg2cn 25991 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 25995	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		itgcn.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25864	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	abscld 15526	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
7	5	absge0d 15534	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐵))
8		elrege0 13507	. . . . . . 7 ⊢ ((abs‘𝐵) ∈ (0[,)+∞) ↔ ((abs‘𝐵) ∈ ℝ ∧ 0 ≤ (abs‘𝐵)))
9	6, 7, 8	sylanbrc 595	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ (0[,)+∞))
10		0e0icopnf 13511	. . . . . . 7 ⊢ 0 ∈ (0[,)+∞)
11	10	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
12	9, 11	ifclda 4518	. . . . 5 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
13	12	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
14	13	fmpttd 7108	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)):ℝ⟶(0[,)+∞))
15	3, 4	mbfdm2 25865	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
16		mblss 25759	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
17	15, 16	syl 18	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
18		rembl 25768	. . . . 5 ⊢ ℝ ∈ dom vol
19	18	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
20	12	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
21		eldifn 4079	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
22	21	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
23	22	iffalsed 4493	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = 0)
24		iftrue 4488	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = (abs‘𝐵))
25	24	mpteq2ia 5200	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘𝐵))
26	4, 1	iblabs 26056	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
27	6, 7	iblpos 26020	. . . . . . 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 2864	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
31	17, 19, 20, 23, 30	mbfss 25874	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
32	28	simprd 501	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)
33		itgcn.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
34	14, 31, 32, 33	itg2cn 25991	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
35		simprr 785	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ⊆ 𝐴)
36	35	sselda 3931	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝐴)
37	5	adantlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
38	36, 37	syldan 603	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝐵 ∈ ℂ)
39	38	abscld 15526	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → (abs‘𝐵) ∈ ℝ)
40		simprl 783	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ∈ dom vol)
41	37	abscld 15526	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
42	26	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
43	35, 40, 41, 42	iblss 26032	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↦ (abs‘𝐵)) ∈ 𝐿¹)
44	38	absge0d 15534	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 0 ≤ (abs‘𝐵))
45	39, 43, 44	itgposval 26023	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))))
46	35	sseld 3930	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 → 𝑥 ∈ 𝐴))
47	46	pm4.71d 571	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴)))
48	47	ifbid 4506	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0))
49		ifan 4536	. . . . . . . . . . . . . . 15 ⊢ if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)
50	48, 49	eqtrdi 2811	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
51	50	mpteq2dv 5199	. . . . . . . . . . . . 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 2795	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
54		nfv 1947	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑢
55		nffvmpt1 6889	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦)
56		nfcv 2922	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥0
57	54, 55, 56	nfif 4513	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)
58		nfcv 2922	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)
59		elequ1 2152	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑢 ↔ 𝑥 ∈ 𝑢))
60		fveq2 6878	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥))
61	59, 60	ifbieq1d 4507	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0) = if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
62	57, 58, 61	cbvmpt 5207	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
63		fvex 6891	. . . . . . . . . . . . . . . . 17 ⊢ (abs‘𝐵) ∈ V
64		c0ex 11224	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ V
65	63, 64	ifex 4533	. . . . . . . . . . . . . . . 16 ⊢ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V
66		eqid 2760	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
67	66	fvmpt2 6998	. . . . . . . . . . . . . . . 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 4502	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
70	69	mpteq2ia 5200	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
71	62, 70	eqtri 2783	. . . . . . . . . . . 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 2813	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))))
74	73	breq1d 5113	. . . . . . . . 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 3174	. . 3 ⊢ (𝜑 → (∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
81	80	reximdv 3177	. 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 3076 ∃wrex 3086 Vcvv 3450 ∖ cdif 3896 ⊆ wss 3899 ifcif 4482 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5655 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 ℝcr 11123 0cc0 11124 +∞cpnf 11264 < clt 11267 ≤ cle 11268 ℝ⁺crp 13042 [,)cico 13400 abscabs 15321 volcvol 25691 MblFncmbf 25842 ∫₂citg2 25844 𝐿¹cibl 25845 ∫citg 25846

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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 ax-cc 10437 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 ax-addf 11203

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 df-ofr 7679 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-oadd 8459 df-omul 8460 df-er 8696 df-map 8828 df-pm 8829 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fsupp 9332 df-fi 9381 df-sup 9412 df-inf 9413 df-oi 9482 df-dju 9906 df-card 9944 df-acn 9947 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-q 12998 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-ioo 13402 df-ioc 13403 df-ico 13404 df-icc 13405 df-fz 13562 df-fzo 13710 df-fl 13853 df-mod 13931 df-seq 14066 df-exp 14126 df-hash 14395 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-clim 15575 df-rlim 15576 df-sum 15774 df-struct 17239 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-starv 17357 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-unif 17365 df-hom 17366 df-cco 17367 df-rest 17507 df-topn 17508 df-0g 17526 df-gsum 17527 df-topgen 17528 df-pt 17529 df-prds 17532 df-xrs 17588 df-qtop 17593 df-imas 17594 df-xps 17596 df-mre 17670 df-mrc 17671 df-acs 17673 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-submnd 18892 df-mulg 19191 df-cntz 19444 df-cmn 19909 df-psmet 21577 df-xmet 21578 df-met 21579 df-bl 21580 df-mopn 21581 df-cnfld 21586 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-cn 23452 df-cnp 23453 df-cmp 23612 df-tx 23788 df-hmeo 23981 df-xms 24546 df-ms 24547 df-tms 24548 df-cncf 25106 df-ovol 25692 df-vol 25693 df-mbf 25847 df-itg1 25848 df-itg2 25849 df-ibl 25850 df-itg 25851 df-0p 25898

This theorem is used by: ftc1a 26264

W3C validator