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

Theorem fourierdlem70 40711
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.
StepHypRef Expression
1 prfi 8276 . . 3 {ran 𝑄, ran 𝐼} ∈ Fin
21a1i 11 . 2 (𝜑 → {ran 𝑄, ran 𝐼} ∈ Fin)
3 simpr 476 . . . . . . 7 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → 𝑠 {ran 𝑄, ran 𝐼})
4 fourierdlem70.q . . . . . . . . . . 11 (𝜑𝑄:(0...𝑀)⟶ℝ)
5 ovex 6718 . . . . . . . . . . 11 (0...𝑀) ∈ V
6 fex 6530 . . . . . . . . . . 11 ((𝑄:(0...𝑀)⟶ℝ ∧ (0...𝑀) ∈ V) → 𝑄 ∈ V)
74, 5, 6sylancl 695 . . . . . . . . . 10 (𝜑𝑄 ∈ V)
8 rnexg 7140 . . . . . . . . . 10 (𝑄 ∈ V → ran 𝑄 ∈ V)
97, 8syl 17 . . . . . . . . 9 (𝜑 → ran 𝑄 ∈ V)
10 fzofi 12813 . . . . . . . . . . . 12 (0..^𝑀) ∈ Fin
11 fourierdlem70.i . . . . . . . . . . . . 13 𝐼 = (𝑖 ∈ (0..^𝑀) ↦ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
1211rnmptfi 39665 . . . . . . . . . . . 12 ((0..^𝑀) ∈ Fin → ran 𝐼 ∈ Fin)
1310, 12ax-mp 5 . . . . . . . . . . 11 ran 𝐼 ∈ Fin
1413elexi 3244 . . . . . . . . . 10 ran 𝐼 ∈ V
1514uniex 6995 . . . . . . . . 9 ran 𝐼 ∈ V
16 uniprg 4482 . . . . . . . . 9 ((ran 𝑄 ∈ V ∧ ran 𝐼 ∈ V) → {ran 𝑄, ran 𝐼} = (ran 𝑄 ran 𝐼))
179, 15, 16sylancl 695 . . . . . . . 8 (𝜑 {ran 𝑄, ran 𝐼} = (ran 𝑄 ran 𝐼))
1817adantr 480 . . . . . . 7 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → {ran 𝑄, ran 𝐼} = (ran 𝑄 ran 𝐼))
193, 18eleqtrd 2732 . . . . . 6 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → 𝑠 ∈ (ran 𝑄 ran 𝐼))
20 eqid 2651 . . . . . . . . . . 11 (𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑𝑚 (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣𝑖) < (𝑣‘(𝑖 + 1)))}) = (𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑𝑚 (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣𝑖) < (𝑣‘(𝑖 + 1)))})
21 fourierdlem70.m . . . . . . . . . . 11 (𝜑𝑀 ∈ ℕ)
22 reex 10065 . . . . . . . . . . . . . . 15 ℝ ∈ V
2322, 5elmap 7928 . . . . . . . . . . . . . 14 (𝑄 ∈ (ℝ ↑𝑚 (0...𝑀)) ↔ 𝑄:(0...𝑀)⟶ℝ)
244, 23sylibr 224 . . . . . . . . . . . . 13 (𝜑𝑄 ∈ (ℝ ↑𝑚 (0...𝑀)))
25 fourierdlem70.q0 . . . . . . . . . . . . . 14 (𝜑 → (𝑄‘0) = 𝐴)
26 fourierdlem70.qm . . . . . . . . . . . . . 14 (𝜑 → (𝑄𝑀) = 𝐵)
2725, 26jca 553 . . . . . . . . . . . . 13 (𝜑 → ((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵))
28 fourierdlem70.qlt . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄𝑖) < (𝑄‘(𝑖 + 1)))
2928ralrimiva 2995 . . . . . . . . . . . . 13 (𝜑 → ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1)))
3024, 27, 29jca32 557 . . . . . . . . . . . 12 (𝜑 → (𝑄 ∈ (ℝ ↑𝑚 (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1)))))
3120fourierdlem2 40644 . . . . . . . . . . . . 13 (𝑀 ∈ ℕ → (𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑𝑚 (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀) ↔ (𝑄 ∈ (ℝ ↑𝑚 (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1))))))
3221, 31syl 17 . . . . . . . . . . . 12 (𝜑 → (𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑𝑚 (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀) ↔ (𝑄 ∈ (ℝ ↑𝑚 (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1))))))
3330, 32mpbird 247 . . . . . . . . . . 11 (𝜑𝑄 ∈ ((𝑦 ∈ ℕ ↦ {𝑣 ∈ (ℝ ↑𝑚 (0...𝑦)) ∣ (((𝑣‘0) = 𝐴 ∧ (𝑣𝑦) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑦)(𝑣𝑖) < (𝑣‘(𝑖 + 1)))})‘𝑀))
3420, 21, 33fourierdlem15 40657 . . . . . . . . . 10 (𝜑𝑄:(0...𝑀)⟶(𝐴[,]𝐵))
35 frn 6091 . . . . . . . . . 10 (𝑄:(0...𝑀)⟶(𝐴[,]𝐵) → ran 𝑄 ⊆ (𝐴[,]𝐵))
3634, 35syl 17 . . . . . . . . 9 (𝜑 → ran 𝑄 ⊆ (𝐴[,]𝐵))
3736sselda 3636 . . . . . . . 8 ((𝜑𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
3837adantlr 751 . . . . . . 7 (((𝜑𝑠 ∈ (ran 𝑄 ran 𝐼)) ∧ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
39 simpll 805 . . . . . . . 8 (((𝜑𝑠 ∈ (ran 𝑄 ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝜑)
40 elunnel1 3787 . . . . . . . . 9 ((𝑠 ∈ (ran 𝑄 ran 𝐼) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ran 𝐼)
4140adantll 750 . . . . . . . 8 (((𝜑𝑠 ∈ (ran 𝑄 ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ran 𝐼)
42 simpr 476 . . . . . . . . . 10 ((𝜑𝑠 ran 𝐼) → 𝑠 ran 𝐼)
4311funmpt2 5965 . . . . . . . . . . 11 Fun 𝐼
44 elunirn 6549 . . . . . . . . . . 11 (Fun 𝐼 → (𝑠 ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼𝑖)))
4543, 44mp1i 13 . . . . . . . . . 10 ((𝜑𝑠 ran 𝐼) → (𝑠 ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼𝑖)))
4642, 45mpbid 222 . . . . . . . . 9 ((𝜑𝑠 ran 𝐼) → ∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼𝑖))
47 id 22 . . . . . . . . . . . . . . . . . 18 (𝑖 ∈ dom 𝐼𝑖 ∈ dom 𝐼)
48 ovex 6718 . . . . . . . . . . . . . . . . . . 19 ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) ∈ V
4948, 11dmmpti 6061 . . . . . . . . . . . . . . . . . 18 dom 𝐼 = (0..^𝑀)
5047, 49syl6eleq 2740 . . . . . . . . . . . . . . . . 17 (𝑖 ∈ dom 𝐼𝑖 ∈ (0..^𝑀))
5111fvmpt2 6330 . . . . . . . . . . . . . . . . 17 ((𝑖 ∈ (0..^𝑀) ∧ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) ∈ V) → (𝐼𝑖) = ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
5250, 48, 51sylancl 695 . . . . . . . . . . . . . . . 16 (𝑖 ∈ dom 𝐼 → (𝐼𝑖) = ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
5352adantl 481 . . . . . . . . . . . . . . 15 ((𝜑𝑖 ∈ dom 𝐼) → (𝐼𝑖) = ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
54 ioossicc 12297 . . . . . . . . . . . . . . . 16 ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ((𝑄𝑖)[,](𝑄‘(𝑖 + 1)))
55 fourierdlem70.a . . . . . . . . . . . . . . . . . . 19 (𝜑𝐴 ∈ ℝ)
5655rexrd 10127 . . . . . . . . . . . . . . . . . 18 (𝜑𝐴 ∈ ℝ*)
5756adantr 480 . . . . . . . . . . . . . . . . 17 ((𝜑𝑖 ∈ dom 𝐼) → 𝐴 ∈ ℝ*)
58 fourierdlem70.2 . . . . . . . . . . . . . . . . . . 19 (𝜑𝐵 ∈ ℝ)
5958rexrd 10127 . . . . . . . . . . . . . . . . . 18 (𝜑𝐵 ∈ ℝ*)
6059adantr 480 . . . . . . . . . . . . . . . . 17 ((𝜑𝑖 ∈ dom 𝐼) → 𝐵 ∈ ℝ*)
6134adantr 480 . . . . . . . . . . . . . . . . 17 ((𝜑𝑖 ∈ dom 𝐼) → 𝑄:(0...𝑀)⟶(𝐴[,]𝐵))
6250adantl 481 . . . . . . . . . . . . . . . . 17 ((𝜑𝑖 ∈ dom 𝐼) → 𝑖 ∈ (0..^𝑀))
6357, 60, 61, 62fourierdlem8 40650 . . . . . . . . . . . . . . . 16 ((𝜑𝑖 ∈ dom 𝐼) → ((𝑄𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ (𝐴[,]𝐵))
6454, 63syl5ss 3647 . . . . . . . . . . . . . . 15 ((𝜑𝑖 ∈ dom 𝐼) → ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ (𝐴[,]𝐵))
6553, 64eqsstrd 3672 . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ dom 𝐼) → (𝐼𝑖) ⊆ (𝐴[,]𝐵))
66653adant3 1101 . . . . . . . . . . . . 13 ((𝜑𝑖 ∈ dom 𝐼𝑠 ∈ (𝐼𝑖)) → (𝐼𝑖) ⊆ (𝐴[,]𝐵))
67 simp3 1083 . . . . . . . . . . . . 13 ((𝜑𝑖 ∈ dom 𝐼𝑠 ∈ (𝐼𝑖)) → 𝑠 ∈ (𝐼𝑖))
6866, 67sseldd 3637 . . . . . . . . . . . 12 ((𝜑𝑖 ∈ dom 𝐼𝑠 ∈ (𝐼𝑖)) → 𝑠 ∈ (𝐴[,]𝐵))
69683exp 1283 . . . . . . . . . . 11 (𝜑 → (𝑖 ∈ dom 𝐼 → (𝑠 ∈ (𝐼𝑖) → 𝑠 ∈ (𝐴[,]𝐵))))
7069adantr 480 . . . . . . . . . 10 ((𝜑𝑠 ran 𝐼) → (𝑖 ∈ dom 𝐼 → (𝑠 ∈ (𝐼𝑖) → 𝑠 ∈ (𝐴[,]𝐵))))
7170rexlimdv 3059 . . . . . . . . 9 ((𝜑𝑠 ran 𝐼) → (∃𝑖 ∈ dom 𝐼 𝑠 ∈ (𝐼𝑖) → 𝑠 ∈ (𝐴[,]𝐵)))
7246, 71mpd 15 . . . . . . . 8 ((𝜑𝑠 ran 𝐼) → 𝑠 ∈ (𝐴[,]𝐵))
7339, 41, 72syl2anc 694 . . . . . . 7 (((𝜑𝑠 ∈ (ran 𝑄 ran 𝐼)) ∧ ¬ 𝑠 ∈ ran 𝑄) → 𝑠 ∈ (𝐴[,]𝐵))
7438, 73pm2.61dan 849 . . . . . 6 ((𝜑𝑠 ∈ (ran 𝑄 ran 𝐼)) → 𝑠 ∈ (𝐴[,]𝐵))
7519, 74syldan 486 . . . . 5 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → 𝑠 ∈ (𝐴[,]𝐵))
76 fourierdlem70.f . . . . . 6 (𝜑𝐹:(𝐴[,]𝐵)⟶ℝ)
7776ffvelrnda 6399 . . . . 5 ((𝜑𝑠 ∈ (𝐴[,]𝐵)) → (𝐹𝑠) ∈ ℝ)
7875, 77syldan 486 . . . 4 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → (𝐹𝑠) ∈ ℝ)
7978recnd 10106 . . 3 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → (𝐹𝑠) ∈ ℂ)
8079abscld 14219 . 2 ((𝜑𝑠 {ran 𝑄, ran 𝐼}) → (abs‘(𝐹𝑠)) ∈ ℝ)
81 simpr 476 . . . . . 6 ((𝜑𝑤 = ran 𝑄) → 𝑤 = ran 𝑄)
824adantr 480 . . . . . . 7 ((𝜑𝑤 = ran 𝑄) → 𝑄:(0...𝑀)⟶ℝ)
83 fzfid 12812 . . . . . . 7 ((𝜑𝑤 = ran 𝑄) → (0...𝑀) ∈ Fin)
84 rnffi 39670 . . . . . . 7 ((𝑄:(0...𝑀)⟶ℝ ∧ (0...𝑀) ∈ Fin) → ran 𝑄 ∈ Fin)
8582, 83, 84syl2anc 694 . . . . . 6 ((𝜑𝑤 = ran 𝑄) → ran 𝑄 ∈ Fin)
8681, 85eqeltrd 2730 . . . . 5 ((𝜑𝑤 = ran 𝑄) → 𝑤 ∈ Fin)
8786adantlr 751 . . . 4 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ 𝑤 = ran 𝑄) → 𝑤 ∈ Fin)
8876ad2antrr 762 . . . . . . . . 9 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → 𝐹:(𝐴[,]𝐵)⟶ℝ)
89 simpll 805 . . . . . . . . . 10 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → 𝜑)
90 simpr 476 . . . . . . . . . . . 12 ((𝑤 = ran 𝑄𝑠𝑤) → 𝑠𝑤)
91 simpl 472 . . . . . . . . . . . 12 ((𝑤 = ran 𝑄𝑠𝑤) → 𝑤 = ran 𝑄)
9290, 91eleqtrd 2732 . . . . . . . . . . 11 ((𝑤 = ran 𝑄𝑠𝑤) → 𝑠 ∈ ran 𝑄)
9392adantll 750 . . . . . . . . . 10 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → 𝑠 ∈ ran 𝑄)
9489, 93, 37syl2anc 694 . . . . . . . . 9 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → 𝑠 ∈ (𝐴[,]𝐵))
9588, 94ffvelrnd 6400 . . . . . . . 8 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → (𝐹𝑠) ∈ ℝ)
9695recnd 10106 . . . . . . 7 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → (𝐹𝑠) ∈ ℂ)
9796abscld 14219 . . . . . 6 (((𝜑𝑤 = ran 𝑄) ∧ 𝑠𝑤) → (abs‘(𝐹𝑠)) ∈ ℝ)
9897ralrimiva 2995 . . . . 5 ((𝜑𝑤 = ran 𝑄) → ∀𝑠𝑤 (abs‘(𝐹𝑠)) ∈ ℝ)
9998adantlr 751 . . . 4 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ 𝑤 = ran 𝑄) → ∀𝑠𝑤 (abs‘(𝐹𝑠)) ∈ ℝ)
100 fimaxre3 11008 . . . 4 ((𝑤 ∈ Fin ∧ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ∈ ℝ) → ∃𝑧 ∈ ℝ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ≤ 𝑧)
10187, 99, 100syl2anc 694 . . 3 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ 𝑤 = ran 𝑄) → ∃𝑧 ∈ ℝ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ≤ 𝑧)
102 simpll 805 . . . 4 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → 𝜑)
103 neqne 2831 . . . . . 6 𝑤 = ran 𝑄𝑤 ≠ ran 𝑄)
104 elprn1 40183 . . . . . 6 ((𝑤 ∈ {ran 𝑄, ran 𝐼} ∧ 𝑤 ≠ ran 𝑄) → 𝑤 = ran 𝐼)
105103, 104sylan2 490 . . . . 5 ((𝑤 ∈ {ran 𝑄, ran 𝐼} ∧ ¬ 𝑤 = ran 𝑄) → 𝑤 = ran 𝐼)
106105adantll 750 . . . 4 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → 𝑤 = ran 𝐼)
10710, 12mp1i 13 . . . . 5 ((𝜑𝑤 = ran 𝐼) → ran 𝐼 ∈ Fin)
108 ax-resscn 10031 . . . . . . . . . 10 ℝ ⊆ ℂ
109108a1i 11 . . . . . . . . 9 (𝜑 → ℝ ⊆ ℂ)
11076, 109fssd 6095 . . . . . . . 8 (𝜑𝐹:(𝐴[,]𝐵)⟶ℂ)
111110ad2antrr 762 . . . . . . 7 (((𝜑𝑤 = ran 𝐼) ∧ 𝑠 ran 𝐼) → 𝐹:(𝐴[,]𝐵)⟶ℂ)
11272adantlr 751 . . . . . . 7 (((𝜑𝑤 = ran 𝐼) ∧ 𝑠 ran 𝐼) → 𝑠 ∈ (𝐴[,]𝐵))
113111, 112ffvelrnd 6400 . . . . . 6 (((𝜑𝑤 = ran 𝐼) ∧ 𝑠 ran 𝐼) → (𝐹𝑠) ∈ ℂ)
114113abscld 14219 . . . . 5 (((𝜑𝑤 = ran 𝐼) ∧ 𝑠 ran 𝐼) → (abs‘(𝐹𝑠)) ∈ ℝ)
11548, 11fnmpti 6060 . . . . . . . . . 10 𝐼 Fn (0..^𝑀)
116 fvelrnb 6282 . . . . . . . . . 10 (𝐼 Fn (0..^𝑀) → (𝑡 ∈ ran 𝐼 ↔ ∃𝑖 ∈ (0..^𝑀)(𝐼𝑖) = 𝑡))
117115, 116ax-mp 5 . . . . . . . . 9 (𝑡 ∈ ran 𝐼 ↔ ∃𝑖 ∈ (0..^𝑀)(𝐼𝑖) = 𝑡)
118117biimpi 206 . . . . . . . 8 (𝑡 ∈ ran 𝐼 → ∃𝑖 ∈ (0..^𝑀)(𝐼𝑖) = 𝑡)
119118adantl 481 . . . . . . 7 ((𝜑𝑡 ∈ ran 𝐼) → ∃𝑖 ∈ (0..^𝑀)(𝐼𝑖) = 𝑡)
1204adantr 480 . . . . . . . . . . . . . . 15 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑄:(0...𝑀)⟶ℝ)
121 elfzofz 12524 . . . . . . . . . . . . . . . 16 (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
122121adantl 481 . . . . . . . . . . . . . . 15 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
123120, 122ffvelrnd 6400 . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄𝑖) ∈ ℝ)
124 fzofzp1 12605 . . . . . . . . . . . . . . . 16 (𝑖 ∈ (0..^𝑀) → (𝑖 + 1) ∈ (0...𝑀))
125124adantl 481 . . . . . . . . . . . . . . 15 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑖 + 1) ∈ (0...𝑀))
126120, 125ffvelrnd 6400 . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄‘(𝑖 + 1)) ∈ ℝ)
127 fourierdlem70.fcn . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))) ∈ (((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))–cn→ℂ))
128 fourierdlem70.l . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))) lim (𝑄‘(𝑖 + 1))))
129 fourierdlem70.r . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))) lim (𝑄𝑖)))
130123, 126, 127, 128, 129cncfioobd 40428 . . . . . . . . . . . . 13 ((𝜑𝑖 ∈ (0..^𝑀)) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏)
131 fvres 6245 . . . . . . . . . . . . . . . . . 18 (𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) → ((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠) = (𝐹𝑠))
132131fveq2d 6233 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) → (abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) = (abs‘(𝐹𝑠)))
133132breq1d 4695 . . . . . . . . . . . . . . . 16 (𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) → ((abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ (abs‘(𝐹𝑠)) ≤ 𝑏))
134133adantl 481 . . . . . . . . . . . . . . 15 (((𝜑𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))) → ((abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ (abs‘(𝐹𝑠)) ≤ 𝑏))
135134ralbidva 3014 . . . . . . . . . . . . . 14 ((𝜑𝑖 ∈ (0..^𝑀)) → (∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏))
136135rexbidv 3081 . . . . . . . . . . . . 13 ((𝜑𝑖 ∈ (0..^𝑀)) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘((𝐹 ↾ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))‘𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏))
137130, 136mpbid 222 . . . . . . . . . . . 12 ((𝜑𝑖 ∈ (0..^𝑀)) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏)
1381373adant3 1101 . . . . . . . . . . 11 ((𝜑𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → ∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏)
13948, 51mpan2 707 . . . . . . . . . . . . . . . . 17 (𝑖 ∈ (0..^𝑀) → (𝐼𝑖) = ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
140139eqcomd 2657 . . . . . . . . . . . . . . . 16 (𝑖 ∈ (0..^𝑀) → ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) = (𝐼𝑖))
141140adantr 480 . . . . . . . . . . . . . . 15 ((𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) = (𝐼𝑖))
142 simpr 476 . . . . . . . . . . . . . . 15 ((𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → (𝐼𝑖) = 𝑡)
143141, 142eqtrd 2685 . . . . . . . . . . . . . 14 ((𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))) = 𝑡)
144143raleqdv 3174 . . . . . . . . . . . . 13 ((𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → (∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏 ↔ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏))
145144rexbidv 3081 . . . . . . . . . . . 12 ((𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏))
1461453adant1 1099 . . . . . . . . . . 11 ((𝜑𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → (∃𝑏 ∈ ℝ ∀𝑠 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))(abs‘(𝐹𝑠)) ≤ 𝑏 ↔ ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏))
147138, 146mpbid 222 . . . . . . . . . 10 ((𝜑𝑖 ∈ (0..^𝑀) ∧ (𝐼𝑖) = 𝑡) → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏)
1481473exp 1283 . . . . . . . . 9 (𝜑 → (𝑖 ∈ (0..^𝑀) → ((𝐼𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏)))
149148adantr 480 . . . . . . . 8 ((𝜑𝑡 ∈ ran 𝐼) → (𝑖 ∈ (0..^𝑀) → ((𝐼𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏)))
150149rexlimdv 3059 . . . . . . 7 ((𝜑𝑡 ∈ ran 𝐼) → (∃𝑖 ∈ (0..^𝑀)(𝐼𝑖) = 𝑡 → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏))
151119, 150mpd 15 . . . . . 6 ((𝜑𝑡 ∈ ran 𝐼) → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏)
152151adantlr 751 . . . . 5 (((𝜑𝑤 = ran 𝐼) ∧ 𝑡 ∈ ran 𝐼) → ∃𝑏 ∈ ℝ ∀𝑠𝑡 (abs‘(𝐹𝑠)) ≤ 𝑏)
153 eqimss 3690 . . . . . 6 (𝑤 = ran 𝐼𝑤 ran 𝐼)
154153adantl 481 . . . . 5 ((𝜑𝑤 = ran 𝐼) → 𝑤 ran 𝐼)
155107, 114, 152, 154ssfiunibd 39837 . . . 4 ((𝜑𝑤 = ran 𝐼) → ∃𝑧 ∈ ℝ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ≤ 𝑧)
156102, 106, 155syl2anc 694 . . 3 (((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) ∧ ¬ 𝑤 = ran 𝑄) → ∃𝑧 ∈ ℝ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ≤ 𝑧)
157101, 156pm2.61dan 849 . 2 ((𝜑𝑤 ∈ {ran 𝑄, ran 𝐼}) → ∃𝑧 ∈ ℝ ∀𝑠𝑤 (abs‘(𝐹𝑠)) ≤ 𝑧)
15821ad2antrr 762 . . . . . . . . . . . 12 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑀 ∈ ℕ)
1594ad2antrr 762 . . . . . . . . . . . 12 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑄:(0...𝑀)⟶ℝ)
160 simpr 476 . . . . . . . . . . . . . 14 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ (𝐴[,]𝐵))
16125eqcomd 2657 . . . . . . . . . . . . . . . 16 (𝜑𝐴 = (𝑄‘0))
16226eqcomd 2657 . . . . . . . . . . . . . . . 16 (𝜑𝐵 = (𝑄𝑀))
163161, 162oveq12d 6708 . . . . . . . . . . . . . . 15 (𝜑 → (𝐴[,]𝐵) = ((𝑄‘0)[,](𝑄𝑀)))
164163adantr 480 . . . . . . . . . . . . . 14 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → (𝐴[,]𝐵) = ((𝑄‘0)[,](𝑄𝑀)))
165160, 164eleqtrd 2732 . . . . . . . . . . . . 13 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ ((𝑄‘0)[,](𝑄𝑀)))
166165adantr 480 . . . . . . . . . . . 12 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑡 ∈ ((𝑄‘0)[,](𝑄𝑀)))
167 simpr 476 . . . . . . . . . . . 12 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ¬ 𝑡 ∈ ran 𝑄)
168 fveq2 6229 . . . . . . . . . . . . . . 15 (𝑘 = 𝑗 → (𝑄𝑘) = (𝑄𝑗))
169168breq1d 4695 . . . . . . . . . . . . . 14 (𝑘 = 𝑗 → ((𝑄𝑘) < 𝑡 ↔ (𝑄𝑗) < 𝑡))
170169cbvrabv 3230 . . . . . . . . . . . . 13 {𝑘 ∈ (0..^𝑀) ∣ (𝑄𝑘) < 𝑡} = {𝑗 ∈ (0..^𝑀) ∣ (𝑄𝑗) < 𝑡}
171170supeq1i 8394 . . . . . . . . . . . 12 sup({𝑘 ∈ (0..^𝑀) ∣ (𝑄𝑘) < 𝑡}, ℝ, < ) = sup({𝑗 ∈ (0..^𝑀) ∣ (𝑄𝑗) < 𝑡}, ℝ, < )
172158, 159, 166, 167, 171fourierdlem25 40667 . . . . . . . . . . 11 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
173139eleq2d 2716 . . . . . . . . . . . 12 (𝑖 ∈ (0..^𝑀) → (𝑡 ∈ (𝐼𝑖) ↔ 𝑡 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1)))))
174173rexbiia 3069 . . . . . . . . . . 11 (∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼𝑖) ↔ ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ ((𝑄𝑖)(,)(𝑄‘(𝑖 + 1))))
175172, 174sylibr 224 . . . . . . . . . 10 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼𝑖))
17649eqcomi 2660 . . . . . . . . . . 11 (0..^𝑀) = dom 𝐼
177176rexeqi 3173 . . . . . . . . . 10 (∃𝑖 ∈ (0..^𝑀)𝑡 ∈ (𝐼𝑖) ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼𝑖))
178175, 177sylib 208 . . . . . . . . 9 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼𝑖))
179 elunirn 6549 . . . . . . . . . 10 (Fun 𝐼 → (𝑡 ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼𝑖)))
18043, 179mp1i 13 . . . . . . . . 9 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → (𝑡 ran 𝐼 ↔ ∃𝑖 ∈ dom 𝐼 𝑡 ∈ (𝐼𝑖)))
181178, 180mpbird 247 . . . . . . . 8 (((𝜑𝑡 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑡 ∈ ran 𝑄) → 𝑡 ran 𝐼)
182181ex 449 . . . . . . 7 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → (¬ 𝑡 ∈ ran 𝑄𝑡 ran 𝐼))
183182orrd 392 . . . . . 6 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → (𝑡 ∈ ran 𝑄𝑡 ran 𝐼))
184 elun 3786 . . . . . 6 (𝑡 ∈ (ran 𝑄 ran 𝐼) ↔ (𝑡 ∈ ran 𝑄𝑡 ran 𝐼))
185183, 184sylibr 224 . . . . 5 ((𝜑𝑡 ∈ (𝐴[,]𝐵)) → 𝑡 ∈ (ran 𝑄 ran 𝐼))
186185ralrimiva 2995 . . . 4 (𝜑 → ∀𝑡 ∈ (𝐴[,]𝐵)𝑡 ∈ (ran 𝑄 ran 𝐼))
187 dfss3 3625 . . . 4 ((𝐴[,]𝐵) ⊆ (ran 𝑄 ran 𝐼) ↔ ∀𝑡 ∈ (𝐴[,]𝐵)𝑡 ∈ (ran 𝑄 ran 𝐼))
188186, 187sylibr 224 . . 3 (𝜑 → (𝐴[,]𝐵) ⊆ (ran 𝑄 ran 𝐼))
189188, 17sseqtr4d 3675 . 2 (𝜑 → (𝐴[,]𝐵) ⊆ {ran 𝑄, ran 𝐼})
1902, 80, 157, 189ssfiunibd 39837 1 (𝜑 → ∃𝑥 ∈ ℝ ∀𝑠 ∈ (𝐴[,]𝐵)(abs‘(𝐹𝑠)) ≤ 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wo 382  wa 383  w3a 1054   = wceq 1523  wcel 2030  wne 2823  wral 2941  wrex 2942  {crab 2945  Vcvv 3231  cun 3605  wss 3607  {cpr 4212   cuni 4468   class class class wbr 4685  cmpt 4762  dom cdm 5143  ran crn 5144  cres 5145  Fun wfun 5920   Fn wfn 5921  wf 5922  cfv 5926  (class class class)co 6690  𝑚 cmap 7899  Fincfn 7997  supcsup 8387  cc 9972  cr 9973  0cc0 9974  1c1 9975   + caddc 9977  *cxr 10111   < clt 10112  cle 10113  cn 11058  (,)cioo 12213  [,]cicc 12216  ...cfz 12364  ..^cfzo 12504  abscabs 14018  cnccncf 22726   lim climc 23671
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-inf2 8576  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052  ax-mulf 10054
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-iin 4555  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-of 6939  df-om 7108  df-1st 7210  df-2nd 7211  df-supp 7341  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-map 7901  df-pm 7902  df-ixp 7951  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-fsupp 8317  df-fi 8358  df-sup 8389  df-inf 8390  df-oi 8456  df-card 8803  df-cda 9028  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-3 11118  df-4 11119  df-5 11120  df-6 11121  df-7 11122  df-8 11123  df-9 11124  df-n0 11331  df-z 11416  df-dec 11532  df-uz 11726  df-q 11827  df-rp 11871  df-xneg 11984  df-xadd 11985  df-xmul 11986  df-ioo 12217  df-ioc 12218  df-ico 12219  df-icc 12220  df-fz 12365  df-fzo 12505  df-seq 12842  df-exp 12901  df-hash 13158  df-cj 13883  df-re 13884  df-im 13885  df-sqrt 14019  df-abs 14020  df-struct 15906  df-ndx 15907  df-slot 15908  df-base 15910  df-sets 15911  df-ress 15912  df-plusg 16001  df-mulr 16002  df-starv 16003  df-sca 16004  df-vsca 16005  df-ip 16006  df-tset 16007  df-ple 16008  df-ds 16011  df-unif 16012  df-hom 16013  df-cco 16014  df-rest 16130  df-topn 16131  df-0g 16149  df-gsum 16150  df-topgen 16151  df-pt 16152  df-prds 16155  df-xrs 16209  df-qtop 16214  df-imas 16215  df-xps 16217  df-mre 16293  df-mrc 16294  df-acs 16296  df-mgm 17289  df-sgrp 17331  df-mnd 17342  df-submnd 17383  df-mulg 17588  df-cntz 17796  df-cmn 18241  df-psmet 19786  df-xmet 19787  df-met 19788  df-bl 19789  df-mopn 19790  df-cnfld 19795  df-top 20747  df-topon 20764  df-topsp 20785  df-bases 20798  df-cld 20871  df-ntr 20872  df-cls 20873  df-cn 21079  df-cnp 21080  df-cmp 21238  df-tx 21413  df-hmeo 21606  df-xms 22172  df-ms 22173  df-tms 22174  df-cncf 22728  df-limc 23675
This theorem is referenced by:  fourierdlem103  40744  fourierdlem104  40745
  Copyright terms: Public domain W3C validator