Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fwddifval Structured version   Visualization version   GIF version

Theorem fwddifval 33736
Description: Calculate the value of the forward difference operator at a point. (Contributed by Scott Fenton, 18-May-2020.)
Hypotheses
Ref Expression
fwddifval.1 (𝜑𝐴 ⊆ ℂ)
fwddifval.2 (𝜑𝐹:𝐴⟶ℂ)
fwddifval.3 (𝜑𝑋𝐴)
fwddifval.4 (𝜑 → (𝑋 + 1) ∈ 𝐴)
Assertion
Ref Expression
fwddifval (𝜑 → (( △ ‘𝐹)‘𝑋) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))

Proof of Theorem fwddifval
Dummy variables 𝑥 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-fwddif 33733 . . . 4 △ = (𝑓 ∈ (ℂ ↑pm ℂ) ↦ (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))))
2 dmeq 5736 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
32eleq2d 2875 . . . . . 6 (𝑓 = 𝐹 → ((𝑦 + 1) ∈ dom 𝑓 ↔ (𝑦 + 1) ∈ dom 𝐹))
42, 3rabeqbidv 3433 . . . . 5 (𝑓 = 𝐹 → {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} = {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹})
5 fveq1 6644 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 1)) = (𝐹‘(𝑥 + 1)))
6 fveq1 6644 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
75, 6oveq12d 7153 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 1)) − (𝑓𝑥)) = ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)))
84, 7mpteq12dv 5115 . . . 4 (𝑓 = 𝐹 → (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
9 fwddifval.2 . . . . 5 (𝜑𝐹:𝐴⟶ℂ)
10 fwddifval.1 . . . . 5 (𝜑𝐴 ⊆ ℂ)
11 cnex 10607 . . . . . 6 ℂ ∈ V
12 elpm2r 8407 . . . . . 6 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
1311, 11, 12mpanl12 701 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
149, 10, 13syl2anc 587 . . . 4 (𝜑𝐹 ∈ (ℂ ↑pm ℂ))
159fdmd 6497 . . . . . 6 (𝜑 → dom 𝐹 = 𝐴)
1611a1i 11 . . . . . . 7 (𝜑 → ℂ ∈ V)
1716, 10ssexd 5192 . . . . . 6 (𝜑𝐴 ∈ V)
1815, 17eqeltrd 2890 . . . . 5 (𝜑 → dom 𝐹 ∈ V)
19 rabexg 5198 . . . . 5 (dom 𝐹 ∈ V → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V)
20 mptexg 6961 . . . . 5 ({𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
2118, 19, 203syl 18 . . . 4 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
221, 8, 14, 21fvmptd3 6768 . . 3 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2315eleq2d 2875 . . . . 5 (𝜑 → ((𝑦 + 1) ∈ dom 𝐹 ↔ (𝑦 + 1) ∈ 𝐴))
2415, 23rabeqbidv 3433 . . . 4 (𝜑 → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} = {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
2524mpteq1d 5119 . . 3 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2622, 25eqtrd 2833 . 2 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
27 fvoveq1 7158 . . . 4 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 1)) = (𝐹‘(𝑋 + 1)))
28 fveq2 6645 . . . 4 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
2927, 28oveq12d 7153 . . 3 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
3029adantl 485 . 2 ((𝜑𝑥 = 𝑋) → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
31 fwddifval.3 . . 3 (𝜑𝑋𝐴)
32 fwddifval.4 . . 3 (𝜑 → (𝑋 + 1) ∈ 𝐴)
33 oveq1 7142 . . . . 5 (𝑦 = 𝑋 → (𝑦 + 1) = (𝑋 + 1))
3433eleq1d 2874 . . . 4 (𝑦 = 𝑋 → ((𝑦 + 1) ∈ 𝐴 ↔ (𝑋 + 1) ∈ 𝐴))
3534elrab 3628 . . 3 (𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↔ (𝑋𝐴 ∧ (𝑋 + 1) ∈ 𝐴))
3631, 32, 35sylanbrc 586 . 2 (𝜑𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
37 ovexd 7170 . 2 (𝜑 → ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)) ∈ V)
3826, 30, 36, 37fvmptd 6752 1 (𝜑 → (( △ ‘𝐹)‘𝑋) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  {crab 3110  Vcvv 3441  wss 3881  cmpt 5110  dom cdm 5519  wf 6320  cfv 6324  (class class class)co 7135  pm cpm 8390  cc 10524  1c1 10527   + caddc 10529  cmin 10859  cfwddif 33732
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-pm 8392  df-fwddif 33733
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator