Theorem fourierdlem70 47155

Description: A piecewise continuous function is bounded. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

Hypotheses

Ref	Expression
fourierdlem70.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem70.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem70.aleb	⊢ (𝜑 → 𝐴 ≤ 𝐵)
fourierdlem70.f	⊢ (𝜑 → 𝐹:(𝐴[,]𝐵)⟶ℝ)
fourierdlem70.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
fourierdlem70.q	⊢ (𝜑 → 𝑄:(0...𝑀)⟶ℝ)
fourierdlem70.q0	⊢ (𝜑 → (𝑄‘0) = 𝐴)
fourierdlem70.qm	⊢ (𝜑 → (𝑄‘𝑀) = 𝐵)
fourierdlem70.qlt	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑄‘𝑖) < (𝑄‘(𝑖 + 1)))
fourierdlem70.fcn	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ))
fourierdlem70.r	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) limℂ (𝑄‘𝑖)))
fourierdlem70.l	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) limℂ (𝑄‘(𝑖 + 1))))
fourierdlem70.i	⊢ 𝐼 = (𝑖 ∈ (0..^𝑀) ↦ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))

Assertion

Ref	Expression
fourierdlem70	⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑠 ∈ (𝐴[,]𝐵)(abs‘(𝐹‘𝑠)) ≤ 𝑥)

Distinct variable groups:   𝐴,𝑖   𝐵,𝑖   𝑖,𝐹,𝑠   𝑥,𝐹,𝑠   𝑖,𝐼,𝑠   𝑥,𝐼   𝐿,𝑠   𝑖,𝑀,𝑠   𝑄,𝑖,𝑠   𝑥,𝑄   𝑅,𝑠   𝜑,𝑖,𝑠   𝜑,𝑥

Allowed substitution hints:   𝐴(𝑥, 𝑠)   𝐵(𝑥, 𝑠)   𝑅(𝑥, 𝑖)   𝐿(𝑥, 𝑖)   𝑀(𝑥)

Proof of Theorem fourierdlem70

Dummy variables 𝑡 𝑣 𝑦 𝑤 𝑏 𝑧 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prfi 9308	. . 3 ⊢ {ran 𝑄, ∪ ran 𝐼} ∈ Fin
2	1	a1i 11	. 2 ⊢ (𝜑 → {ran 𝑄, ∪ ran 𝐼} ∈ Fin)
3		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼})
4		fourierdlem70.q	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄:(0...𝑀)⟶ℝ)
5		ovex 7451	. . . . . . . . . . 11 ⊢ (0...𝑀) ∈ V
6		fex 7230	. . . . . . . . . . 11 ⊢ ((𝑄:(0...𝑀)⟶ℝ ∧ (0...𝑀) ∈ V) → 𝑄 ∈ V)
7	4, 5, 6	sylancl 598	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄 ∈ V)
8		rnexg 7912	. . . . . . . . . 10 ⊢ (𝑄 ∈ V → ran 𝑄 ∈ V)
9	7, 8	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ran 𝑄 ∈ V)
10		fzofi 14110	. . . . . . . . . . . 12 ⊢ (0..^𝑀) ∈ Fin
11		fourierdlem70.i	. . . . . . . . . . . . 13 ⊢ 𝐼 = (𝑖 ∈ (0..^𝑀) ↦ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
12	11	rnmptfi 46155	. . . . . . . . . . . 12 ⊢ ((0..^𝑀) ∈ Fin → ran 𝐼 ∈ Fin)
13	10, 12	ax-mp 5	. . . . . . . . . . 11 ⊢ ran 𝐼 ∈ Fin
14	13	elexi 3473	. . . . . . . . . 10 ⊢ ran 𝐼 ∈ V
15	14	uniex 7756	. . . . . . . . 9 ⊢ ∪ ran 𝐼 ∈ V
16		uniprg 4883	. . . . . . . . 9 ⊢ ((ran 𝑄 ∈ V ∧ ∪ ran 𝐼 ∈ V) → ∪ {ran 𝑄, ∪ ran 𝐼} = (ran 𝑄 ∪ ∪ ran 𝐼))
17	9, 15, 16	sylancl 598	. . . . . . . 8 ⊢ (𝜑 → ∪ {ran 𝑄, ∪ ran 𝐼} = (ran 𝑄 ∪ ∪ ran 𝐼))
18	17	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → ∪ {ran 𝑄, ∪ ran 𝐼} = (ran 𝑄 ∪ ∪ ran 𝐼))
19	3, 18	eleqtrd 2863	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼))
20		eqid 2761	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑m (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣‘𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣‘𝑖) < (𝑣‘(𝑖 + 1)))}) = (𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑m (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣‘𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣‘𝑖) < (𝑣‘(𝑖 + 1)))})
21		fourierdlem70.m	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℕ)
22		reex 11284	. . . . . . . . . . . . . . 15 ⊢ ℝ ∈ V
23	22, 5	elmap 8892	. . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℝ ↑m (0...𝑀)) ↔ 𝑄:(0...𝑀)⟶ℝ)
24	4, 23	sylibr 237	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑄 ∈ (ℝ ↑m (0...𝑀)))
25		fourierdlem70.q0	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑄‘0) = 𝐴)
26		fourierdlem70.qm	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑄‘𝑀) = 𝐵)
27	25, 26	jca 521	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑄‘0) = 𝐴 ∧ (𝑄‘𝑀) = 𝐵))
28		fourierdlem70.qlt	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑄‘𝑖) < (𝑄‘(𝑖 + 1)))
29	28	ralrimiva 3155	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑖 ∈ (0..^𝑀)(𝑄‘𝑖) < (𝑄‘(𝑖 + 1)))
30	24, 27, 29	jca32 525	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄‘𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄‘𝑖) < (𝑄‘(𝑖 + 1)))))
31	20	fourierdlem2 47088	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℕ → (𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑m (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣‘𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣‘𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀) ↔ (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄‘𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄‘𝑖) < (𝑄‘(𝑖 + 1))))))
32	21, 31	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑m (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣‘𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣‘𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀) ↔ (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄‘𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄‘𝑖) < (𝑄‘(𝑖 + 1))))))
33	30, 32	mpbird 260	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑m (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣‘𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣‘𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀))
34	20, 21, 33	fourierdlem15 47101	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄:(0...𝑀)⟶(𝐴[,]𝐵))
35	34	frnd 6716	. . . . . . . . 9 ⊢ (𝜑 → ran 𝑄 ⊆ (𝐴[,]𝐵))
36	35	sselda 3931	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
37	36	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼)) ∧ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
38		simpll 779	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝜑)
39		elunnel1 4101	. . . . . . . . 9 ⊢ ((𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ ∪ ran 𝐼)
40	39	adantll 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ ∪ ran 𝐼)
41		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → 𝑠 ∈ ∪ ran 𝐼)
42	11	funmpt2 6577	. . . . . . . . . . 11 ⊢ Fun 𝐼
43		elunirn 7253	. . . . . . . . . . 11 ⊢ (Fun 𝐼 → (𝑠 ∈ ∪ ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼‘𝑖)))
44	42, 43	mp1i 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → (𝑠 ∈ ∪ ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼‘𝑖)))
45	41, 44	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼‘𝑖))
46		id 23	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑖 ∈ dom 𝐼 → 𝑖 ∈ dom 𝐼)
47		ovex 7451	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ∈ V
48	47, 11	dmmpti 6681	. . . . . . . . . . . . . . . . . 18 ⊢ dom 𝐼 = (0..^𝑀)
49	46, 48	eleqtrdi 2871	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 ∈ dom 𝐼 → 𝑖 ∈ (0..^𝑀))
50	11	fvmpt2 7003	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ∈ V) → (𝐼‘𝑖) = ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
51	49, 47, 50	sylancl 598	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ dom 𝐼 → (𝐼‘𝑖) = ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
52	51	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → (𝐼‘𝑖) = ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
53		ioossicc 13557	. . . . . . . . . . . . . . . 16 ⊢ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1)))
54		fourierdlem70.a	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐴 ∈ ℝ)
55	54	rexrd 11352	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
56	55	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → 𝐴 ∈ ℝ*)
57		fourierdlem70.2	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐵 ∈ ℝ)
58	57	rexrd 11352	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
59	58	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → 𝐵 ∈ ℝ*)
60	34	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → 𝑄:(0...𝑀)⟶(𝐴[,]𝐵))
61	49	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → 𝑖 ∈ (0..^𝑀))
62	56, 59, 60, 61	fourierdlem8 47094	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ (𝐴[,]𝐵))
63	53, 62	sstrid 3942	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ (𝐴[,]𝐵))
64	52, 63	eqsstrd 3965	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼) → (𝐼‘𝑖) ⊆ (𝐴[,]𝐵))
65	64	3adant3 1150	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼 ∧ 𝑠 ∈ (𝐼‘𝑖)) → (𝐼‘𝑖) ⊆ (𝐴[,]𝐵))
66		simp3 1156	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼 ∧ 𝑠 ∈ (𝐼‘𝑖)) → 𝑠 ∈ (𝐼‘𝑖))
67	65, 66	sseldd 3932	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ dom 𝐼 ∧ 𝑠 ∈ (𝐼‘𝑖)) → 𝑠 ∈ (𝐴[,]𝐵))
68	67	3exp 1137	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑖 ∈ dom 𝐼 → (𝑠 ∈ (𝐼‘𝑖) → 𝑠 ∈ (𝐴[,]𝐵))))
69	68	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → (𝑖 ∈ dom 𝐼 → (𝑠 ∈ (𝐼‘𝑖) → 𝑠 ∈ (𝐴[,]𝐵))))
70	69	rexlimdv 3162	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → (∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼‘𝑖) → 𝑠 ∈ (𝐴[,]𝐵)))
71	45, 70	mpd 16	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ ran 𝐼) → 𝑠 ∈ (𝐴[,]𝐵))
72	38, 40, 71	syl2anc 596	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
73	37, 72	pm2.61dan 825	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (ran 𝑄 ∪ ∪ ran 𝐼)) → 𝑠 ∈ (𝐴[,]𝐵))
74	19, 73	syldan 603	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → 𝑠 ∈ (𝐴[,]𝐵))
75		fourierdlem70.f	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴[,]𝐵)⟶ℝ)
76	75	ffvelcdmda 7082	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑠) ∈ ℝ)
77	74, 76	syldan 603	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → (𝐹‘𝑠) ∈ ℝ)
78	77	recnd 11330	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → (𝐹‘𝑠) ∈ ℂ)
79	78	abscld 15599	. 2 ⊢ ((𝜑 ∧ 𝑠 ∈ ∪ {ran 𝑄, ∪ ran 𝐼}) → (abs‘(𝐹‘𝑠)) ∈ ℝ)
80		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → 𝑤 = ran 𝑄)
81	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → 𝑄:(0...𝑀)⟶ℝ)
82		fzfid 14109	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → (0...𝑀) ∈ Fin)
83		rnffi 46159	. . . . . . 7 ⊢ ((𝑄:(0...𝑀)⟶ℝ ∧ (0...𝑀) ∈ Fin) → ran 𝑄 ∈ Fin)
84	81, 82, 83	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → ran 𝑄 ∈ Fin)
85	80, 84	eqeltrd 2861	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → 𝑤 ∈ Fin)
86	85	adantlr 728	. . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ 𝑤 = ran 𝑄) → 𝑤 ∈ Fin)
87	75	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → 𝐹:(𝐴[,]𝐵)⟶ℝ)
88		simpll 779	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → 𝜑)
89		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝑤 = ran 𝑄 ∧ 𝑠 ∈ 𝑤) → 𝑠 ∈ 𝑤)
90		simpl 488	. . . . . . . . . . . 12 ⊢ ((𝑤 = ran 𝑄 ∧ 𝑠 ∈ 𝑤) → 𝑤 = ran 𝑄)
91	89, 90	eleqtrd 2863	. . . . . . . . . . 11 ⊢ ((𝑤 = ran 𝑄 ∧ 𝑠 ∈ 𝑤) → 𝑠 ∈ ran 𝑄)
92	91	adantll 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → 𝑠 ∈ ran 𝑄)
93	88, 92, 36	syl2anc 596	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → 𝑠 ∈ (𝐴[,]𝐵))
94	87, 93	ffvelcdmd 7083	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → (𝐹‘𝑠) ∈ ℝ)
95	94	recnd 11330	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → (𝐹‘𝑠) ∈ ℂ)
96	95	abscld 15599	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 = ran 𝑄) ∧ 𝑠 ∈ 𝑤) → (abs‘(𝐹‘𝑠)) ∈ ℝ)
97	96	ralrimiva 3155	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 = ran 𝑄) → ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ∈ ℝ)
98	97	adantlr 728	. . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ 𝑤 = ran 𝑄) → ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ∈ ℝ)
99		fimaxre3 12256	. . . 4 ⊢ ((𝑤 ∈ Fin ∧ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ∈ ℝ) → ∃𝑧 ∈ ℝ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ≤ 𝑧)
100	86, 98, 99	syl2anc 596	. . 3 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ 𝑤 = ran 𝑄) → ∃𝑧 ∈ ℝ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ≤ 𝑧)
101		simpll 779	. . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → 𝜑)
102		neqne 2964	. . . . . 6 ⊢ (¬ 𝑤 = ran 𝑄 → 𝑤 ≠ ran 𝑄)
103		elprn1 4612	. . . . . 6 ⊢ ((𝑤 ∈ {ran 𝑄, ∪ ran 𝐼} ∧ 𝑤 ≠ ran 𝑄) → 𝑤 = ∪ ran 𝐼)
104	102, 103	sylan2 605	. . . . 5 ⊢ ((𝑤 ∈ {ran 𝑄, ∪ ran 𝐼} ∧ ¬ 𝑤 = ran 𝑄) → 𝑤 = ∪ ran 𝐼)
105	104	adantll 727	. . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → 𝑤 = ∪ ran 𝐼)
106	10, 12	mp1i 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 = ∪ ran 𝐼) → ran 𝐼 ∈ Fin)
107		ax-resscn 11250	. . . . . . . . . 10 ⊢ ℝ ⊆ ℂ
108	107	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ℝ ⊆ ℂ)
109	75, 108	fssd 6725	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝐴[,]𝐵)⟶ℂ)
110	109	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑤 = ∪ ran 𝐼) ∧ 𝑠 ∈ ∪ ran 𝐼) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
111	71	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑤 = ∪ ran 𝐼) ∧ 𝑠 ∈ ∪ ran 𝐼) → 𝑠 ∈ (𝐴[,]𝐵))
112	110, 111	ffvelcdmd 7083	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 = ∪ ran 𝐼) ∧ 𝑠 ∈ ∪ ran 𝐼) → (𝐹‘𝑠) ∈ ℂ)
113	112	abscld 15599	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 = ∪ ran 𝐼) ∧ 𝑠 ∈ ∪ ran 𝐼) → (abs‘(𝐹‘𝑠)) ∈ ℝ)
114	47, 11	fnmpti 6680	. . . . . . . . 9 ⊢ 𝐼 Fn (0..^𝑀)
115		fvelrnb 6943	. . . . . . . . 9 ⊢ (𝐼 Fn (0..^𝑀) → (𝑡 ∈ ran 𝐼 ↔ ∃𝑖 ∈ (0..^𝑀)(𝐼‘𝑖) = 𝑡))
116	114, 115	ax-mp 5	. . . . . . . 8 ⊢ (𝑡 ∈ ran 𝐼 ↔ ∃𝑖 ∈ (0..^𝑀)(𝐼‘𝑖) = 𝑡)
117	116	bilani 510	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ ran 𝐼) → ∃𝑖 ∈ (0..^𝑀)(𝐼‘𝑖) = 𝑡)
118	4	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑄:(0...𝑀)⟶ℝ)
119		elfzofz 13803	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
120	119	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
121	118, 120	ffvelcdmd 7083	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑄‘𝑖) ∈ ℝ)
122		fzofzp1 13892	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (0..^𝑀) → (𝑖 + 1) ∈ (0...𝑀))
123	122	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑖 + 1) ∈ (0...𝑀))
124	118, 123	ffvelcdmd 7083	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑄‘(𝑖 + 1)) ∈ ℝ)
125		fourierdlem70.fcn	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ))
126		fourierdlem70.l	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) limℂ (𝑄‘(𝑖 + 1))))
127		fourierdlem70.r	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) limℂ (𝑄‘𝑖)))
128	121, 124, 125, 126, 127	cncfioobd 46876	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏)
129		fvres 6902	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) → ((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠) = (𝐹‘𝑠))
130	129	fveq2d 6887	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) → (abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) = (abs‘(𝐹‘𝑠)))
131	130	breq1d 5113	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) → ((abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑠)) ≤ 𝑏))
132	131	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → ((abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑠)) ≤ 𝑏))
133	132	ralbidva 3184	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏))
134	133	rexbidv 3187	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏))
135	128, 134	mpbid 235	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏)
136	135	3adant3 1150	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏)
137	47, 50	mpan2 704	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 ∈ (0..^𝑀) → (𝐼‘𝑖) = ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
138	137	eqcomd 2767	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 ∈ (0..^𝑀) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) = (𝐼‘𝑖))
139	138	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) = (𝐼‘𝑖))
140		simpr 490	. . . . . . . . . . . . . . 15 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → (𝐼‘𝑖) = 𝑡)
141	139, 140	eqtrd 2796	. . . . . . . . . . . . . 14 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) = 𝑡)
142	141	raleqdv 3320	. . . . . . . . . . . . 13 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → (∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏 ↔ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏))
143	142	rexbidv 3187	. . . . . . . . . . . 12 ⊢ ((𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏))
144	143	3adant1 1148	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹‘𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏))
145	136, 144	mpbid 235	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀) ∧ (𝐼‘𝑖) = 𝑡) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏)
146	145	3exp 1137	. . . . . . . . 9 ⊢ (𝜑 → (𝑖 ∈ (0..^𝑀) → ((𝐼‘𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏)))
147	146	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ ran 𝐼) → (𝑖 ∈ (0..^𝑀) → ((𝐼‘𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏)))
148	147	rexlimdv 3162	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ ran 𝐼) → (∃𝑖 ∈ (0..^𝑀)(𝐼‘𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏))
149	117, 148	mpd 16	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ ran 𝐼) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏)
150	149	adantlr 728	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 = ∪ ran 𝐼) ∧ 𝑡 ∈ ran 𝐼) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ 𝑡 (abs‘(𝐹‘𝑠)) ≤ 𝑏)
151		eqimss 3989	. . . . . 6 ⊢ (𝑤 = ∪ ran 𝐼 → 𝑤 ⊆ ∪ ran 𝐼)
152	151	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 = ∪ ran 𝐼) → 𝑤 ⊆ ∪ ran 𝐼)
153	106, 113, 150, 152	ssfiunibd 46294	. . . 4 ⊢ ((𝜑 ∧ 𝑤 = ∪ ran 𝐼) → ∃𝑧 ∈ ℝ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ≤ 𝑧)
154	101, 105, 153	syl2anc 596	. . 3 ⊢ (((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → ∃𝑧 ∈ ℝ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ≤ 𝑧)
155	100, 154	pm2.61dan 825	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ {ran 𝑄, ∪ ran 𝐼}) → ∃𝑧 ∈ ℝ ∀𝑠 ∈ 𝑤 (abs‘(𝐹‘𝑠)) ≤ 𝑧)
156	21	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑀 ∈ ℕ)
157	4	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑄:(0...𝑀)⟶ℝ)
158		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ (𝐴[,]𝐵))
159	25	eqcomd 2767	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐴 = (𝑄‘0))
160	26	eqcomd 2767	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐵 = (𝑄‘𝑀))
161	159, 160	oveq12d 7436	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴[,]𝐵) = ((𝑄‘0)[,](𝑄‘𝑀)))
162	161	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → (𝐴[,]𝐵) = ((𝑄‘0)[,](𝑄‘𝑀)))
163	158, 162	eleqtrd 2863	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ ((𝑄‘0)[,](𝑄‘𝑀)))
164	163	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑡 ∈ ((𝑄‘0)[,](𝑄‘𝑀)))
165		simpr 490	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ¬ 𝑡 ∈ ran 𝑄)
166		fveq2 6883	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑗 → (𝑄‘𝑘) = (𝑄‘𝑗))
167	166	breq1d 5113	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑗 → ((𝑄‘𝑘) < 𝑡 ↔ (𝑄‘𝑗) < 𝑡))
168	167	cbvrabv 3423	. . . . . . . . . . . . 13 ⊢ {𝑘 ∈ (0..^𝑀) ∣ (𝑄‘𝑘) < 𝑡} = {𝑗 ∈ (0..^𝑀) ∣ (𝑄‘𝑗) < 𝑡}
169	168	supeq1i 9432	. . . . . . . . . . . 12 ⊢ sup({𝑘 ∈ (0..^𝑀) ∣ (𝑄‘𝑘) < 𝑡}, ℝ, < ) = sup({𝑗 ∈ (0..^𝑀) ∣ (𝑄‘𝑗) < 𝑡}, ℝ, < )
170	156, 157, 164, 165, 169	fourierdlem25 47111	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
171	137	eleq2d 2847	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ (0..^𝑀) → (𝑡 ∈ (𝐼‘𝑖) ↔ 𝑡 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))))
172	171	rexbiia 3108	. . . . . . . . . . 11 ⊢ (∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼‘𝑖) ↔ ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
173	170, 172	sylibr 237	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼‘𝑖))
174	48	eqcomi 2770	. . . . . . . . . . 11 ⊢ (0..^𝑀) = dom 𝐼
175	174	rexeqi 3319	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼‘𝑖) ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼‘𝑖))
176	173, 175	sylib 221	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼‘𝑖))
177		elunirn 7253	. . . . . . . . . 10 ⊢ (Fun 𝐼 → (𝑡 ∈ ∪ ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼‘𝑖)))
178	42, 177	mp1i 14	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → (𝑡 ∈ ∪ ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼‘𝑖)))
179	176, 178	mpbird 260	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑡 ∈ ∪ ran 𝐼)
180	179	ex 418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → (¬ 𝑡 ∈ ran 𝑄 → 𝑡 ∈ ∪ ran 𝐼))
181	180	orrd 877	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → (𝑡 ∈ ran 𝑄 ∨ 𝑡 ∈ ∪ ran 𝐼))
182		elun 4100	. . . . . 6 ⊢ (𝑡 ∈ (ran 𝑄 ∪ ∪ ran 𝐼) ↔ (𝑡 ∈ ran 𝑄 ∨ 𝑡 ∈ ∪ ran 𝐼))
183	181, 182	sylibr 237	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ (ran 𝑄 ∪ ∪ ran 𝐼))
184	183	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑡 ∈ (𝐴[,]𝐵)𝑡 ∈ (ran 𝑄 ∪ ∪ ran 𝐼))
185		dfss3 3920	. . . 4 ⊢ ((𝐴[,]𝐵) ⊆ (ran 𝑄 ∪ ∪ ran 𝐼) ↔ ∀𝑡 ∈ (𝐴[,]𝐵)𝑡 ∈ (ran 𝑄 ∪ ∪ ran 𝐼))
186	184, 185	sylibr 237	. . 3 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ (ran 𝑄 ∪ ∪ ran 𝐼))
187	186, 17	sseqtrrd 3968	. 2 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ∪ {ran 𝑄, ∪ ran 𝐼})
188	2, 79, 155, 187	ssfiunibd 46294	1 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑠 ∈ (𝐴[,]𝐵)(abs‘(𝐹‘𝑠)) ≤ 𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  {cpr 4586  ∪ cuni 4867   class class class wbr 5103   ↦ cmpt 5186  dom cdm 5651  ran crn 5652   ↾ cres 5653  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ↑_m cmap 8840  Fincfn 8966  supcsup 9425  ℂcc 11191  ℝcr 11192  0cc0 11193  1c1 11194   + caddc 11196  ℝ^*cxr 11335   < clt 11336   ≤ cle 11337  ℕcn 12328  (,)cioo 13469  [,]cicc 13472  ...cfz 13632  ..^cfzo 13781  abscabs 15394  –cn→ccncf 25190   lim_ℂ climc 26175

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-of 7691  df-om 7876  df-1st 7999  df-2nd 8000  df-supp 8171  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-2o 8470  df-er 8710  df-map 8842  df-pm 8843  df-ixp 8919  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-fsupp 9347  df-fi 9396  df-sup 9427  df-inf 9428  df-oi 9497  df-card 10013  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-uz 12959  df-q 13069  df-rp 13114  df-xneg 13234  df-xadd 13235  df-xmul 13236  df-ioo 13473  df-ioc 13474  df-ico 13475  df-icc 13476  df-fz 13633  df-fzo 13782  df-seq 14138  df-exp 14198  df-hash 14468  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-abs 15396  df-struct 17318  df-sets 17335  df-slot 17353  df-ndx 17365  df-base 17381  df-ress 17402  df-plusg 17434  df-mulr 17435  df-starv 17436  df-sca 17437  df-vsca 17438  df-ip 17439  df-tset 17440  df-ple 17441  df-ds 17443  df-unif 17444  df-hom 17445  df-cco 17446  df-rest 17586  df-topn 17587  df-0g 17605  df-gsum 17606  df-topgen 17607  df-pt 17608  df-prds 17611  df-xrs 17667  df-qtop 17672  df-imas 17673  df-xps 17675  df-mre 17749  df-mrc 17750  df-acs 17752  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-submnd 18972  df-mulg 19271  df-cntz 19524  df-cmn 19989  df-psmet 21663  df-xmet 21664  df-met 21665  df-bl 21666  df-mopn 21667  df-cnfld 21672  df-top 23205  df-topon 23222  df-topsp 23244  df-bases 23257  df-cld 23330  df-ntr 23331  df-cls 23332  df-cn 23538  df-cnp 23539  df-cmp 23698  df-tx 23874  df-hmeo 24067  df-xms 24632  df-ms 24633  df-tms 24634  df-cncf 25192  df-limc 26179

This theorem is used by:  fourierdlem103  47188  fourierdlem104  47189