itgaddnc - Mathbox for Brendan Leahy

	Mathbox for Brendan Leahy		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > itgaddnc		Structured version Visualization version GIF version

Theorem itgaddnc 36548

Description: Choice-free analogue of itgadd 25342. (Contributed by Brendan Leahy, 11-Nov-2017.)

**Hypotheses**
Ref	Expression
ibladdnc.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
ibladdnc.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
ibladdnc.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑉)
ibladdnc.4	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
ibladdnc.m	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)

**Assertion**
Ref	Expression
itgaddnc	⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

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

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

Step	Hyp	Ref	Expression
1		ibladdnc.2	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
2		iblmbf 25285	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		ibladdnc.1	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25153	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6		ibladdnc.4	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
7		iblmbf 25285	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
9		ibladdnc.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑉)
10	8, 9	mbfmptcl 25153	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
11	5, 10	readdd 15161	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 + 𝐶)) = ((ℜ‘𝐵) + (ℜ‘𝐶)))
12	11	itgeq2dv 25299	. . . . 5 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥)
13	5	recld 15141	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℝ)
14	5	iblcn 25316	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)))
15	1, 14	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹))
16	15	simpld 496	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹)
17	10	recld 15141	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐶) ∈ ℝ)
18	10	iblcn 25316	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)))
19	6, 18	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹))
20	19	simpld 496	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹)
21	5, 10	addcld 11233	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
22		eqidd 2734	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)))
23		ref 15059	. . . . . . . . . . 11 ⊢ ℜ:ℂ⟶ℝ
24	23	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ℜ:ℂ⟶ℝ)
25	24	feqmptd 6961	. . . . . . . . 9 ⊢ (𝜑 → ℜ = (𝑦 ∈ ℂ ↦ (ℜ‘𝑦)))
26		fveq2 6892	. . . . . . . . 9 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℜ‘𝑦) = (ℜ‘(𝐵 + 𝐶)))
27	21, 22, 25, 26	fmptco 7127	. . . . . . . 8 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))))
28	11	mpteq2dva 5249	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
29	27, 28	eqtrd 2773	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
30		ibladdnc.m	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)
31	21	fmpttd 7115	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
32		ismbfcn 25146	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
33	31, 32	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
34	30, 33	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn))
35	34	simpld 496	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
36	29, 35	eqeltrrd 2835	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))) ∈ MblFn)
37	13, 16, 17, 20, 36, 13, 17	itgaddnclem2 36547	. . . . 5 ⊢ (𝜑 → ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
38	12, 37	eqtrd 2773	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
39	5, 10	imaddd 15162	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘(𝐵 + 𝐶)) = ((ℑ‘𝐵) + (ℑ‘𝐶)))
40	39	itgeq2dv 25299	. . . . . . 7 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥)
41	5	imcld 15142	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℝ)
42	15	simprd 497	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)
43	10	imcld 15142	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐶) ∈ ℝ)
44	19	simprd 497	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)
45		imf 15060	. . . . . . . . . . . . 13 ⊢ ℑ:ℂ⟶ℝ
46	45	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℑ:ℂ⟶ℝ)
47	46	feqmptd 6961	. . . . . . . . . . 11 ⊢ (𝜑 → ℑ = (𝑦 ∈ ℂ ↦ (ℑ‘𝑦)))
48		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℑ‘𝑦) = (ℑ‘(𝐵 + 𝐶)))
49	21, 22, 47, 48	fmptco 7127	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))))
50	39	mpteq2dva 5249	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
51	49, 50	eqtrd 2773	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
52	34	simprd 497	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
53	51, 52	eqeltrrd 2835	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))) ∈ MblFn)
54	41, 42, 43, 44, 53, 41, 43	itgaddnclem2 36547	. . . . . . 7 ⊢ (𝜑 → ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
55	40, 54	eqtrd 2773	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
56	55	oveq2d 7425	. . . . 5 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)))
57		ax-icn 11169	. . . . . . 7 ⊢ i ∈ ℂ
58	57	a1i 11	. . . . . 6 ⊢ (𝜑 → i ∈ ℂ)
59	41, 42	itgcl 25301	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ)
60	43, 44	itgcl 25301	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ)
61	58, 59, 60	adddid 11238	. . . . 5 ⊢ (𝜑 → (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
62	56, 61	eqtrd 2773	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
63	38, 62	oveq12d 7427	. . 3 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
64	13, 16	itgcl 25301	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 ∈ ℂ)
65	17, 20	itgcl 25301	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐶) d𝑥 ∈ ℂ)
66		mulcl 11194	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
67	57, 59, 66	sylancr 588	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
68		mulcl 11194	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
69	57, 60, 68	sylancr 588	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
70	64, 65, 67, 69	add4d 11442	. . 3 ⊢ (𝜑 → ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
71	63, 70	eqtrd 2773	. 2 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
72		ovexd 7444	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ V)
73	4, 1, 9, 6, 30	ibladdnc 36545	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿¹)
74	72, 73	itgcnval 25317	. 2 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)))
75	4, 1	itgcnval 25317	. . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
76	9, 6	itgcnval 25317	. . 3 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
77	75, 76	oveq12d 7427	. 2 ⊢ (𝜑 → (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
78	71, 74, 77	3eqtr4d 2783	1 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3475 ↦ cmpt 5232 ∘ ccom 5681 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 ℝcr 11109 ici 11112 + caddc 11113 · cmul 11115 ℜcre 15044 ℑcim 15045 MblFncmbf 25131 𝐿¹cibl 25134 ∫citg 25135

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-disj 5115 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-ofr 7671 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fi 9406 df-sup 9437 df-inf 9438 df-oi 9505 df-dju 9896 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-n0 12473 df-z 12559 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ioo 13328 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-sum 15633 df-rest 17368 df-topgen 17389 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-top 22396 df-topon 22413 df-bases 22449 df-cmp 22891 df-ovol 24981 df-vol 24982 df-mbf 25136 df-itg1 25137 df-itg2 25138 df-ibl 25139 df-itg 25140 df-0p 25187

This theorem is referenced by: itgsubnc 36550 itgmulc2nc 36556 ftc1cnnclem 36559

W3C validator