Users' Mathboxes Mathbox for Gino Giotto < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cbvitgdavw2 Structured version   Visualization version   GIF version

Theorem cbvitgdavw2 37210
Description: Change bound variable and domain in an integral. Deduction form. (Contributed by GG, 14-Aug-2025.)
Hypotheses
Ref Expression
cbvitgdavw2.1 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐶 = 𝐷)
cbvitgdavw2.2 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵)
Assertion
Ref Expression
cbvitgdavw2 (𝜑 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐷 d𝑦)
Distinct variable groups:   𝜑,𝑥,𝑦   𝑦,𝐴   𝑥,𝐵   𝑦,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)   𝐶(𝑥)   𝐷(𝑦)

Proof of Theorem cbvitgdavw2
Dummy variables 𝑡 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cbvitgdavw2.1 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐶 = 𝐷)
21fvoveq1d 7446 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑦) → (ℜ‘(𝐶 / (i↑𝑡))) = (ℜ‘(𝐷 / (i↑𝑡))))
3 simpr 490 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦)
4 cbvitgdavw2.2 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵)
53, 4eleq12d 2854 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
65anbi1d 643 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣) ↔ (𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣)))
76ifbid 4505 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑦) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))
82, 7csbeq12dv 3856 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑦) → ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))
98cbvmptdavw 37180 . . . . 5 (𝜑 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)) = (𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))
109fveq2d 6894 . . . 4 (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))) = (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))))
1110oveq2d 7440 . . 3 (𝜑 → ((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = ((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
1211sumeq2sdv 15879 . 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, 143eqtr4g 2820 1 (𝜑 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐷 d𝑦)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ 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:  cbvditgdavw2  37211
  Copyright terms: Public domain W3C validator