Theorem itgeq12sdv 37138

Description: Equality theorem for an integral. Deduction form. General version of itgeq1d 47109 and itgeq2sdv 37139. (Contributed by GG, 1-Sep-2025.)

Hypotheses

Ref	Expression
itgeq12sdv.1	⊢ (𝜑 → 𝐴 = 𝐵)
itgeq12sdv.2	⊢ (𝜑 → 𝐶 = 𝐷)

Assertion

Ref	Expression
itgeq12sdv	⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐷 d𝑥)

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)

Proof of Theorem itgeq12sdv

Dummy variables 𝑘 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		itgeq12sdv.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 = 𝐷)
2	1	oveq1d 7445	. . . . . . . 8 ⊢ (𝜑 → (𝐶 / (i↑𝑘)) = (𝐷 / (i↑𝑘)))
3	2	fveq2d 6900	. . . . . . 7 ⊢ (𝜑 → (ℜ‘(𝐶 / (i↑𝑘))) = (ℜ‘(𝐷 / (i↑𝑘))))
4		itgeq12sdv.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 = 𝐵)
5	4	eleq2d 2850	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
6	5	anbi1d 643	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦) ↔ (𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦)))
7	6	ifbid 4509	. . . . . . 7 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
8	3, 7	csbeq12dv 3860	. . . . . 6 ⊢ (𝜑 → ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
9	8	mpteq2dv 5202	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)) = (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))
10	9	fveq2d 6900	. . . 4 ⊢ (𝜑 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))) = (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))
11	10	oveq2d 7446	. . 3 ⊢ (𝜑 → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
12	11	sumeq2sdv 15885	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
13		df-itg 25959	. 2 ⊢ ∫𝐴𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))))
14		df-itg 25959	. 2 ⊢ ∫𝐵𝐷 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐷 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))
15	12, 13, 14	3eqtr4g 2823	1 ⊢ (𝜑 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐷 d𝑥)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ⦋csb 3851  ifcif 4485   class class class wbr 5106   ↦ cmpt 5189  ‘cfv 6547  (class class class)co 7430  ℝcr 11212  0cc0 11213  ici 11215   · cmul 11218   ≤ cle 11357   / cdiv 11986  3c3 12411  ...cfz 13652  ↑cexp 14217  ℜcre 15279  Σcsu 15868  ∫₂citg2 25952  ∫citg 25954

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

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 2101  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-xp 5661  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-iota 6501  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-seq 14158  df-sum 15869  df-itg 25959

This theorem is used by:  itgeq2sdv  37139  ditgeq123dv  37140