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 25837

Description: Transfer itg2cn 25755 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 25759	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		itgcn.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25628	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	abscld 15399	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
7	5	absge0d 15407	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ (abs‘𝐵))
8		elrege0 13405	. . . . . . 7 ⊢ ((abs‘𝐵) ∈ (0[,)+∞) ↔ ((abs‘𝐵) ∈ ℝ ∧ 0 ≤ (abs‘𝐵)))
9	6, 7, 8	sylanbrc 589	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ (0[,)+∞))
10		0e0icopnf 13409	. . . . . . 7 ⊢ 0 ∈ (0[,)+∞)
11	10	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
12	9, 11	ifclda 4497	. . . . 5 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
13	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
14	13	fmpttd 7063	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)):ℝ⟶(0[,)+∞))
15	3, 4	mbfdm2 25629	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
16		mblss 25523	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
18		rembl 25532	. . . . 5 ⊢ ℝ ∈ dom vol
19	18	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
20	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ (0[,)+∞))
21		eldifn 4069	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
22	21	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
23	22	iffalsed 4472	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = 0)
24		iftrue 4467	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) = (abs‘𝐵))
25	24	mpteq2ia 5174	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘𝐵))
26	4, 1	iblabs 25821	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
27	6, 7	iblpos 25785	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)))
28	26, 27	mpbid 233	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ))
29	28	simpld 495	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ MblFn)
30	25, 29	eqeltrid 2844	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
31	17, 19, 20, 23, 30	mbfss 25638	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) ∈ MblFn)
32	28	simprd 496	. . 3 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))) ∈ ℝ)
33		itgcn.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ⁺)
34	14, 31, 32, 33	itg2cn 25755	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ⁺ ∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
35		simprr 778	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ⊆ 𝐴)
36	35	sselda 3922	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝐴)
37	5	adantlr 721	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
38	36, 37	syldan 597	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 𝐵 ∈ ℂ)
39	38	abscld 15399	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → (abs‘𝐵) ∈ ℝ)
40		simprl 776	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → 𝑢 ∈ dom vol)
41	37	abscld 15399	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ)
42	26	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ 𝐿¹)
43	35, 40, 41, 42	iblss 25797	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↦ (abs‘𝐵)) ∈ 𝐿¹)
44	38	absge0d 15407	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) ∧ 𝑥 ∈ 𝑢) → 0 ≤ (abs‘𝐵))
45	39, 43, 44	itgposval 25788	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))))
46	35	sseld 3921	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 → 𝑥 ∈ 𝐴))
47	46	pm4.71d 566	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ 𝑢 ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴)))
48	47	ifbid 4485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0))
49		ifan 4515	. . . . . . . . . . . . . . 15 ⊢ if((𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝐴), (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)
50	48, 49	eqtrdi 2791	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → if(𝑥 ∈ 𝑢, (abs‘𝐵), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
51	50	mpteq2dv 5173	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
52	51	fveq2d 6838	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, (abs‘𝐵), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
53	45, 52	eqtrd 2775	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))))
54		nfv 1921	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑢
55		nffvmpt1 6845	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦)
56		nfcv 2902	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥0
57	54, 55, 56	nfif 4492	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)
58		nfcv 2902	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)
59		elequ1 2126	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑢 ↔ 𝑥 ∈ 𝑢))
60		fveq2 6834	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦) = ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥))
61	59, 60	ifbieq1d 4486	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0) = if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
62	57, 58, 61	cbvmpt 5181	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0))
63		fvex 6847	. . . . . . . . . . . . . . . . 17 ⊢ (abs‘𝐵) ∈ V
64		c0ex 11136	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ V
65	63, 64	ifex 4512	. . . . . . . . . . . . . . . 16 ⊢ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V
66		eqid 2740	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
67	66	fvmpt2 6954	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0) ∈ V) → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
68	65, 67	mpan2 697	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥) = if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))
69	68	ifeq1d 4481	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℝ → if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0) = if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
70	69	mpteq2ia 5174	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑥), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
71	62, 70	eqtri 2763	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0))
72	71	fveq2i 6837	. . . . . . . . . . 11 ⊢ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) = (∫₂‘(𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝑢, if(𝑥 ∈ 𝐴, (abs‘𝐵), 0), 0)))
73	53, 72	eqtr4di 2793	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → ∫𝑢(abs‘𝐵) d𝑥 = (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))))
74	73	breq1d 5089	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ dom vol ∧ 𝑢 ⊆ 𝐴)) → (∫𝑢(abs‘𝐵) d𝑥 < 𝐶 ↔ (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶))
75	74	biimprd 249	. . . . . . . 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 3152	. . 3 ⊢ (𝜑 → (∀𝑢 ∈ dom vol((vol‘𝑢) < 𝑑 → (∫₂‘(𝑦 ∈ ℝ ↦ if(𝑦 ∈ 𝑢, ((𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘𝐵), 0))‘𝑦), 0))) < 𝐶) → ∀𝑢 ∈ dom vol((𝑢 ⊆ 𝐴 ∧ (vol‘𝑢) < 𝑑) → ∫𝑢(abs‘𝐵) d𝑥 < 𝐶)))
81	80	reximdv 3155	. 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 1547 ∈ wcel 2119 ∀wral 3054 ∃wrex 3064 Vcvv 3432 ∖ cdif 3887 ⊆ wss 3890 ifcif 4461 class class class wbr 5079 ↦ cmpt 5160 dom cdm 5625 ‘cfv 6492 (class class class)co 7363 ℂcc 11034 ℝcr 11035 0cc0 11036 +∞cpnf 11174 < clt 11177 ≤ cle 11178 ℝ⁺crp 12940 [,)cico 13298 abscabs 15194 volcvol 25455 MblFncmbf 25606 ∫₂citg2 25608 𝐿¹cibl 25609 ∫citg 25610

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-inf2 9560 ax-cc 10355 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114 ax-addf 11115

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-iin 4931 df-disj 5047 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-of 7627 df-ofr 7628 df-om 7814 df-1st 7938 df-2nd 7939 df-supp 8108 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-oadd 8406 df-omul 8407 df-er 8640 df-map 8772 df-pm 8773 df-ixp 8843 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-fi 9321 df-sup 9352 df-inf 9353 df-oi 9422 df-dju 9823 df-card 9861 df-acn 9864 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-8 12248 df-9 12249 df-n0 12436 df-z 12523 df-dec 12643 df-uz 12787 df-q 12897 df-rp 12941 df-xneg 13061 df-xadd 13062 df-xmul 13063 df-ioo 13300 df-ioc 13301 df-ico 13302 df-icc 13303 df-fz 13460 df-fzo 13607 df-fl 13749 df-mod 13827 df-seq 13962 df-exp 14022 df-hash 14291 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-clim 15448 df-rlim 15449 df-sum 15647 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-mulr 17232 df-starv 17233 df-sca 17234 df-vsca 17235 df-ip 17236 df-tset 17237 df-ple 17238 df-ds 17240 df-unif 17241 df-hom 17242 df-cco 17243 df-rest 17383 df-topn 17384 df-0g 17402 df-gsum 17403 df-topgen 17404 df-pt 17405 df-prds 17408 df-xrs 17464 df-qtop 17469 df-imas 17470 df-xps 17472 df-mre 17546 df-mrc 17547 df-acs 17549 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-submnd 18750 df-mulg 19042 df-cntz 19290 df-cmn 19755 df-psmet 21346 df-xmet 21347 df-met 21348 df-bl 21349 df-mopn 21350 df-cnfld 21355 df-top 22884 df-topon 22901 df-topsp 22923 df-bases 22936 df-cn 23217 df-cnp 23218 df-cmp 23377 df-tx 23552 df-hmeo 23745 df-xms 24310 df-ms 24311 df-tms 24312 df-cncf 24870 df-ovol 25456 df-vol 25457 df-mbf 25611 df-itg1 25612 df-itg2 25613 df-ibl 25614 df-itg 25615 df-0p 25662

This theorem is referenced by: ftc1a 26029

W3C validator