Theorem cbvitgdavw2 36918

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.

Step	Hyp	Ref	Expression
1		cbvitgdavw2.1	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐶 = 𝐷)
2	1	fvoveq1d 7436	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (ℜ‘(𝐶 / (i↑𝑡))) = (ℜ‘(𝐷 / (i↑𝑡))))
3		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦)
4		cbvitgdavw2.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵)
5	3, 4	eleq12d 2854	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
6	5	anbi1d 643	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣) ↔ (𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣)))
7	6	ifbid 4506	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))
8	2, 7	csbeq12dv 3856	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0) = ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))
9	8	cbvmptdavw 36888	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)) = (𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))
10	9	fveq2d 6883	. . . 4 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))) = (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))))
11	10	oveq2d 7430	. . 3 ⊢ (𝜑 → ((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = ((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
12	11	sumeq2sdv 15791	. 2 ⊢ (𝜑 → Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0)))) = Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0)))))
13		df-itg 25852	. 2 ⊢ ∫𝐴𝐶 d𝑥 = Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑡))) / 𝑣⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑣), 𝑣, 0))))
14		df-itg 25852	. 2 ⊢ ∫𝐵𝐷 d𝑦 = Σ𝑡 ∈ (0...3)((i↑𝑡) · (∫2‘(𝑦 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑡))) / 𝑣⦌if((𝑦 ∈ 𝐵 ∧ 0 ≤ 𝑣), 𝑣, 0))))
15	12, 13, 14	3eqtr4g 2820	1 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐷 d𝑦)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⦋csb 3847  ifcif 4482   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6533  (class class class)co 7414  ℝcr 11124  0cc0 11125  ici 11127   · cmul 11130   ≤ cle 11269   / cdiv 11896  3c3 12321  ...cfz 13562  ↑cexp 14126  ℜcre 15185  Σcsu 15774  ∫₂citg2 25845  ∫citg 25847

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-ext 2732

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-xp 5661  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-iota 6489  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-seq 14067  df-sum 15775  df-itg 25852

This theorem is used by:  cbvditgdavw2  36919