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

Theorem cbvitgv 26152
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 7473 . . . . . . . . 9 (𝑥 = 𝑦 → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐶 / (i↑𝑘))))
3 eleq1w 2847 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
43anbi1d 643 . . . . . . . . . 10 (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣) ↔ (𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣)))
54ifbid 4509 . . . . . . . . 9 (𝑥 = 𝑦 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
62, 5csbeq12dv 3860 . . . . . . . 8 (𝑥 = 𝑦 → ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
76cbvmptv 5215 . . . . . . 7 (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)) = (𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))
87fveq2i 6919 . . . . . 6 (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))) = (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))
98oveq2i 7462 . . . . 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 15914 . . 3 (⊤ → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
1211mptru 1577 . 2 Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
13 df-itg 25999 . 2 ∫𝐴𝐵 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐵 / (i↑𝑘))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
14 df-itg 25999 . 2 ∫𝐴𝐶 d𝑦 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑣⦌if((𝑦 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
1512, 13, 143eqtr4i 2796 1 ∫𝐴𝐵 d𝑥 = ∫𝐴𝐶 d𝑦
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ⊤wtru 1571   ∈ wcel 2147  ⦋csb 3851  ifcif 4485   class class class wbr 5108   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  0cc0 11239  ici 11241   · cmul 11244   ≤ cle 11383   / cdiv 12013  3c3 12438  ...cfz 13679  ↑cexp 14244  ℜcre 15307  Σcsu 15897  ∫2citg2 25992  ∫citg 25994
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-xp 5664  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-iota 6520  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seq 14185  df-sum 15898  df-itg 25999
This theorem is used by:  ftc1a  26412  tgoldbachgtd  35402  itgiccshift  47263  itgperiod  47264  dirkeritg  47385  fourierdlem73  47462  fourierdlem82  47471  fourierdlem93  47482  fourierdlem111  47500  fourierdlem112  47501
  Copyright terms: Public domain W3C validator