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

Theorem fourierdlem14 42426
Description: Given the partition 𝑉, 𝑄 is the partition shifted to the left by 𝑋. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
Hypotheses
Ref Expression
fourierdlem14.1 (𝜑𝐴 ∈ ℝ)
fourierdlem14.2 (𝜑𝐵 ∈ ℝ)
fourierdlem14.x (𝜑𝑋 ∈ ℝ)
fourierdlem14.p 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑚)) ∣ (((𝑝‘0) = (𝐴 + 𝑋) ∧ (𝑝𝑚) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem14.o 𝑂 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑚)) ∣ (((𝑝‘0) = 𝐴 ∧ (𝑝𝑚) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem14.m (𝜑𝑀 ∈ ℕ)
fourierdlem14.v (𝜑𝑉 ∈ (𝑃𝑀))
fourierdlem14.q 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉𝑖) − 𝑋))
Assertion
Ref Expression
fourierdlem14 (𝜑𝑄 ∈ (𝑂𝑀))
Distinct variable groups:   𝐴,𝑚,𝑝   𝐵,𝑚,𝑝   𝑖,𝑀,𝑚,𝑝   𝑄,𝑖,𝑝   𝑖,𝑉,𝑝   𝑖,𝑋,𝑚,𝑝   𝜑,𝑖
Allowed substitution hints:   𝜑(𝑚,𝑝)   𝐴(𝑖)   𝐵(𝑖)   𝑃(𝑖,𝑚,𝑝)   𝑄(𝑚)   𝑂(𝑖,𝑚,𝑝)   𝑉(𝑚)

Proof of Theorem fourierdlem14
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 fourierdlem14.v . . . . . . . . . 10 (𝜑𝑉 ∈ (𝑃𝑀))
2 fourierdlem14.m . . . . . . . . . . 11 (𝜑𝑀 ∈ ℕ)
3 fourierdlem14.p . . . . . . . . . . . 12 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑚)) ∣ (((𝑝‘0) = (𝐴 + 𝑋) ∧ (𝑝𝑚) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝𝑖) < (𝑝‘(𝑖 + 1)))})
43fourierdlem2 42414 . . . . . . . . . . 11 (𝑀 ∈ ℕ → (𝑉 ∈ (𝑃𝑀) ↔ (𝑉 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑉‘0) = (𝐴 + 𝑋) ∧ (𝑉𝑀) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉𝑖) < (𝑉‘(𝑖 + 1))))))
52, 4syl 17 . . . . . . . . . 10 (𝜑 → (𝑉 ∈ (𝑃𝑀) ↔ (𝑉 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑉‘0) = (𝐴 + 𝑋) ∧ (𝑉𝑀) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉𝑖) < (𝑉‘(𝑖 + 1))))))
61, 5mpbid 234 . . . . . . . . 9 (𝜑 → (𝑉 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑉‘0) = (𝐴 + 𝑋) ∧ (𝑉𝑀) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉𝑖) < (𝑉‘(𝑖 + 1)))))
76simpld 497 . . . . . . . 8 (𝜑𝑉 ∈ (ℝ ↑m (0...𝑀)))
8 elmapi 8428 . . . . . . . 8 (𝑉 ∈ (ℝ ↑m (0...𝑀)) → 𝑉:(0...𝑀)⟶ℝ)
97, 8syl 17 . . . . . . 7 (𝜑𝑉:(0...𝑀)⟶ℝ)
109ffvelrnda 6851 . . . . . 6 ((𝜑𝑖 ∈ (0...𝑀)) → (𝑉𝑖) ∈ ℝ)
11 fourierdlem14.x . . . . . . 7 (𝜑𝑋 ∈ ℝ)
1211adantr 483 . . . . . 6 ((𝜑𝑖 ∈ (0...𝑀)) → 𝑋 ∈ ℝ)
1310, 12resubcld 11068 . . . . 5 ((𝜑𝑖 ∈ (0...𝑀)) → ((𝑉𝑖) − 𝑋) ∈ ℝ)
14 fourierdlem14.q . . . . 5 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉𝑖) − 𝑋))
1513, 14fmptd 6878 . . . 4 (𝜑𝑄:(0...𝑀)⟶ℝ)
16 reex 10628 . . . . . 6 ℝ ∈ V
1716a1i 11 . . . . 5 (𝜑 → ℝ ∈ V)
18 ovex 7189 . . . . . 6 (0...𝑀) ∈ V
1918a1i 11 . . . . 5 (𝜑 → (0...𝑀) ∈ V)
2017, 19elmapd 8420 . . . 4 (𝜑 → (𝑄 ∈ (ℝ ↑m (0...𝑀)) ↔ 𝑄:(0...𝑀)⟶ℝ))
2115, 20mpbird 259 . . 3 (𝜑𝑄 ∈ (ℝ ↑m (0...𝑀)))
2214a1i 11 . . . . . 6 (𝜑𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉𝑖) − 𝑋)))
23 fveq2 6670 . . . . . . . 8 (𝑖 = 0 → (𝑉𝑖) = (𝑉‘0))
2423oveq1d 7171 . . . . . . 7 (𝑖 = 0 → ((𝑉𝑖) − 𝑋) = ((𝑉‘0) − 𝑋))
2524adantl 484 . . . . . 6 ((𝜑𝑖 = 0) → ((𝑉𝑖) − 𝑋) = ((𝑉‘0) − 𝑋))
26 0zd 11994 . . . . . . . . 9 (𝜑 → 0 ∈ ℤ)
272nnzd 12087 . . . . . . . . 9 (𝜑𝑀 ∈ ℤ)
2826, 27, 263jca 1124 . . . . . . . 8 (𝜑 → (0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 0 ∈ ℤ))
29 0le0 11739 . . . . . . . . 9 0 ≤ 0
3029a1i 11 . . . . . . . 8 (𝜑 → 0 ≤ 0)
31 0red 10644 . . . . . . . . 9 (𝜑 → 0 ∈ ℝ)
322nnred 11653 . . . . . . . . 9 (𝜑𝑀 ∈ ℝ)
332nngt0d 11687 . . . . . . . . 9 (𝜑 → 0 < 𝑀)
3431, 32, 33ltled 10788 . . . . . . . 8 (𝜑 → 0 ≤ 𝑀)
3528, 30, 34jca32 518 . . . . . . 7 (𝜑 → ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 0 ∈ ℤ) ∧ (0 ≤ 0 ∧ 0 ≤ 𝑀)))
36 elfz2 12900 . . . . . . 7 (0 ∈ (0...𝑀) ↔ ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 0 ∈ ℤ) ∧ (0 ≤ 0 ∧ 0 ≤ 𝑀)))
3735, 36sylibr 236 . . . . . 6 (𝜑 → 0 ∈ (0...𝑀))
389, 37ffvelrnd 6852 . . . . . . 7 (𝜑 → (𝑉‘0) ∈ ℝ)
3938, 11resubcld 11068 . . . . . 6 (𝜑 → ((𝑉‘0) − 𝑋) ∈ ℝ)
4022, 25, 37, 39fvmptd 6775 . . . . 5 (𝜑 → (𝑄‘0) = ((𝑉‘0) − 𝑋))
416simprd 498 . . . . . . . 8 (𝜑 → (((𝑉‘0) = (𝐴 + 𝑋) ∧ (𝑉𝑀) = (𝐵 + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉𝑖) < (𝑉‘(𝑖 + 1))))
4241simpld 497 . . . . . . 7 (𝜑 → ((𝑉‘0) = (𝐴 + 𝑋) ∧ (𝑉𝑀) = (𝐵 + 𝑋)))
4342simpld 497 . . . . . 6 (𝜑 → (𝑉‘0) = (𝐴 + 𝑋))
4443oveq1d 7171 . . . . 5 (𝜑 → ((𝑉‘0) − 𝑋) = ((𝐴 + 𝑋) − 𝑋))
45 fourierdlem14.1 . . . . . . 7 (𝜑𝐴 ∈ ℝ)
4645recnd 10669 . . . . . 6 (𝜑𝐴 ∈ ℂ)
4711recnd 10669 . . . . . 6 (𝜑𝑋 ∈ ℂ)
4846, 47pncand 10998 . . . . 5 (𝜑 → ((𝐴 + 𝑋) − 𝑋) = 𝐴)
4940, 44, 483eqtrd 2860 . . . 4 (𝜑 → (𝑄‘0) = 𝐴)
50 fveq2 6670 . . . . . . . 8 (𝑖 = 𝑀 → (𝑉𝑖) = (𝑉𝑀))
5150oveq1d 7171 . . . . . . 7 (𝑖 = 𝑀 → ((𝑉𝑖) − 𝑋) = ((𝑉𝑀) − 𝑋))
5251adantl 484 . . . . . 6 ((𝜑𝑖 = 𝑀) → ((𝑉𝑖) − 𝑋) = ((𝑉𝑀) − 𝑋))
5326, 27, 273jca 1124 . . . . . . . 8 (𝜑 → (0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ))
5432leidd 11206 . . . . . . . 8 (𝜑𝑀𝑀)
5553, 34, 54jca32 518 . . . . . . 7 (𝜑 → ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (0 ≤ 𝑀𝑀𝑀)))
56 elfz2 12900 . . . . . . 7 (𝑀 ∈ (0...𝑀) ↔ ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (0 ≤ 𝑀𝑀𝑀)))
5755, 56sylibr 236 . . . . . 6 (𝜑𝑀 ∈ (0...𝑀))
589, 57ffvelrnd 6852 . . . . . . 7 (𝜑 → (𝑉𝑀) ∈ ℝ)
5958, 11resubcld 11068 . . . . . 6 (𝜑 → ((𝑉𝑀) − 𝑋) ∈ ℝ)
6022, 52, 57, 59fvmptd 6775 . . . . 5 (𝜑 → (𝑄𝑀) = ((𝑉𝑀) − 𝑋))
6142simprd 498 . . . . . 6 (𝜑 → (𝑉𝑀) = (𝐵 + 𝑋))
6261oveq1d 7171 . . . . 5 (𝜑 → ((𝑉𝑀) − 𝑋) = ((𝐵 + 𝑋) − 𝑋))
63 fourierdlem14.2 . . . . . . 7 (𝜑𝐵 ∈ ℝ)
6463recnd 10669 . . . . . 6 (𝜑𝐵 ∈ ℂ)
6564, 47pncand 10998 . . . . 5 (𝜑 → ((𝐵 + 𝑋) − 𝑋) = 𝐵)
6660, 62, 653eqtrd 2860 . . . 4 (𝜑 → (𝑄𝑀) = 𝐵)
6749, 66jca 514 . . 3 (𝜑 → ((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵))
68 elfzofz 13054 . . . . . . 7 (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
6968, 10sylan2 594 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑉𝑖) ∈ ℝ)
709adantr 483 . . . . . . 7 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑉:(0...𝑀)⟶ℝ)
71 fzofzp1 13135 . . . . . . . 8 (𝑖 ∈ (0..^𝑀) → (𝑖 + 1) ∈ (0...𝑀))
7271adantl 484 . . . . . . 7 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑖 + 1) ∈ (0...𝑀))
7370, 72ffvelrnd 6852 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑉‘(𝑖 + 1)) ∈ ℝ)
7411adantr 483 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑋 ∈ ℝ)
7541simprd 498 . . . . . . 7 (𝜑 → ∀𝑖 ∈ (0..^𝑀)(𝑉𝑖) < (𝑉‘(𝑖 + 1)))
7675r19.21bi 3208 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑉𝑖) < (𝑉‘(𝑖 + 1)))
7769, 73, 74, 76ltsub1dd 11252 . . . . 5 ((𝜑𝑖 ∈ (0..^𝑀)) → ((𝑉𝑖) − 𝑋) < ((𝑉‘(𝑖 + 1)) − 𝑋))
7868adantl 484 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
7968, 13sylan2 594 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → ((𝑉𝑖) − 𝑋) ∈ ℝ)
8014fvmpt2 6779 . . . . . 6 ((𝑖 ∈ (0...𝑀) ∧ ((𝑉𝑖) − 𝑋) ∈ ℝ) → (𝑄𝑖) = ((𝑉𝑖) − 𝑋))
8178, 79, 80syl2anc 586 . . . . 5 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄𝑖) = ((𝑉𝑖) − 𝑋))
82 fveq2 6670 . . . . . . . . . 10 (𝑖 = 𝑗 → (𝑉𝑖) = (𝑉𝑗))
8382oveq1d 7171 . . . . . . . . 9 (𝑖 = 𝑗 → ((𝑉𝑖) − 𝑋) = ((𝑉𝑗) − 𝑋))
8483cbvmptv 5169 . . . . . . . 8 (𝑖 ∈ (0...𝑀) ↦ ((𝑉𝑖) − 𝑋)) = (𝑗 ∈ (0...𝑀) ↦ ((𝑉𝑗) − 𝑋))
8514, 84eqtri 2844 . . . . . . 7 𝑄 = (𝑗 ∈ (0...𝑀) ↦ ((𝑉𝑗) − 𝑋))
8685a1i 11 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → 𝑄 = (𝑗 ∈ (0...𝑀) ↦ ((𝑉𝑗) − 𝑋)))
87 fveq2 6670 . . . . . . . 8 (𝑗 = (𝑖 + 1) → (𝑉𝑗) = (𝑉‘(𝑖 + 1)))
8887oveq1d 7171 . . . . . . 7 (𝑗 = (𝑖 + 1) → ((𝑉𝑗) − 𝑋) = ((𝑉‘(𝑖 + 1)) − 𝑋))
8988adantl 484 . . . . . 6 (((𝜑𝑖 ∈ (0..^𝑀)) ∧ 𝑗 = (𝑖 + 1)) → ((𝑉𝑗) − 𝑋) = ((𝑉‘(𝑖 + 1)) − 𝑋))
9073, 74resubcld 11068 . . . . . 6 ((𝜑𝑖 ∈ (0..^𝑀)) → ((𝑉‘(𝑖 + 1)) − 𝑋) ∈ ℝ)
9186, 89, 72, 90fvmptd 6775 . . . . 5 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄‘(𝑖 + 1)) = ((𝑉‘(𝑖 + 1)) − 𝑋))
9277, 81, 913brtr4d 5098 . . . 4 ((𝜑𝑖 ∈ (0..^𝑀)) → (𝑄𝑖) < (𝑄‘(𝑖 + 1)))
9392ralrimiva 3182 . . 3 (𝜑 → ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1)))
9421, 67, 93jca32 518 . 2 (𝜑 → (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1)))))
95 fourierdlem14.o . . . 4 𝑂 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑m (0...𝑚)) ∣ (((𝑝‘0) = 𝐴 ∧ (𝑝𝑚) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝𝑖) < (𝑝‘(𝑖 + 1)))})
9695fourierdlem2 42414 . . 3 (𝑀 ∈ ℕ → (𝑄 ∈ (𝑂𝑀) ↔ (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1))))))
972, 96syl 17 . 2 (𝜑 → (𝑄 ∈ (𝑂𝑀) ↔ (𝑄 ∈ (ℝ ↑m (0...𝑀)) ∧ (((𝑄‘0) = 𝐴 ∧ (𝑄𝑀) = 𝐵) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑄𝑖) < (𝑄‘(𝑖 + 1))))))
9894, 97mpbird 259 1 (𝜑𝑄 ∈ (𝑂𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3138  {crab 3142  Vcvv 3494   class class class wbr 5066  cmpt 5146  wf 6351  cfv 6355  (class class class)co 7156  m cmap 8406  cr 10536  0cc0 10537  1c1 10538   + caddc 10540   < clt 10675  cle 10676  cmin 10870  cn 11638  cz 11982  ...cfz 12893  ..^cfzo 13034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-nn 11639  df-n0 11899  df-z 11983  df-uz 12245  df-fz 12894  df-fzo 13035
This theorem is referenced by:  fourierdlem74  42485  fourierdlem75  42486  fourierdlem84  42495  fourierdlem85  42496  fourierdlem88  42499  fourierdlem103  42514  fourierdlem104  42515
  Copyright terms: Public domain W3C validator