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 46722

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 13066	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ ℝ)
5		itgiccshift.aleb	. . . . 5 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
6	1, 2, 4, 5	leadd1dd 11834	. . . 4 ⊢ (𝜑 → (𝐴 + 𝑇) ≤ (𝐵 + 𝑇))
7	6	ditgpos 26026	. . 3 ⊢ (𝜑 → ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥 = ∫((𝐴 + 𝑇)(,)(𝐵 + 𝑇))(𝐺‘𝑥) d𝑥)
8	1, 4	readdcld 11244	. . . 4 ⊢ (𝜑 → (𝐴 + 𝑇) ∈ ℝ)
9	2, 4	readdcld 11244	. . . 4 ⊢ (𝜑 → (𝐵 + 𝑇) ∈ ℝ)
10		itgiccshift.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ))
11		cncff 25063	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝐴[,]𝐵)–cn→ℂ) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
12	10, 11	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝐴[,]𝐵)⟶ℂ)
13	12	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
14	1	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 ∈ ℝ)
15	2	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐵 ∈ ℝ)
16	8	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐴 + 𝑇) ∈ ℝ)
17	9	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐵 + 𝑇) ∈ ℝ)
18		simpr 489	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
19		eliccre 46249	. . . . . . . . . 10 ⊢ (((𝐴 + 𝑇) ∈ ℝ ∧ (𝐵 + 𝑇) ∈ ℝ ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ℝ)
20	16, 17, 18, 19	syl3anc 1397	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ∈ ℝ)
21	4	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑇 ∈ ℝ)
22	20, 21	resubcld 11648	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ∈ ℝ)
23	1	recnd 11243	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℂ)
24	4	recnd 11243	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 ∈ ℂ)
25	23, 24	pncand 11576	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴 + 𝑇) − 𝑇) = 𝐴)
26	25	eqcomd 2768	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 = ((𝐴 + 𝑇) − 𝑇))
27	26	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 = ((𝐴 + 𝑇) − 𝑇))
28		elicc2 13444	. . . . . . . . . . . . 13 ⊢ (((𝐴 + 𝑇) ∈ ℝ ∧ (𝐵 + 𝑇) ∈ ℝ) → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇))))
29	16, 17, 28	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↔ (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇))))
30	18, 29	mpbid 235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 ∈ ℝ ∧ (𝐴 + 𝑇) ≤ 𝑥 ∧ 𝑥 ≤ (𝐵 + 𝑇)))
31	30	simp2d 1160	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐴 + 𝑇) ≤ 𝑥)
32	16, 20, 21, 31	lesub1dd 11836	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → ((𝐴 + 𝑇) − 𝑇) ≤ (𝑥 − 𝑇))
33	27, 32	eqbrtrd 5132	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝐴 ≤ (𝑥 − 𝑇))
34	30	simp3d 1161	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → 𝑥 ≤ (𝐵 + 𝑇))
35	20, 17, 21, 34	lesub1dd 11836	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ≤ ((𝐵 + 𝑇) − 𝑇))
36	2	recnd 11243	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℂ)
37	36, 24	pncand 11576	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐵 + 𝑇) − 𝑇) = 𝐵)
38	37	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → ((𝐵 + 𝑇) − 𝑇) = 𝐵)
39	35, 38	breqtrd 5136	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ≤ 𝐵)
40	14, 15, 22, 33, 39	eliccd 46248	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝑥 − 𝑇) ∈ (𝐴[,]𝐵))
41	13, 40	ffvelcdmd 7080	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐹‘(𝑥 − 𝑇)) ∈ ℂ)
42		itgiccshift.g	. . . . . 6 ⊢ 𝐺 = (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇)))
43	41, 42	fmptd 7109	. . . . 5 ⊢ (𝜑 → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
44	43	ffvelcdmda 7079	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇))) → (𝐺‘𝑥) ∈ ℂ)
45	8, 9, 44	itgioo 25986	. . 3 ⊢ (𝜑 → ∫((𝐴 + 𝑇)(,)(𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥)
46	7, 45	eqtr2d 2798	. 2 ⊢ (𝜑 → ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥)
47		eqid 2762	. . . 4 ⊢ (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) = (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇))
48	47	addccncf 25087	. . . . 5 ⊢ (𝑇 ∈ ℂ → (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) ∈ (ℂ–cn→ℂ))
49	24, 48	syl 18	. . . 4 ⊢ (𝜑 → (𝑦 ∈ ℂ ↦ (𝑦 + 𝑇)) ∈ (ℂ–cn→ℂ))
50	1, 2	iccssred 13467	. . . . 5 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
51		ax-resscn 11163	. . . . 5 ⊢ ℝ ⊆ ℂ
52	50, 51	sstrdi 3948	. . . 4 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℂ)
53	8, 9	iccssred 13467	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ⊆ ℝ)
54	53, 51	sstrdi 3948	. . . 4 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ⊆ ℂ)
55	8	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ∈ ℝ)
56	9	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐵 + 𝑇) ∈ ℝ)
57	50	sselda 3936	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ ℝ)
58	4	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℝ)
59	57, 58	readdcld 11244	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ∈ ℝ)
60	1	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ)
61		simpr 489	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
62	2	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
63		elicc2 13444	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
64	60, 62, 63	syl2anc 595	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
65	61, 64	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵))
66	65	simp2d 1160	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑦)
67	60, 57, 58, 66	leadd1dd 11834	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ≤ (𝑦 + 𝑇))
68	65	simp3d 1161	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝑦 ≤ 𝐵)
69	57, 62, 58, 68	leadd1dd 11834	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ≤ (𝐵 + 𝑇))
70	55, 56, 59, 67, 69	eliccd 46248	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 + 𝑇) ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
71	47, 49, 52, 54, 70	cncfmptssg 46613	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)) ∈ ((𝐴[,]𝐵)–cn→((𝐴 + 𝑇)[,](𝐵 + 𝑇))))
72		fvoveq1 7435	. . . . . . . 8 ⊢ (𝑥 = 𝑤 → (𝐹‘(𝑥 − 𝑇)) = (𝐹‘(𝑤 − 𝑇)))
73	72	cbvmptv 5214	. . . . . . 7 ⊢ (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇))) = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇)))
74	1, 2, 4	iccshift 46262	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) = {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)})
75	74	mpteq1d 5200	. . . . . . 7 ⊢ (𝜑 → (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
76	73, 75	eqtrid 2809	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑥 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
77	42, 76	eqtrid 2809	. . . . 5 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))))
78		eqeq1 2766	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → (𝑤 = (𝑧 + 𝑇) ↔ 𝑥 = (𝑧 + 𝑇)))
79	78	rexbidv 3188	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇) ↔ ∃𝑧 ∈ (𝐴[,]𝐵)𝑥 = (𝑧 + 𝑇)))
80		oveq1 7419	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑦 → (𝑧 + 𝑇) = (𝑦 + 𝑇))
81	80	eqeq2d 2773	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑥 = (𝑧 + 𝑇) ↔ 𝑥 = (𝑦 + 𝑇)))
82	81	cbvrexvw 3243	. . . . . . . . 9 ⊢ (∃𝑧 ∈ (𝐴[,]𝐵)𝑥 = (𝑧 + 𝑇) ↔ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇))
83	79, 82	bitrdi 290	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇) ↔ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)))
84	83	cbvrabv 3425	. . . . . . 7 ⊢ {𝑤 ∈ ℂ ∣ ∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇)} = {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}
85	84	eqcomi 2771	. . . . . 6 ⊢ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} = {𝑤 ∈ ℂ ∣ ∃𝑧 ∈ (𝐴[,]𝐵)𝑤 = (𝑧 + 𝑇)}
86		eqid 2762	. . . . . 6 ⊢ (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))) = (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇)))
87	52, 24, 85, 10, 86	cncfshift 46616	. . . . 5 ⊢ (𝜑 → (𝑤 ∈ {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} ↦ (𝐹‘(𝑤 − 𝑇))) ∈ ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ))
88	77, 87	eqeltrd 2862	. . . 4 ⊢ (𝜑 → 𝐺 ∈ ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ))
89	43	feqmptd 6949	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐺‘𝑥)))
90	74	eqcomd 2768	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)} = ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
91	90	oveq1d 7427	. . . 4 ⊢ (𝜑 → ({𝑥 ∈ ℂ ∣ ∃𝑦 ∈ (𝐴[,]𝐵)𝑥 = (𝑦 + 𝑇)}–cn→ℂ) = (((𝐴 + 𝑇)[,](𝐵 + 𝑇))–cn→ℂ))
92	88, 89, 91	3eltr3d 2876	. . 3 ⊢ (𝜑 → (𝑥 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐺‘𝑥)) ∈ (((𝐴 + 𝑇)[,](𝐵 + 𝑇))–cn→ℂ))
93		ioosscn 13441	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
94	93	a1i 11	. . . . 5 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
95		1cnd 11208	. . . . 5 ⊢ (𝜑 → 1 ∈ ℂ)
96		ssid 3958	. . . . . 6 ⊢ ℂ ⊆ ℂ
97	96	a1i 11	. . . . 5 ⊢ (𝜑 → ℂ ⊆ ℂ)
98	94, 95, 97	constcncfg 46614	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ ((𝐴(,)𝐵)–cn→ℂ))
99		fconstmpt 5722	. . . . 5 ⊢ ((𝐴(,)𝐵) × {1}) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1)
100		ioombl 25735	. . . . . . 7 ⊢ (𝐴(,)𝐵) ∈ dom vol
101	100	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ dom vol)
102		ioovolcl 25740	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (vol‘(𝐴(,)𝐵)) ∈ ℝ)
103	1, 2, 102	syl2anc 595	. . . . . 6 ⊢ (𝜑 → (vol‘(𝐴(,)𝐵)) ∈ ℝ)
104		iblconst 25988	. . . . . 6 ⊢ (((𝐴(,)𝐵) ∈ dom vol ∧ (vol‘(𝐴(,)𝐵)) ∈ ℝ ∧ 1 ∈ ℂ) → ((𝐴(,)𝐵) × {1}) ∈ 𝐿¹)
105	101, 103, 95, 104	syl3anc 1397	. . . . 5 ⊢ (𝜑 → ((𝐴(,)𝐵) × {1}) ∈ 𝐿¹)
106	99, 105	eqeltrrid 2867	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ 𝐿¹)
107	98, 106	elind 4152	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ 1) ∈ (((𝐴(,)𝐵)–cn→ℂ) ∩ 𝐿¹))
108	50	resmptd 6041	. . . . . . 7 ⊢ (𝜑 → ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵)) = (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)))
109	108	eqcomd 2768	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇)) = ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵)))
110	109	oveq2d 7428	. . . . 5 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))))
111	51	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ⊆ ℂ)
112	111	sselda 3936	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
113	24	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝑇 ∈ ℂ)
114	112, 113	addcld 11234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 + 𝑇) ∈ ℂ)
115	114	fmpttd 7110	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)):ℝ⟶ℂ)
116		ssid 3958	. . . . . . 7 ⊢ ℝ ⊆ ℝ
117	116	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ⊆ ℝ)
118		eqid 2762	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
119		tgioo4 24973	. . . . . . 7 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
120	118, 119	dvres 26081	. . . . . 6 ⊢ (((ℝ ⊆ ℂ ∧ (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)):ℝ⟶ℂ) ∧ (ℝ ⊆ ℝ ∧ (𝐴[,]𝐵) ⊆ ℝ)) → (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
121	111, 115, 117, 50, 120	syl22anc 851	. . . . 5 ⊢ (𝜑 → (ℝ D ((𝑦 ∈ ℝ ↦ (𝑦 + 𝑇)) ↾ (𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
122	110, 121	eqtrd 2797	. . . 4 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))))
123		iccntr 24990	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
124	1, 2, 123	syl2anc 595	. . . . 5 ⊢ (𝜑 → ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵)) = (𝐴(,)𝐵))
125	124	reseq2d 5977	. . . 4 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ ((int‘(topGen‘ran (,)))‘(𝐴[,]𝐵))) = ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)))
126		reelprrecn 11198	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
127	126	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
128		1cnd 11208	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 1 ∈ ℂ)
129	127	dvmptid 26127	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ 𝑦)) = (𝑦 ∈ ℝ ↦ 1))
130		0cnd 11205	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 0 ∈ ℂ)
131	127, 24	dvmptc 26128	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ 𝑇)) = (𝑦 ∈ ℝ ↦ 0))
132	127, 112, 128, 129, 113, 130, 131	dvmptadd 26130	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) = (𝑦 ∈ ℝ ↦ (1 + 0)))
133	132	reseq1d 5976	. . . . 5 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)) = ((𝑦 ∈ ℝ ↦ (1 + 0)) ↾ (𝐴(,)𝐵)))
134		ioossre 13440	. . . . . . 7 ⊢ (𝐴(,)𝐵) ⊆ ℝ
135	134	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
136	135	resmptd 6041	. . . . 5 ⊢ (𝜑 → ((𝑦 ∈ ℝ ↦ (1 + 0)) ↾ (𝐴(,)𝐵)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)))
137		1p0e1 12369	. . . . . . 7 ⊢ (1 + 0) = 1
138	137	mpteq2i 5206	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1)
139	138	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ (1 + 0)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
140	133, 136, 139	3eqtrd 2801	. . . 4 ⊢ (𝜑 → ((ℝ D (𝑦 ∈ ℝ ↦ (𝑦 + 𝑇))) ↾ (𝐴(,)𝐵)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
141	122, 125, 140	3eqtrd 2801	. . 3 ⊢ (𝜑 → (ℝ D (𝑦 ∈ (𝐴[,]𝐵) ↦ (𝑦 + 𝑇))) = (𝑦 ∈ (𝐴(,)𝐵) ↦ 1))
142		fveq2 6881	. . 3 ⊢ (𝑥 = (𝑦 + 𝑇) → (𝐺‘𝑥) = (𝐺‘(𝑦 + 𝑇)))
143		oveq1 7419	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 + 𝑇) = (𝐴 + 𝑇))
144		oveq1 7419	. . 3 ⊢ (𝑦 = 𝐵 → (𝑦 + 𝑇) = (𝐵 + 𝑇))
145	1, 2, 5, 71, 92, 107, 141, 142, 143, 144, 8, 9	itgsubsticc 46718	. 2 ⊢ (𝜑 → ⨜[(𝐴 + 𝑇) → (𝐵 + 𝑇)](𝐺‘𝑥) d𝑥 = ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
146	5	ditgpos 26026	. . 3 ⊢ (𝜑 → ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴(,)𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
147	43	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
148	147, 70	ffvelcdmd 7080	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑦 + 𝑇)) ∈ ℂ)
149		1cnd 11208	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 1 ∈ ℂ)
150	148, 149	mulcld 11235	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑦 + 𝑇)) · 1) ∈ ℂ)
151	1, 2, 150	itgioo 25986	. . 3 ⊢ (𝜑 → ∫(𝐴(,)𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦)
152		fvoveq1 7435	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝐺‘(𝑦 + 𝑇)) = (𝐺‘(𝑥 + 𝑇)))
153	152	oveq1d 7427	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝐺‘(𝑦 + 𝑇)) · 1) = ((𝐺‘(𝑥 + 𝑇)) · 1))
154	153	cbvitgv 25947	. . . 4 ⊢ ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)((𝐺‘(𝑥 + 𝑇)) · 1) d𝑥
155	43	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐺:((𝐴 + 𝑇)[,](𝐵 + 𝑇))⟶ℂ)
156	8	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ∈ ℝ)
157	9	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐵 + 𝑇) ∈ ℝ)
158	50	sselda 3936	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℝ)
159	4	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℝ)
160	158, 159	readdcld 11244	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ∈ ℝ)
161	1	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ)
162	1	rexrd 11265	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
163	162	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ^*)
164	2	rexrd 11265	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
165	164	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ^*)
166		simpr 489	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
167		iccgelb 13435	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑥)
168	163, 165, 166, 167	syl3anc 1397	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑥)
169	161, 158, 159, 168	leadd1dd 11834	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐴 + 𝑇) ≤ (𝑥 + 𝑇))
170	2	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
171		iccleub 13434	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ≤ 𝐵)
172	163, 165, 166, 171	syl3anc 1397	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ≤ 𝐵)
173	158, 170, 159, 172	leadd1dd 11834	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ≤ (𝐵 + 𝑇))
174	156, 157, 160, 169, 173	eliccd 46248	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 + 𝑇) ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)))
175	155, 174	ffvelcdmd 7080	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑥 + 𝑇)) ∈ ℂ)
176	175	mulridd 11232	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑥 + 𝑇)) · 1) = (𝐺‘(𝑥 + 𝑇)))
177	42, 73	eqtri 2785	. . . . . . . 8 ⊢ 𝐺 = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇)))
178	177	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐺 = (𝑤 ∈ ((𝐴 + 𝑇)[,](𝐵 + 𝑇)) ↦ (𝐹‘(𝑤 − 𝑇))))
179		fvoveq1 7435	. . . . . . . 8 ⊢ (𝑤 = (𝑥 + 𝑇) → (𝐹‘(𝑤 − 𝑇)) = (𝐹‘((𝑥 + 𝑇) − 𝑇)))
180	158	recnd 11243	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℂ)
181	24	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑇 ∈ ℂ)
182	180, 181	pncand 11576	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝑥 + 𝑇) − 𝑇) = 𝑥)
183	182	fveq2d 6885	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘((𝑥 + 𝑇) − 𝑇)) = (𝐹‘𝑥))
184	179, 183	sylan9eqr 2819	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ 𝑤 = (𝑥 + 𝑇)) → (𝐹‘(𝑤 − 𝑇)) = (𝐹‘𝑥))
185	12	ffvelcdmda 7079	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℂ)
186	178, 184, 174, 185	fvmptd 6997	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐺‘(𝑥 + 𝑇)) = (𝐹‘𝑥))
187	176, 186	eqtrd 2797	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((𝐺‘(𝑥 + 𝑇)) · 1) = (𝐹‘𝑥))
188	187	itgeq2dv 25952	. . . 4 ⊢ (𝜑 → ∫(𝐴[,]𝐵)((𝐺‘(𝑥 + 𝑇)) · 1) d𝑥 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
189	154, 188	eqtrid 2809	. . 3 ⊢ (𝜑 → ∫(𝐴[,]𝐵)((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
190	146, 151, 189	3eqtrd 2801	. 2 ⊢ (𝜑 → ⨜[𝐴 → 𝐵]((𝐺‘(𝑦 + 𝑇)) · 1) d𝑦 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)
191	46, 145, 190	3eqtrd 2801	1 ⊢ (𝜑 → ∫((𝐴 + 𝑇)[,](𝐵 + 𝑇))(𝐺‘𝑥) d𝑥 = ∫(𝐴[,]𝐵)(𝐹‘𝑥) d𝑥)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ∃wrex 3088 {crab 3415 ⊆ wss 3904 {csn 4588 {cpr 4590 class class class wbr 5108 ↦ cmpt 5191 × cxp 5658 dom cdm 5660 ran crn 5661 ↾ cres 5662 ⟶wf 6532 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 ℝ^*cxr 11248 ≤ cle 11250 − cmin 11447 ℝ⁺crp 13022 (,)cioo 13378 [,]cicc 13381 TopOpenctopn 17480 topGenctg 17496 ℂ_fldccnfld 21533 intcnt 23185 –cn→ccncf 25046 volcvol 25633 𝐿¹cibl 25787 ∫citg 25788 ⨜cdit 26016 D cdv 26033

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-inf2 9608 ax-cc 10425 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-symdif 4205 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-disj 5076 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-ofr 7677 df-om 7861 df-1st 7984 df-2nd 7985 df-supp 8155 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-oadd 8455 df-omul 8456 df-er 8692 df-map 8824 df-pm 8825 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9320 df-fi 9369 df-sup 9400 df-inf 9401 df-oi 9470 df-dju 9894 df-card 9932 df-acn 9935 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-z 12598 df-dec 12718 df-uz 12869 df-q 12979 df-rp 13023 df-xneg 13143 df-xadd 13144 df-xmul 13145 df-ioo 13382 df-ioc 13383 df-ico 13384 df-icc 13385 df-fz 13542 df-fzo 13690 df-fl 13832 df-mod 13910 df-seq 14045 df-exp 14105 df-hash 14374 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-limsup 15529 df-clim 15546 df-rlim 15547 df-sum 15745 df-struct 17213 df-sets 17230 df-slot 17248 df-ndx 17260 df-base 17276 df-ress 17297 df-plusg 17329 df-mulr 17330 df-starv 17331 df-sca 17332 df-vsca 17333 df-ip 17334 df-tset 17335 df-ple 17336 df-ds 17338 df-unif 17339 df-hom 17340 df-cco 17341 df-rest 17481 df-topn 17482 df-0g 17500 df-gsum 17501 df-topgen 17502 df-pt 17503 df-prds 17506 df-xrs 17562 df-qtop 17567 df-imas 17568 df-xps 17570 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18704 df-sgrp 18783 df-mnd 18799 df-submnd 18848 df-mulg 19140 df-cntz 19393 df-cmn 19858 df-psmet 21525 df-xmet 21526 df-met 21527 df-bl 21528 df-mopn 21529 df-fbas 21530 df-fg 21531 df-cnfld 21534 df-top 23062 df-topon 23079 df-topsp 23101 df-bases 23114 df-cld 23187 df-ntr 23188 df-cls 23189 df-nei 23266 df-lp 23304 df-perf 23305 df-cn 23395 df-cnp 23396 df-haus 23483 df-cmp 23555 df-tx 23730 df-hmeo 23923 df-fil 24014 df-fm 24106 df-flim 24107 df-flf 24108 df-xms 24488 df-ms 24489 df-tms 24490 df-cncf 25048 df-ovol 25634 df-vol 25635 df-mbf 25789 df-itg1 25790 df-itg2 25791 df-ibl 25792 df-itg 25793 df-0p 25840 df-ditg 26017 df-limc 26036 df-dv 26037

This theorem is used by: fourierdlem81 46929

W3C validator