Theorem itgeq1f 26125

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 2939	. . . . . 6 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2853	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 643	. . . . . . . . 9 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦) ↔ (𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦)))
6	5	ifbid 4509	. . . . . . . 8 ⊢ (𝐴 = 𝐵 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))
7	6	csbeq2dv 3858	. . . . . . 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 5201	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)) = (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))
10	9	fveq2d 6915	. . . 4 ⊢ (𝐴 = 𝐵 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))) = (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))
11	10	oveq2d 7462	. . 3 ⊢ (𝐴 = 𝐵 → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
12	11	sumeq2sdv 15902	. 2 ⊢ (𝐴 = 𝐵 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))))
13		df-itg 25977	. 2 ⊢ ∫𝐴𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))))
14		df-itg 25977	. 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 1570   ∈ wcel 2147  Ⅎwnfc 2911  ⦋csb 3851  ifcif 4485   class class class wbr 5106   ↦ cmpt 5190  ‘cfv 6561  (class class class)co 7446  ℝcr 11229  0cc0 11230  ici 11232   · cmul 11235   ≤ cle 11374   / cdiv 12003  3c3 12428  ...cfz 13669  ↑cexp 14234  ℜcre 15296  Σcsu 15885  ∫₂citg2 25970  ∫citg 25972

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  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 5172  df-mpt 5191  df-xp 5662  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-iota 6515  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-seq 14175  df-sum 15886  df-itg 25977

This theorem is used by: (None)