MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvitgv Structured version   Visualization version   GIF version

Theorem cbvitgv 26106
Description: Change bound variable in an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
Hypothesis
Ref Expression
cbvitg.1 (𝑥 = 𝑦 → 𝐵 = 𝐶)
Assertion
Ref Expression
cbvitgv ∫𝐴𝐵 d𝑥 = ∫𝐴𝐶 d𝑦
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem cbvitgv
Dummy variables 𝑘 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cbvitg.1 . . . . . . . . . 10 (𝑥 = 𝑦 → 𝐵 = 𝐶)
21fvoveq1d 7446 . . . . . . . . 9 (𝑥 = 𝑦 → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
3 eleq1w 2843 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
43anbi1d 643 . . . . . . . . . 10 (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣) ↔ (𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣)))
54ifbid 4505 . . . . . . . . 9 (𝑥 = 𝑦 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
62, 5csbeq12dv 3856 . . . . . . . 8 (𝑥 = 𝑦 → ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
76cbvmptv 5208 . . . . . . 7 (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)) = (𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
87fveq2i 6893 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))) = (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))
98oveq2i 7435 . . . . 5 ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = ((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
109a1i 11 . . . 4 (⊤ → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = ((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
1110sumeq2sdv 15879 . . 3 (⊤ → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
1211mptru 1576 . 2 Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
13 df-itg 25953 . 2 ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
14 df-itg 25953 . 2 ∫𝐴𝐶 d𝑦 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
1512, 13, 143eqtr4i 2793 1 ∫𝐴𝐵 d𝑥 = ∫𝐴𝐶 d𝑦
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ⊤wtru 1570   ∈ wcel 2144  ⦋csb 3847  ifcif 4481   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6543  (class class class)co 7424  ℝcr 11206  0cc0 11207  ici 11209   · cmul 11212   ≤ cle 11351   / cdiv 11980  3c3 12405  ...cfz 13646  ↑cexp 14211  ℜcre 15273  Σcsu 15862  ∫2citg2 25946  ∫citg 25948
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5657  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-iota 6497  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-seq 14152  df-sum 15863  df-itg 25953
This theorem is used by:  ftc1a  26366  tgoldbachgtd  35341  itgiccshift  47126  itgperiod  47127  dirkeritg  47248  fourierdlem73  47325  fourierdlem82  47334  fourierdlem93  47345  fourierdlem111  47363  fourierdlem112  47364
  Copyright terms: Public domain W3C validator