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 36543

Description: Choice-free analogue of itgadd 25341. (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 25284	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
4		ibladdnc.1	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
5	3, 4	mbfmptcl 25152	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
6		ibladdnc.4	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹)
7		iblmbf 25284	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
8	6, 7	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)
9		ibladdnc.3	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑉)
10	8, 9	mbfmptcl 25152	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
11	5, 10	readdd 15160	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘(𝐵 + 𝐶)) = ((ℜ‘𝐵) + (ℜ‘𝐶)))
12	11	itgeq2dv 25298	. . . . 5 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥)
13	5	recld 15140	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐵) ∈ ℝ)
14	5	iblcn 25315	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)))
15	1, 14	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹))
16	15	simpld 495	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐵)) ∈ 𝐿¹)
17	10	recld 15140	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℜ‘𝐶) ∈ ℝ)
18	10	iblcn 25315	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)))
19	6, 18	mpbid 231	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹ ∧ (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹))
20	19	simpld 495	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘𝐶)) ∈ 𝐿¹)
21	5, 10	addcld 11232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
22		eqidd 2733	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)))
23		ref 15058	. . . . . . . . . . 11 ⊢ ℜ:ℂ⟶ℝ
24	23	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ℜ:ℂ⟶ℝ)
25	24	feqmptd 6960	. . . . . . . . 9 ⊢ (𝜑 → ℜ = (𝑦 ∈ ℂ ↦ (ℜ‘𝑦)))
26		fveq2 6891	. . . . . . . . 9 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℜ‘𝑦) = (ℜ‘(𝐵 + 𝐶)))
27	21, 22, 25, 26	fmptco 7126	. . . . . . . 8 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))))
28	11	mpteq2dva 5248	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℜ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
29	27, 28	eqtrd 2772	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))))
30		ibladdnc.m	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn)
31	21	fmpttd 7114	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
32		ismbfcn 25145	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
33	31, 32	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ MblFn ↔ ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)))
34	30, 33	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn ∧ (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn))
35	34	simpld 495	. . . . . . 7 ⊢ (𝜑 → (ℜ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
36	29, 35	eqeltrrd 2834	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℜ‘𝐵) + (ℜ‘𝐶))) ∈ MblFn)
37	13, 16, 17, 20, 36, 13, 17	itgaddnclem2 36542	. . . . 5 ⊢ (𝜑 → ∫𝐴((ℜ‘𝐵) + (ℜ‘𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
38	12, 37	eqtrd 2772	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥))
39	5, 10	imaddd 15161	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘(𝐵 + 𝐶)) = ((ℑ‘𝐵) + (ℑ‘𝐶)))
40	39	itgeq2dv 25298	. . . . . . 7 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥)
41	5	imcld 15141	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐵) ∈ ℝ)
42	15	simprd 496	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐵)) ∈ 𝐿¹)
43	10	imcld 15141	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ℑ‘𝐶) ∈ ℝ)
44	19	simprd 496	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘𝐶)) ∈ 𝐿¹)
45		imf 15059	. . . . . . . . . . . . 13 ⊢ ℑ:ℂ⟶ℝ
46	45	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℑ:ℂ⟶ℝ)
47	46	feqmptd 6960	. . . . . . . . . . 11 ⊢ (𝜑 → ℑ = (𝑦 ∈ ℂ ↦ (ℑ‘𝑦)))
48		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐵 + 𝐶) → (ℑ‘𝑦) = (ℑ‘(𝐵 + 𝐶)))
49	21, 22, 47, 48	fmptco 7126	. . . . . . . . . 10 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))))
50	39	mpteq2dva 5248	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (ℑ‘(𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
51	49, 50	eqtrd 2772	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) = (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))))
52	34	simprd 496	. . . . . . . . 9 ⊢ (𝜑 → (ℑ ∘ (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))) ∈ MblFn)
53	51, 52	eqeltrrd 2834	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((ℑ‘𝐵) + (ℑ‘𝐶))) ∈ MblFn)
54	41, 42, 43, 44, 53, 41, 43	itgaddnclem2 36542	. . . . . . 7 ⊢ (𝜑 → ∫𝐴((ℑ‘𝐵) + (ℑ‘𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
55	40, 54	eqtrd 2772	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥 = (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥))
56	55	oveq2d 7424	. . . . 5 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)))
57		ax-icn 11168	. . . . . . 7 ⊢ i ∈ ℂ
58	57	a1i 11	. . . . . 6 ⊢ (𝜑 → i ∈ ℂ)
59	41, 42	itgcl 25300	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ)
60	43, 44	itgcl 25300	. . . . . 6 ⊢ (𝜑 → ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ)
61	58, 59, 60	adddid 11237	. . . . 5 ⊢ (𝜑 → (i · (∫𝐴(ℑ‘𝐵) d𝑥 + ∫𝐴(ℑ‘𝐶) d𝑥)) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
62	56, 61	eqtrd 2772	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥) = ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
63	38, 62	oveq12d 7426	. . 3 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
64	13, 16	itgcl 25300	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐵) d𝑥 ∈ ℂ)
65	17, 20	itgcl 25300	. . . 4 ⊢ (𝜑 → ∫𝐴(ℜ‘𝐶) d𝑥 ∈ ℂ)
66		mulcl 11193	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐵) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
67	57, 59, 66	sylancr 587	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐵) d𝑥) ∈ ℂ)
68		mulcl 11193	. . . . 5 ⊢ ((i ∈ ℂ ∧ ∫𝐴(ℑ‘𝐶) d𝑥 ∈ ℂ) → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
69	57, 60, 68	sylancr 587	. . . 4 ⊢ (𝜑 → (i · ∫𝐴(ℑ‘𝐶) d𝑥) ∈ ℂ)
70	64, 65, 67, 69	add4d 11441	. . 3 ⊢ (𝜑 → ((∫𝐴(ℜ‘𝐵) d𝑥 + ∫𝐴(ℜ‘𝐶) d𝑥) + ((i · ∫𝐴(ℑ‘𝐵) d𝑥) + (i · ∫𝐴(ℑ‘𝐶) d𝑥))) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
71	63, 70	eqtrd 2772	. 2 ⊢ (𝜑 → (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
72		ovexd 7443	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ V)
73	4, 1, 9, 6, 30	ibladdnc 36540	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∈ 𝐿¹)
74	72, 73	itgcnval 25316	. 2 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴(ℜ‘(𝐵 + 𝐶)) d𝑥 + (i · ∫𝐴(ℑ‘(𝐵 + 𝐶)) d𝑥)))
75	4, 1	itgcnval 25316	. . 3 ⊢ (𝜑 → ∫𝐴𝐵 d𝑥 = (∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)))
76	9, 6	itgcnval 25316	. . 3 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥)))
77	75, 76	oveq12d 7426	. 2 ⊢ (𝜑 → (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥) = ((∫𝐴(ℜ‘𝐵) d𝑥 + (i · ∫𝐴(ℑ‘𝐵) d𝑥)) + (∫𝐴(ℜ‘𝐶) d𝑥 + (i · ∫𝐴(ℑ‘𝐶) d𝑥))))
78	71, 74, 77	3eqtr4d 2782	1 ⊢ (𝜑 → ∫𝐴(𝐵 + 𝐶) d𝑥 = (∫𝐴𝐵 d𝑥 + ∫𝐴𝐶 d𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ↦ cmpt 5231 ∘ ccom 5680 ⟶wf 6539 ‘cfv 6543 (class class class)co 7408 ℂcc 11107 ℝcr 11108 ici 11111 + caddc 11112 · cmul 11114 ℜcre 15043 ℑcim 15044 MblFncmbf 25130 𝐿¹cibl 25133 ∫citg 25134

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-inf2 9635 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187 ax-addf 11188

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-disj 5114 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7669 df-ofr 7670 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-2o 8466 df-er 8702 df-map 8821 df-pm 8822 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-fi 9405 df-sup 9436 df-inf 9437 df-oi 9504 df-dju 9895 df-card 9933 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-nn 12212 df-2 12274 df-3 12275 df-4 12276 df-n0 12472 df-z 12558 df-uz 12822 df-q 12932 df-rp 12974 df-xneg 13091 df-xadd 13092 df-xmul 13093 df-ioo 13327 df-ico 13329 df-icc 13330 df-fz 13484 df-fzo 13627 df-fl 13756 df-mod 13834 df-seq 13966 df-exp 14027 df-hash 14290 df-cj 15045 df-re 15046 df-im 15047 df-sqrt 15181 df-abs 15182 df-clim 15431 df-sum 15632 df-rest 17367 df-topgen 17388 df-psmet 20935 df-xmet 20936 df-met 20937 df-bl 20938 df-mopn 20939 df-top 22395 df-topon 22412 df-bases 22448 df-cmp 22890 df-ovol 24980 df-vol 24981 df-mbf 25135 df-itg1 25136 df-itg2 25137 df-ibl 25138 df-itg 25139 df-0p 25186

This theorem is referenced by: itgsubnc 36545 itgmulc2nc 36551 ftc1cnnclem 36554

W3C validator