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 36164
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 36161 . . . 4 △ = (𝑓 ∈ (ℂ ↑pm ℂ) ↦ (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))))
2 dmeq 5913 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
32eleq2d 2826 . . . . . 6 (𝑓 = 𝐹 → ((𝑦 + 1) ∈ dom 𝑓 ↔ (𝑦 + 1) ∈ dom 𝐹))
42, 3rabeqbidv 3454 . . . . 5 (𝑓 = 𝐹 → {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} = {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹})
5 fveq1 6904 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 1)) = (𝐹‘(𝑥 + 1)))
6 fveq1 6904 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
75, 6oveq12d 7450 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 1)) − (𝑓𝑥)) = ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)))
84, 7mpteq12dv 5232 . . . 4 (𝑓 = 𝐹 → (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓𝑥))) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
9 fwddifval.2 . . . . 5 (𝜑𝐹:𝐴⟶ℂ)
10 fwddifval.1 . . . . 5 (𝜑𝐴 ⊆ ℂ)
11 cnex 11237 . . . . . 6 ℂ ∈ V
12 elpm2r 8886 . . . . . 6 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
1311, 11, 12mpanl12 702 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
149, 10, 13syl2anc 584 . . . 4 (𝜑𝐹 ∈ (ℂ ↑pm ℂ))
159fdmd 6745 . . . . . 6 (𝜑 → dom 𝐹 = 𝐴)
1611a1i 11 . . . . . . 7 (𝜑 → ℂ ∈ V)
1716, 10ssexd 5323 . . . . . 6 (𝜑𝐴 ∈ V)
1815, 17eqeltrd 2840 . . . . 5 (𝜑 → dom 𝐹 ∈ V)
19 rabexg 5336 . . . . 5 (dom 𝐹 ∈ V → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V)
20 mptexg 7242 . . . . 5 ({𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
2118, 19, 203syl 18 . . . 4 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) ∈ V)
221, 8, 14, 21fvmptd3 7038 . . 3 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2315eleq2d 2826 . . . . 5 (𝜑 → ((𝑦 + 1) ∈ dom 𝐹 ↔ (𝑦 + 1) ∈ 𝐴))
2415, 23rabeqbidv 3454 . . . 4 (𝜑 → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} = {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
2524mpteq1d 5236 . . 3 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
2622, 25eqtrd 2776 . 2 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹𝑥))))
27 fvoveq1 7455 . . . 4 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 1)) = (𝐹‘(𝑋 + 1)))
28 fveq2 6905 . . . 4 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
2927, 28oveq12d 7450 . . 3 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
3029adantl 481 . 2 ((𝜑𝑥 = 𝑋) → ((𝐹‘(𝑥 + 1)) − (𝐹𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
31 fwddifval.3 . . 3 (𝜑𝑋𝐴)
32 fwddifval.4 . . 3 (𝜑 → (𝑋 + 1) ∈ 𝐴)
33 oveq1 7439 . . . . 5 (𝑦 = 𝑋 → (𝑦 + 1) = (𝑋 + 1))
3433eleq1d 2825 . . . 4 (𝑦 = 𝑋 → ((𝑦 + 1) ∈ 𝐴 ↔ (𝑋 + 1) ∈ 𝐴))
3534elrab 3691 . . 3 (𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↔ (𝑋𝐴 ∧ (𝑋 + 1) ∈ 𝐴))
3631, 32, 35sylanbrc 583 . 2 (𝜑𝑋 ∈ {𝑦𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
37 ovexd 7467 . 2 (𝜑 → ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)) ∈ V)
3826, 30, 36, 37fvmptd 7022 1 (𝜑 → (( △ ‘𝐹)‘𝑋) = ((𝐹‘(𝑋 + 1)) − (𝐹𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  {crab 3435  Vcvv 3479  wss 3950  cmpt 5224  dom cdm 5684  wf 6556  cfv 6560  (class class class)co 7432  pm cpm 8868  cc 11154  1c1 11157   + caddc 11159  cmin 11493  cfwddif 36160
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-pm 8870  df-fwddif 36161
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator