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 36897
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 36894 . . . 4 △ = (𝑓 ∈ (ℂ ↑pm ℂ) ↦ (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓‘𝑥))))
2 dmeq 5885 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
32eleq2d 2847 . . . . . 6 (𝑓 = 𝐹 → ((𝑦 + 1) ∈ dom 𝑓 ↔ (𝑦 + 1) ∈ dom 𝐹))
42, 3rabeqbidv 3430 . . . . 5 (𝑓 = 𝐹 → {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} = {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹})
5 fveq1 6876 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘(𝑥 + 1)) = (𝐹‘(𝑥 + 1)))
6 fveq1 6876 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
75, 6oveq12d 7430 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 1)) − (𝑓‘𝑥)) = ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥)))
84, 7mpteq12dv 5192 . . . 4 (𝑓 = 𝐹 → (𝑥 ∈ {𝑦 ∈ dom 𝑓 ∣ (𝑦 + 1) ∈ dom 𝑓} ↦ ((𝑓‘(𝑥 + 1)) − (𝑓‘𝑥))) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))))
9 fwddifval.2 . . . . 5 (𝜑 → 𝐹:𝐴⟶ℂ)
10 fwddifval.1 . . . . 5 (𝜑 → 𝐴 ⊆ ℂ)
11 cnex 11262 . . . . . 6 ℂ ∈ V
12 elpm2r 8849 . . . . . 6 (((ℂ ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ)) → 𝐹 ∈ (ℂ ↑pm ℂ))
1311, 11, 12mpanl12 715 . . . . 5 ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℂ) → 𝐹 ∈ (ℂ ↑pm ℂ))
149, 10, 13syl2anc 596 . . . 4 (𝜑 → 𝐹 ∈ (ℂ ↑pm ℂ))
159fdmd 6712 . . . . . 6 (𝜑 → dom 𝐹 = 𝐴)
1611a1i 11 . . . . . . 7 (𝜑 → ℂ ∈ V)
1716, 10ssexd 5286 . . . . . 6 (𝜑 → 𝐴 ∈ V)
1815, 17eqeltrd 2861 . . . . 5 (𝜑 → dom 𝐹 ∈ V)
19 rabexg 5299 . . . . 5 (dom 𝐹 ∈ V → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V)
20 mptexg 7219 . . . . 5 ({𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ∈ V → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))) ∈ V)
2118, 19, 203syl 19 . . . 4 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))) ∈ V)
221, 8, 14, 21fvmptd3 7009 . . 3 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))))
2315eleq2d 2847 . . . . 5 (𝜑 → ((𝑦 + 1) ∈ dom 𝐹 ↔ (𝑦 + 1) ∈ 𝐴))
2415, 23rabeqbidv 3430 . . . 4 (𝜑 → {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} = {𝑦 ∈ 𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
2524mpteq1d 5195 . . 3 (𝜑 → (𝑥 ∈ {𝑦 ∈ dom 𝐹 ∣ (𝑦 + 1) ∈ dom 𝐹} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))) = (𝑥 ∈ {𝑦 ∈ 𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))))
2622, 25eqtrd 2796 . 2 (𝜑 → ( △ ‘𝐹) = (𝑥 ∈ {𝑦 ∈ 𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↦ ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥))))
27 fvoveq1 7435 . . . 4 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 1)) = (𝐹‘(𝑋 + 1)))
28 fveq2 6877 . . . 4 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
2927, 28oveq12d 7430 . . 3 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹‘𝑋)))
3029adantl 487 . 2 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝐹‘(𝑥 + 1)) − (𝐹‘𝑥)) = ((𝐹‘(𝑋 + 1)) − (𝐹‘𝑋)))
31 fwddifval.3 . . 3 (𝜑 → 𝑋 ∈ 𝐴)
32 fwddifval.4 . . 3 (𝜑 → (𝑋 + 1) ∈ 𝐴)
33 oveq1 7419 . . . . 5 (𝑦 = 𝑋 → (𝑦 + 1) = (𝑋 + 1))
3433eleq1d 2846 . . . 4 (𝑦 = 𝑋 → ((𝑦 + 1) ∈ 𝐴 ↔ (𝑋 + 1) ∈ 𝐴))
3534elrab 3645 . . 3 (𝑋 ∈ {𝑦 ∈ 𝐴 ∣ (𝑦 + 1) ∈ 𝐴} ↔ (𝑋 ∈ 𝐴 ∧ (𝑋 + 1) ∈ 𝐴))
3631, 32, 35sylanbrc 595 . 2 (𝜑 → 𝑋 ∈ {𝑦 ∈ 𝐴 ∣ (𝑦 + 1) ∈ 𝐴})
37 ovexd 7447 . 2 (𝜑 → ((𝐹‘(𝑋 + 1)) − (𝐹‘𝑋)) ∈ V)
3826, 30, 36, 37fvmptd 6993 1 (𝜑 → (( △ ‘𝐹)‘𝑋) = ((𝐹‘(𝑋 + 1)) − (𝐹‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ⊆ wss 3899   ↦ cmpt 5186  dom cdm 5651  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ↑pm cpm 8832  ℂcc 11179  1c1 11182   + caddc 11184   − cmin 11522   △ cfwddif 36893
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-pm 8834  df-fwddif 36894
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator