| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itgeq1f | Structured version Visualization version GIF version | ||
| Description: Equality theorem for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.) Avoid axioms. (Revised by GG, 1-Sep-2025.) |
| Ref | Expression |
|---|---|
| itgeq1f.1 | ⊢ Ⅎ𝑥𝐴 |
| itgeq1f.2 | ⊢ Ⅎ𝑥𝐵 |
| Ref | Expression |
|---|---|
| itgeq1f | ⊢ (𝐴 = 𝐵 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐶 d𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itgeq1f.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
| 2 | itgeq1f.2 | . . . . . . 7 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | nfeq 2912 | . . . . . 6 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
| 4 | eleq2 2825 | . . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 5 | 4 | anbi1d 632 | . . . . . . . . 9 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦) ↔ (𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦))) |
| 6 | 5 | ifbid 4490 | . . . . . . . 8 ⊢ (𝐴 = 𝐵 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)) |
| 7 | 6 | csbeq2dv 3844 | . . . . . . 7 ⊢ (𝐴 = 𝐵 → ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)) |
| 8 | 7 | adantr 480 | . . . . . 6 ⊢ ((𝐴 = 𝐵 ∧ 𝑥 ∈ ℝ) → ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0) = ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)) |
| 9 | 3, 8 | mpteq2da 5177 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)) = (𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))) |
| 10 | 9 | fveq2d 6844 | . . . 4 ⊢ (𝐴 = 𝐵 → (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0))) = (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))) |
| 11 | 10 | oveq2d 7383 | . . 3 ⊢ (𝐴 = 𝐵 → ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = ((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))) |
| 12 | 11 | sumeq2sdv 15665 | . 2 ⊢ (𝐴 = 𝐵 → Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0))))) |
| 13 | df-itg 25590 | . 2 ⊢ ∫𝐴𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝑦), 𝑦, 0)))) | |
| 14 | df-itg 25590 | . 2 ⊢ ∫𝐵𝐶 d𝑥 = Σ𝑘 ∈ (0...3)((i↑𝑘) · (∫2‘(𝑥 ∈ ℝ ↦ ⦋(ℜ‘(𝐶 / (i↑𝑘))) / 𝑦⦌if((𝑥 ∈ 𝐵 ∧ 0 ≤ 𝑦), 𝑦, 0)))) | |
| 15 | 12, 13, 14 | 3eqtr4g 2796 | 1 ⊢ (𝐴 = 𝐵 → ∫𝐴𝐶 d𝑥 = ∫𝐵𝐶 d𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Ⅎwnfc 2883 ⦋csb 3837 ifcif 4466 class class class wbr 5085 ↦ cmpt 5166 ‘cfv 6498 (class class class)co 7367 ℝcr 11037 0cc0 11038 ici 11040 · cmul 11043 ≤ cle 11180 / cdiv 11807 3c3 12237 ...cfz 13461 ↑cexp 14023 ℜcre 15059 Σcsu 15648 ∫2citg2 25583 ∫citg 25585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-xp 5637 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-iota 6454 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-seq 13964 df-sum 15649 df-itg 25590 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |