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

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

Proof of Theorem cbvitgvw2
Dummy variables 𝑡 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cbvitgvw2.1 . . . . . . . 8 (𝑥 = 𝑦 → 𝐶 = 𝐷)
21fvoveq1d 7444 . . . . . . 7 (𝑥 = 𝑦 → (ℜ‘(𝐶 / (i↑𝑡))) = (ℜ‘(𝐷 / (i↑𝑡))))
3 id 23 . . . . . . . . . 10 (𝑥 = 𝑦 → 𝑥 = 𝑦)
4 cbvitgvw2.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))
98cbvmptv 5208 . . . . 5 (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)) = (𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))
109fveq2i 6891 . . . 4 (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))) = (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))
1110oveq2i 7433 . . 3 ((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = ((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))))
1211sumeq2si 37085 . 2 Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))))
13 df-itg 25951 . 2 ∫𝐴𝐶 d𝑥 = Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
14 df-itg 25951 . 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   ∈ wcel 2144  ⦋csb 3847  ifcif 4481   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6541  (class class class)co 7422  ℝcr 11204  0cc0 11205  ici 11207   · cmul 11210   ≤ cle 11349   / cdiv 11978  3c3 12403  ...cfz 13644  ↑cexp 14209  ℜcre 15271  Σcsu 15860  ∫2citg2 25944  ∫citg 25946
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 5656  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6306  df-iota 6496  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-frecs 8304  df-wrecs 8335  df-recs 8384  df-rdg 8423  df-seq 14150  df-sum 15861  df-itg 25951
This theorem is used by:  cbvditgvw2  37132
  Copyright terms: Public domain W3C validator