itgiccshift - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > itgiccshift		Structured version Visualization version GIF version

Theorem itgiccshift 45430

Description: The integral of a function, 𝐹 stays the same if its closed interval domain is shifted by 𝑇. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
itgiccshift.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
itgiccshift.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
itgiccshift.aleb	⊢ (𝜑 → 𝐴 ≤ 𝐵)
itgiccshift.f	⊢ (𝜑 → 𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ))
itgiccshift.t	⊢ (𝜑 → 𝑇 ∈ ℝ⁺)
itgiccshift.g	⊢ 𝐺 = (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇)))

**Assertion**
Ref	Expression
itgiccshift	⊢ (𝜑 → ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐹 𝑥,𝐺 𝑥,𝑇 𝜑,𝑥

Proof of Theorem itgiccshift Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		itgiccshift.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2		itgiccshift.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3		itgiccshift.t	. . . . . 6 ⊢ (𝜑 → 𝑇 ∈ ℝ⁺)
4	3	rpred 13046	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ ℝ)
5		itgiccshift.aleb	. . . . 5 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
6	1, 2, 4, 5	leadd1dd 11856	. . . 4 ⊢ (𝜑 → (𝐴 + 𝑇) ≤ (𝐵 + 𝑇))
7	6	ditgpos 25801	. . 3 ⊢ (𝜑 → ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥 = ∫((𝐴 + 𝑇)(,)(𝐵 + 𝑇))(𝐺‘𝑥) d𝑥)
8	1, 4	readdcld 11271	. . . 4 ⊢ (𝜑 → (𝐴 + 𝑇) ∈ ℝ)
9	2, 4	readdcld 11271	. . . 4 ⊢ (𝜑 → (𝐵 + 𝑇) ∈ ℝ)
10		itgiccshift.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ))
11		cncff 24829	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝐴[,]𝐵)⟶ℂ)
13	12	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
14	1	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 ∈ ℝ)
15	2	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐵 ∈ ℝ)
16	8	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐴 + 𝑇) ∈ ℝ)
17	9	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐵 + 𝑇) ∈ ℝ)
18		simpr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
19		eliccre 44952	. . . . . . . . . 10 ⊢ (((𝐴 + 𝑇) ∈ ℝ ∧ (𝐵 + 𝑇) ∈ ℝ ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ℝ)
20	16, 17, 18, 19	syl3anc 1368	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ℝ)
21	4	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑇 ∈ ℝ)
22	20, 21	resubcld 11670	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ∈ ℝ)
23	1	recnd 11270	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℂ)
24	4	recnd 11270	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 ∈ ℂ)
25	23, 24	pncand 11600	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴 + 𝑇) − 𝑇) = 𝐴)
26	25	eqcomd 2731	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 = ((𝐴 + 𝑇) − 𝑇))
27	26	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 = ((𝐴 + 𝑇) − 𝑇))
28		elicc2 13419	. . . . . . . . . . . . 13 ⊢ (((𝐴 + 𝑇) ∈ ℝ ∧ (𝐵 + 𝑇) ∈ ℝ) → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇))))
29	16, 17, 28	syl2anc 582	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇))))
30	18, 29	mpbid 231	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇)))
31	30	simp2d 1140	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐴 + 𝑇) ≤ 𝑥)
32	16, 20, 21, 31	lesub1dd 11858	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → ((𝐴 + 𝑇) − 𝑇) ≤ (𝑥 − 𝑇))
33	27, 32	eqbrtrd 5165	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 ≤ (𝑥 − 𝑇))
34	30	simp3d 1141	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ≤ (𝐵 + 𝑇))
35	20, 17, 21, 34	lesub1dd 11858	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ≤ ((𝐵 + 𝑇) − 𝑇))
36	2	recnd 11270	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℂ)
37	36, 24	pncand 11600	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐵 + 𝑇) − 𝑇) = 𝐵)
38	37	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → ((𝐵 + 𝑇) − 𝑇) = 𝐵)
39	35, 38	breqtrd 5169	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ≤ 𝐵)
40	14, 15, 22, 33, 39	eliccd 44951	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ∈ (𝐴[,]𝐵))
41	13, 40	ffvelcdmd 7089	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐹‘(𝑥 − 𝑇)) ∈ ℂ)
42		itgiccshift.g	. . . . . 6 ⊢ 𝐺 = (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇)))
43	41, 42	fmptd 7118	. . . . 5 ⊢ (𝜑 → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
44	43	ffvelcdmda 7088	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐺‘𝑥) ∈ ℂ)
45	8, 9, 44	itgioo 25761	. . 3 ⊢ (𝜑 → ∫((𝐴 + 𝑇)(,)(𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥)
46	7, 45	eqtr2d 2766	. 2 ⊢ (𝜑 → ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥)
47		eqid 2725	. . . 4 ⊢ (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) = (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇))
48	47	addccncf 24853	. . . . 5 ⊢ (𝑇 ∈ ℂ → (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) ∈ (ℂ–cn→ℂ))
49	24, 48	syl 17	. . . 4 ⊢ (𝜑 → (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) ∈ (ℂ–cn→ℂ))
50	1, 2	iccssred 13441	. . . . 5 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
51		ax-resscn 11193	. . . . 5 ⊢ ℝ ⊆ ℂ
52	50, 51	sstrdi 3985	. . . 4 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℂ)
53	8, 9	iccssred 13441	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ⊆ ℝ)
54	53, 51	sstrdi 3985	. . . 4 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ⊆ ℂ)
55	8	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ∈ ℝ)
56	9	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐵 + 𝑇) ∈ ℝ)
57	50	sselda 3972	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ ℝ)
58	4	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℝ)
59	57, 58	readdcld 11271	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ∈ ℝ)
60	1	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ)
61		simpr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
62	2	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
63		elicc2 13419	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
64	60, 62, 63	syl2anc 582	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
65	61, 64	mpbid 231	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵))
66	65	simp2d 1140	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑦)
67	60, 57, 58, 66	leadd1dd 11856	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ≤ (𝑦 + 𝑇))
68	65	simp3d 1141	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ≤ 𝐵)
69	57, 62, 58, 68	leadd1dd 11856	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ≤ (𝐵 + 𝑇))
70	55, 56, 59, 67, 69	eliccd 44951	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
71	47, 49, 52, 54, 70	cncfmptssg 45321	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)) ∈ ((𝐴[,]𝐵)–cn→((𝐴 + 𝑇)[,](𝐵 + 𝑇))))
72		fvoveq1 7438	. . . . . . . 8 ⊢ (𝑥 = 𝑤 → (𝐹‘(𝑥 − 𝑇)) = (𝐹‘(𝑤 − 𝑇)))
73	72	cbvmptv 5256	. . . . . . 7 ⊢ (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇))) = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇)))
74	1, 2, 4	iccshift 44965	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) = {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)})
75	74	mpteq1d 5238	. . . . . . 7 ⊢ (𝜑 → (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
76	73, 75	eqtrid 2777	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
77	42, 76	eqtrid 2777	. . . . 5 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
78		eqeq1 2729	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → (𝑤 = (𝑧 + 𝑇) ↔ 𝑥 = (𝑧 + 𝑇)))
79	78	rexbidv 3169	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇) ↔ ∃𝑧 ∈ (𝐴[,]𝐵)𝑥 = (𝑧 + 𝑇)))
80		oveq1 7422	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑦 → (𝑧 + 𝑇) = (𝑦 + 𝑇))
81	80	eqeq2d 2736	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑥 = (𝑧 + 𝑇) ↔ 𝑥 = (𝑦 + 𝑇)))
82	81	cbvrexvw 3226	. . . . . . . . 9 ⊢ (∃𝑧 ∈ (𝐴[,]𝐵)𝑥 = (𝑧 + 𝑇) ↔ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇))
83	79, 82	bitrdi 286	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇) ↔ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)))
84	83	cbvrabv 3430	. . . . . . 7 ⊢ {𝑤 ∈ ℂ ∣ ∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇)} = {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}
85	84	eqcomi 2734	. . . . . 6 ⊢ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} = {𝑤 ∈ ℂ ∣ ∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇)}
86		eqid 2725	. . . . . 6 ⊢ (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇)))
87	52, 24, 85, 10, 86	cncfshift 45324	. . . . 5 ⊢ (𝜑 → (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))) ∈ ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ))
88	77, 87	eqeltrd 2825	. . . 4 ⊢ (𝜑 → 𝐺 ∈ ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ))
89	43	feqmptd 6961	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐺‘𝑥)))
90	74	eqcomd 2731	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} = ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
91	90	oveq1d 7430	. . . 4 ⊢ (𝜑 → ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ) = (((𝐴 + 𝑇)[,](𝐵 + 𝑇))–cn→ℂ))
92	88, 89, 91	3eltr3d 2839	. . 3 ⊢ (𝜑 → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐺‘𝑥)) ∈ (((𝐴 + 𝑇)[,](𝐵 + 𝑇))–cn→ℂ))
93		ioosscn 13416	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
94	93	a1i 11	. . . . 5 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
95		1cnd 11237	. . . . 5 ⊢ (𝜑 → 1 ∈ ℂ)
96		ssid 3995	. . . . . 6 ⊢ ℂ ⊆ ℂ
97	96	a1i 11	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
98	94, 95, 97	constcncfg 45322	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ ((𝐴(,)𝐵)–cn→ℂ))
99		fconstmpt 5734	. . . . 5 ⊢ ((𝐴(,)𝐵) × {1}) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1)
100		ioombl 25510	. . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol
101	100	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ dom vol)
102		ioovolcl 25515	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (vol‘(𝐴(,)𝐵)) ∈ ℝ)
103	1, 2, 102	syl2anc 582	. . . . . 6 ⊢ (𝜑 → (vol‘(𝐴(,)𝐵)) ∈ ℝ)
104		iblconst 25763	. . . . . 6 ⊢ (((𝐴(,)𝐵) ∈ dom vol ∧ (vol‘(𝐴(,)𝐵)) ∈ ℝ ∧ 1 ∈ ℂ) → ((𝐴(,)𝐵) × {1}) ∈ 𝐿¹)
105	101, 103, 95, 104	syl3anc 1368	. . . . 5 ⊢ (𝜑 → ((𝐴(,)𝐵) × {1}) ∈ 𝐿¹)
106	99, 105	eqeltrrid 2830	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ 𝐿¹)
107	98, 106	elind 4188	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ (((𝐴(,)𝐵)–cn→ℂ) ∩ 𝐿¹))
108	50	resmptd 6039	. . . . . . 7 ⊢ (𝜑 → ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵)) = (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)))
109	108	eqcomd 2731	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)) = ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵)))
110	109	oveq2d 7431	. . . . 5 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))))
111	51	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ⊆ ℂ)
112	111	sselda 3972	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
113	24	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑇 ∈ ℂ)
114	112, 113	addcld 11261	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 + 𝑇) ∈ ℂ)
115	114	fmpttd 7119	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)):ℝ⟶ℂ)
116		ssid 3995	. . . . . . 7 ⊢ ℝ ⊆ ℝ
117	116	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ⊆ ℝ)
118		eqid 2725	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
119	118	tgioo2 24735	. . . . . . 7 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
120	118, 119	dvres 25856	. . . . . 6 ⊢ (((ℝ ⊆ ℂ ∧ (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)):ℝ⟶ℂ) ∧ (ℝ ⊆ ℝ ∧ (𝐴[,]𝐵) ⊆ ℝ)) → (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
121	111, 115, 117, 50, 120	syl22anc 837	. . . . 5 ⊢ (𝜑 → (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
122	110, 121	eqtrd 2765	. . . 4 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
123		iccntr 24753	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
124	1, 2, 123	syl2anc 582	. . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
125	124	reseq2d 5979	. . . 4 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)))
126		reelprrecn 11228	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
127	126	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
128		1cnd 11237	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 1 ∈ ℂ)
129	127	dvmptid 25905	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ 𝑦)) = (𝑦 ∈ ℝ ↦ 1))
130		0cnd 11235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 0 ∈ ℂ)
131	127, 24	dvmptc 25906	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ 𝑇)) = (𝑦 ∈ ℝ ↦ 0))
132	127, 112, 128, 129, 113, 130, 131	dvmptadd 25908	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) = (𝑦 ∈ ℝ ↦ (1 + 0)))
133	132	reseq1d 5978	. . . . 5 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)) = ((𝑦 ∈ ℝ ↦ (1 + 0)) ↾ (𝐴(,)𝐵)))
134		ioossre 13415	. . . . . . 7 ⊢ (𝐴(,)𝐵) ⊆ ℝ
135	134	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
136	135	resmptd 6039	. . . . 5 ⊢ (𝜑 → ((𝑦 ∈ ℝ ↦ (1 + 0)) ↾ (𝐴(,)𝐵)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)))
137		1p0e1 12364	. . . . . . 7 ⊢ (1 + 0) = 1
138	137	mpteq2i 5248	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1)
139	138	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
140	133, 136, 139	3eqtrd 2769	. . . 4 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
141	122, 125, 140	3eqtrd 2769	. . 3 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
142		fveq2 6891	. . 3 ⊢ (𝑥 = (𝑦 + 𝑇) → (𝐺‘𝑥) = (𝐺‘(𝑦 + 𝑇)))
143		oveq1 7422	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 + 𝑇) = (𝐴 + 𝑇))
144		oveq1 7422	. . 3 ⊢ (𝑦 = 𝐵 → (𝑦 + 𝑇) = (𝐵 + 𝑇))
145	1, 2, 5, 71, 92, 107, 141, 142, 143, 144, 8, 9	itgsubsticc 45426	. 2 ⊢ (𝜑 → ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥 = ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
146	5	ditgpos 25801	. . 3 ⊢ (𝜑 → ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴(,)𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
147	43	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
148	147, 70	ffvelcdmd 7089	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑦 + 𝑇)) ∈ ℂ)
149		1cnd 11237	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 1 ∈ ℂ)
150	148, 149	mulcld 11262	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑦 + 𝑇)) · 1) ∈ ℂ)
151	1, 2, 150	itgioo 25761	. . 3 ⊢ (𝜑 → ∫(𝐴(,)𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
152		fvoveq1 7438	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝐺‘(𝑦 + 𝑇)) = (𝐺‘(𝑥 + 𝑇)))
153	152	oveq1d 7430	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝐺‘(𝑦 + 𝑇)) · 1) = ((𝐺‘(𝑥 + 𝑇)) · 1))
154	153	cbvitgv 25722	. . . 4 ⊢ ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)((𝐺‘(𝑥 + 𝑇)) · 1) d𝑥
155	43	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
156	8	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ∈ ℝ)
157	9	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐵 + 𝑇) ∈ ℝ)
158	50	sselda 3972	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℝ)
159	4	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℝ)
160	158, 159	readdcld 11271	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ∈ ℝ)
161	1	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ)
162	1	rexrd 11292	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
163	162	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ^*)
164	2	rexrd 11292	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
165	164	adantr 479	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ^*)
166		simpr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
167		iccgelb 13410	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑥)
168	163, 165, 166, 167	syl3anc 1368	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑥)
169	161, 158, 159, 168	leadd1dd 11856	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ≤ (𝑥 + 𝑇))
170	2	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
171		iccleub 13409	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ≤ 𝐵)
172	163, 165, 166, 171	syl3anc 1368	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ≤ 𝐵)
173	158, 170, 159, 172	leadd1dd 11856	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ≤ (𝐵 + 𝑇))
174	156, 157, 160, 169, 173	eliccd 44951	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
175	155, 174	ffvelcdmd 7089	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑥 + 𝑇)) ∈ ℂ)
176	175	mulridd 11259	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑥 + 𝑇)) · 1) = (𝐺‘(𝑥 + 𝑇)))
177	42, 73	eqtri 2753	. . . . . . . 8 ⊢ 𝐺 = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇)))
178	177	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐺 = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇))))
179		fvoveq1 7438	. . . . . . . 8 ⊢ (𝑤 = (𝑥 + 𝑇) → (𝐹‘(𝑤 − 𝑇)) = (𝐹‘((𝑥 + 𝑇) − 𝑇)))
180	158	recnd 11270	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℂ)
181	24	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℂ)
182	180, 181	pncand 11600	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝑥 + 𝑇) − 𝑇) = 𝑥)
183	182	fveq2d 6895	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘((𝑥 + 𝑇) − 𝑇)) = (𝐹‘𝑥))
184	179, 183	sylan9eqr 2787	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ 𝑤 = (𝑥 + 𝑇)) → (𝐹‘(𝑤 − 𝑇)) = (𝐹‘𝑥))
185	12	ffvelcdmda 7088	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℂ)
186	178, 184, 174, 185	fvmptd 7006	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑥 + 𝑇)) = (𝐹‘𝑥))
187	176, 186	eqtrd 2765	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑥 + 𝑇)) · 1) = (𝐹‘𝑥))
188	187	itgeq2dv 25727	. . . 4 ⊢ (𝜑 → ∫(𝐴[,]𝐵)((𝐺‘(𝑥 + 𝑇)) · 1) d𝑥 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
189	154, 188	eqtrid 2777	. . 3 ⊢ (𝜑 → ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
190	146, 151, 189	3eqtrd 2769	. 2 ⊢ (𝜑 → ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
191	46, 145, 190	3eqtrd 2769	1 ⊢ (𝜑 → ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∃wrex 3060 {crab 3419 ⊆ wss 3940 {csn 4624 {cpr 4626 class class class wbr 5143 ↦ cmpt 5226 × cxp 5670 dom cdm 5672 ran crn 5673 ↾ cres 5674 ⟶wf 6538 ‘cfv 6542 (class class class)co 7415 ℂcc 11134 ℝcr 11135 0cc0 11136 1c1 11137 + caddc 11139 · cmul 11141 ℝ^*cxr 11275 ≤ cle 11277 − cmin 11472 ℝ⁺crp 13004 (,)cioo 13354 [,]cicc 13357 TopOpenctopn 17400 topGenctg 17416 ℂ_fldccnfld 21281 intcnt 22937 –cn→ccncf 24812 volcvol 25408 𝐿¹cibl 25562 ∫citg 25563 ⨜cdit 25791 D cdv 25808

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 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7737 ax-inf2 9662 ax-cc 10456 ax-cnex 11192 ax-resscn 11193 ax-1cn 11194 ax-icn 11195 ax-addcl 11196 ax-addrcl 11197 ax-mulcl 11198 ax-mulrcl 11199 ax-mulcom 11200 ax-addass 11201 ax-mulass 11202 ax-distr 11203 ax-i2m1 11204 ax-1ne0 11205 ax-1rid 11206 ax-rnegex 11207 ax-rrecex 11208 ax-cnre 11209 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 ax-pre-mulgt0 11213 ax-pre-sup 11214 ax-addf 11215

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 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3960 df-symdif 4237 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-iin 4994 df-disj 5109 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-of 7681 df-ofr 7682 df-om 7868 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8388 df-rdg 8427 df-1o 8483 df-2o 8484 df-oadd 8487 df-omul 8488 df-er 8721 df-map 8843 df-pm 8844 df-ixp 8913 df-en 8961 df-dom 8962 df-sdom 8963 df-fin 8964 df-fsupp 9384 df-fi 9432 df-sup 9463 df-inf 9464 df-oi 9531 df-dju 9922 df-card 9960 df-acn 9963 df-pnf 11278 df-mnf 11279 df-xr 11280 df-ltxr 11281 df-le 11282 df-sub 11474 df-neg 11475 df-div 11900 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12501 df-z 12587 df-dec 12706 df-uz 12851 df-q 12961 df-rp 13005 df-xneg 13122 df-xadd 13123 df-xmul 13124 df-ioo 13358 df-ioc 13359 df-ico 13360 df-icc 13361 df-fz 13515 df-fzo 13658 df-fl 13787 df-mod 13865 df-seq 13997 df-exp 14057 df-hash 14320 df-cj 15076 df-re 15077 df-im 15078 df-sqrt 15212 df-abs 15213 df-limsup 15445 df-clim 15462 df-rlim 15463 df-sum 15663 df-struct 17113 df-sets 17130 df-slot 17148 df-ndx 17160 df-base 17178 df-ress 17207 df-plusg 17243 df-mulr 17244 df-starv 17245 df-sca 17246 df-vsca 17247 df-ip 17248 df-tset 17249 df-ple 17250 df-ds 17252 df-unif 17253 df-hom 17254 df-cco 17255 df-rest 17401 df-topn 17402 df-0g 17420 df-gsum 17421 df-topgen 17422 df-pt 17423 df-prds 17426 df-xrs 17481 df-qtop 17486 df-imas 17487 df-xps 17489 df-mre 17563 df-mrc 17564 df-acs 17566 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-submnd 18738 df-mulg 19026 df-cntz 19270 df-cmn 19739 df-psmet 21273 df-xmet 21274 df-met 21275 df-bl 21276 df-mopn 21277 df-fbas 21278 df-fg 21279 df-cnfld 21282 df-top 22812 df-topon 22829 df-topsp 22851 df-bases 22865 df-cld 22939 df-ntr 22940 df-cls 22941 df-nei 23018 df-lp 23056 df-perf 23057 df-cn 23147 df-cnp 23148 df-haus 23235 df-cmp 23307 df-tx 23482 df-hmeo 23675 df-fil 23766 df-fm 23858 df-flim 23859 df-flf 23860 df-xms 24242 df-ms 24243 df-tms 24244 df-cncf 24814 df-ovol 25409 df-vol 25410 df-mbf 25564 df-itg1 25565 df-itg2 25566 df-ibl 25567 df-itg 25568 df-0p 25615 df-ditg 25792 df-limc 25811 df-dv 25812

This theorem is referenced by: fourierdlem81 45637

W3C validator