Theorem itgeq1f 26072

Description: Equality theorem for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.) Avoid axioms. (Revised by GG, 1-Sep-2025.)

Hypotheses

Ref	Expression
itgeq1f.1	⊢ Ⅎ𝑥𝐴
itgeq1f.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
itgeq1f	⊢ (𝐴 = 𝐵 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐶 d𝑥)

Proof of Theorem itgeq1f

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

Step	Hyp	Ref	Expression
1		itgeq1f.1	. . . . . . 7 ⊢ Ⅎ𝑥𝐴
2		itgeq1f.2	. . . . . . 7 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2936	. . . . . 6 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2850	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 643	. . . . . . . . 9 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦) ↔ (𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦)))
6	5	ifbid 4506	. . . . . . . 8 ⊢ (𝐴 = 𝐵 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
7	6	csbeq2dv 3854	. . . . . . 7 ⊢ (𝐴 = 𝐵 → ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
8	7	adantr 486	. . . . . 6 ⊢ ((𝐴 = 𝐵 ∧ 𝑥 ∈ ℝ) → ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
9	3, 8	mpteq2da 5197	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)) = (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))
10	9	fveq2d 6881	. . . 4 ⊢ (𝐴 = 𝐵 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))) = (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))
11	10	oveq2d 7428	. . 3 ⊢ (𝐴 = 𝐵 → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
12	11	sumeq2sdv 15850	. 2 ⊢ (𝐴 = 𝐵 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
13		df-itg 25924	. 2 ⊢ ∫𝐴𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))))
14		df-itg 25924	. 2 ⊢ ∫𝐵𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))
15	12, 13, 14	3eqtr4g 2821	1 ⊢ (𝐴 = 𝐵 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐶 d𝑥)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908  ⦋csb 3847  ifcif 4482   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412  ℝcr 11180  0cc0 11181  ici 11183   · cmul 11186   ≤ cle 11325   / cdiv 11954  3c3 12379  ...cfz 13620  ↑cexp 14184  ℜcre 15244  Σcsu 15833  ∫₂citg2 25917  ∫citg 25919

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733

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-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5657  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-iota 6487  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-seq 14125  df-sum 15834  df-itg 25924

This theorem is used by: (None)