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 36476
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 36473 . . . 4 △ = (𝑓 ∈ (ℂ ↑pm ℂ) ↦ (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))))
2 dmeq 5877 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
32eleq2d 2847 . . . . . 6 (𝑓 = 𝐹 → ((𝑦 + 1) ∈ dom 𝑓 ↔ (𝑦 + 1) ∈ dom 𝐹))
42, 3rabeqbidv 3431 . . . . 5 (𝑓 = 𝐹 → {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} = {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹})
5 fveq1 6862 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 1)) = (𝐹‘(𝑥 + 1)))
6 fveq1 6862 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
75, 6oveq12d 7410 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 1)) − (𝑓𝑥)) = ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)))
84, 7mpteq12dv 5186 . . . 4 (𝑓 = 𝐹 → (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
9 fwddifval.2 . . . . 5 (𝜑𝐹:𝐴⟶ℂ)
10 fwddifval.1 . . . . 5 (𝜑𝐴 ⊆ ℂ)
11 cnex 11151 . . . . . 6 ℂ ∈ V
12 elpm2r 8822 . . . . . 6 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
1311, 11, 12mpanl12 712 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
149, 10, 13syl2anc 593 . . . 4 (𝜑𝐹 ∈ (ℂ ↑pm ℂ))
159fdmd 6698 . . . . . 6 (𝜑 → dom 𝐹 = 𝐴)
1611a1i 11 . . . . . . 7 (𝜑 → ℂ ∈ V)
1716, 10ssexd 5279 . . . . . 6 (𝜑𝐴 ∈ V)
1815, 17eqeltrd 2861 . . . . 5 (𝜑 → dom 𝐹 ∈ V)
19 rabexg 5292 . . . . 5 (dom 𝐹 ∈ V → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V)
20 mptexg 7201 . . . . 5 ({𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
2118, 19, 203syl 18 . . . 4 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
221, 8, 14, 21fvmptd3 6995 . . 3 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2315eleq2d 2847 . . . . 5 (𝜑 → ((𝑦 + 1) ∈ dom 𝐹 ↔ (𝑦 + 1) ∈ 𝐴))
2415, 23rabeqbidv 3431 . . . 4 (𝜑 → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} = {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
2524mpteq1d 5189 . . 3 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2622, 25eqtrd 2796 . 2 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
27 fvoveq1 7415 . . . 4 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 1)) = (𝐹‘(𝑋 + 1)))
28 fveq2 6863 . . . 4 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
2927, 28oveq12d 7410 . . 3 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
3029adantl 485 . 2 ((𝜑𝑥 = 𝑋) → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
31 fwddifval.3 . . 3 (𝜑𝑋𝐴)
32 fwddifval.4 . . 3 (𝜑 → (𝑋 + 1) ∈ 𝐴)
33 oveq1 7399 . . . . 5 (𝑦 = 𝑋 → (𝑦 + 1) = (𝑋 + 1))
3433eleq1d 2846 . . . 4 (𝑦 = 𝑋 → ((𝑦 + 1) ∈ 𝐴 ↔ (𝑋 + 1) ∈ 𝐴))
3534elrab 3650 . . 3 (𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↔ (𝑋𝐴 ∧ (𝑋 + 1) ∈ 𝐴))
3631, 32, 35sylanbrc 592 . 2 (𝜑𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
37 ovexd 7427 . 2 (𝜑 → ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)) ∈ V)
3826, 30, 36, 37fvmptd 6979 1 (𝜑 → (( △ ‘𝐹)‘𝑋) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  {crab 3413  Vcvv 3453  wss 3904  cmpt 5180  dom cdm 5645  wf 6513  cfv 6517  (class class class)co 7392  pm cpm 8804  cc 11068  1c1 11071   + caddc 11073  cmin 11411  cfwddif 36472
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-pm 8806  df-fwddif 36473
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator