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 37194

Description: Choice-free analogue of itgadd 25782. (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 25725	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		ibladdnc.1	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25593	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6		ibladdnc.4	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
7		iblmbf 25725	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
9		ibladdnc.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑉)
10	8, 9	mbfmptcl 25593	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
11	5, 10	readdd 15203	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 + 𝐶)) = ((ℜ‘𝐵) + (ℜ‘𝐶)))
12	11	itgeq2dv 25739	. . . . 5 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥)
13	5	recld 15183	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℝ)
14	5	iblcn 25756	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)))
15	1, 14	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹))
16	15	simpld 493	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹)
17	10	recld 15183	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐶) ∈ ℝ)
18	10	iblcn 25756	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)))
19	6, 18	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹))
20	19	simpld 493	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹)
21	5, 10	addcld 11273	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
22		eqidd 2729	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)))
23		ref 15101	. . . . . . . . . . 11 ⊢ ℜ:ℂ⟶ℝ
24	23	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ℜ:ℂ⟶ℝ)
25	24	feqmptd 6972	. . . . . . . . 9 ⊢ (𝜑 → ℜ = (𝑦 ∈ ℂ ↦ (ℜ‘𝑦)))
26		fveq2 6902	. . . . . . . . 9 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℜ‘𝑦) = (ℜ‘(𝐵 + 𝐶)))
27	21, 22, 25, 26	fmptco 7144	. . . . . . . 8 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))))
28	11	mpteq2dva 5252	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
29	27, 28	eqtrd 2768	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
30		ibladdnc.m	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)
31	21	fmpttd 7130	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
32		ismbfcn 25586	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
33	31, 32	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
34	30, 33	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn))
35	34	simpld 493	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
36	29, 35	eqeltrrd 2830	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))) ∈ MblFn)
37	13, 16, 17, 20, 36, 13, 17	itgaddnclem2 37193	. . . . 5 ⊢ (𝜑 → ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
38	12, 37	eqtrd 2768	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
39	5, 10	imaddd 15204	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘(𝐵 + 𝐶)) = ((ℑ‘𝐵) + (ℑ‘𝐶)))
40	39	itgeq2dv 25739	. . . . . . 7 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥)
41	5	imcld 15184	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℝ)
42	15	simprd 494	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)
43	10	imcld 15184	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐶) ∈ ℝ)
44	19	simprd 494	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)
45		imf 15102	. . . . . . . . . . . . 13 ⊢ ℑ:ℂ⟶ℝ
46	45	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℑ:ℂ⟶ℝ)
47	46	feqmptd 6972	. . . . . . . . . . 11 ⊢ (𝜑 → ℑ = (𝑦 ∈ ℂ ↦ (ℑ‘𝑦)))
48		fveq2 6902	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℑ‘𝑦) = (ℑ‘(𝐵 + 𝐶)))
49	21, 22, 47, 48	fmptco 7144	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))))
50	39	mpteq2dva 5252	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
51	49, 50	eqtrd 2768	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
52	34	simprd 494	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
53	51, 52	eqeltrrd 2830	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))) ∈ MblFn)
54	41, 42, 43, 44, 53, 41, 43	itgaddnclem2 37193	. . . . . . 7 ⊢ (𝜑 → ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
55	40, 54	eqtrd 2768	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
56	55	oveq2d 7442	. . . . 5 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)))
57		ax-icn 11207	. . . . . . 7 ⊢ i ∈ ℂ
58	57	a1i 11	. . . . . 6 ⊢ (𝜑 → i ∈ ℂ)
59	41, 42	itgcl 25741	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ)
60	43, 44	itgcl 25741	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ)
61	58, 59, 60	adddid 11278	. . . . 5 ⊢ (𝜑 → (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
62	56, 61	eqtrd 2768	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
63	38, 62	oveq12d 7444	. . 3 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
64	13, 16	itgcl 25741	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 ∈ ℂ)
65	17, 20	itgcl 25741	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐶) d𝑥 ∈ ℂ)
66		mulcl 11232	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
67	57, 59, 66	sylancr 585	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
68		mulcl 11232	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
69	57, 60, 68	sylancr 585	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
70	64, 65, 67, 69	add4d 11482	. . 3 ⊢ (𝜑 → ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
71	63, 70	eqtrd 2768	. 2 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
72		ovexd 7461	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ V)
73	4, 1, 9, 6, 30	ibladdnc 37191	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿¹)
74	72, 73	itgcnval 25757	. 2 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)))
75	4, 1	itgcnval 25757	. . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
76	9, 6	itgcnval 25757	. . 3 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
77	75, 76	oveq12d 7444	. 2 ⊢ (𝜑 → (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
78	71, 74, 77	3eqtr4d 2778	1 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 Vcvv 3473 ↦ cmpt 5235 ∘ ccom 5686 ⟶wf 6549 ‘cfv 6553 (class class class)co 7426 ℂcc 11146 ℝcr 11147 ici 11150 + caddc 11151 · cmul 11153 ℜcre 15086 ℑcim 15087 MblFncmbf 25571 𝐿¹cibl 25574 ∫citg 25575

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7748 ax-inf2 9674 ax-cnex 11204 ax-resscn 11205 ax-1cn 11206 ax-icn 11207 ax-addcl 11208 ax-addrcl 11209 ax-mulcl 11210 ax-mulrcl 11211 ax-mulcom 11212 ax-addass 11213 ax-mulass 11214 ax-distr 11215 ax-i2m1 11216 ax-1ne0 11217 ax-1rid 11218 ax-rnegex 11219 ax-rrecex 11220 ax-cnre 11221 ax-pre-lttri 11222 ax-pre-lttrn 11223 ax-pre-ltadd 11224 ax-pre-mulgt0 11225 ax-pre-sup 11226 ax-addf 11227

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-int 4954 df-iun 5002 df-disj 5118 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-isom 6562 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-of 7692 df-ofr 7693 df-om 7879 df-1st 8001 df-2nd 8002 df-frecs 8295 df-wrecs 8326 df-recs 8400 df-rdg 8439 df-1o 8495 df-2o 8496 df-er 8733 df-map 8855 df-pm 8856 df-en 8973 df-dom 8974 df-sdom 8975 df-fin 8976 df-fi 9444 df-sup 9475 df-inf 9476 df-oi 9543 df-dju 9934 df-card 9972 df-pnf 11290 df-mnf 11291 df-xr 11292 df-ltxr 11293 df-le 11294 df-sub 11486 df-neg 11487 df-div 11912 df-nn 12253 df-2 12315 df-3 12316 df-4 12317 df-n0 12513 df-z 12599 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13134 df-xadd 13135 df-xmul 13136 df-ioo 13370 df-ico 13372 df-icc 13373 df-fz 13527 df-fzo 13670 df-fl 13799 df-mod 13877 df-seq 14009 df-exp 14069 df-hash 14332 df-cj 15088 df-re 15089 df-im 15090 df-sqrt 15224 df-abs 15225 df-clim 15474 df-sum 15675 df-rest 17413 df-topgen 17434 df-psmet 21285 df-xmet 21286 df-met 21287 df-bl 21288 df-mopn 21289 df-top 22824 df-topon 22841 df-bases 22877 df-cmp 23319 df-ovol 25421 df-vol 25422 df-mbf 25576 df-itg1 25577 df-itg2 25578 df-ibl 25579 df-itg 25580 df-0p 25627

This theorem is referenced by: itgsubnc 37196 itgmulc2nc 37202 ftc1cnnclem 37205

W3C validator