Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > itgvallem | Structured version Visualization version GIF version |
Description: Substitution lemma. (Contributed by Mario Carneiro, 7-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.) |
Ref | Expression |
---|---|
itgvallem.1 | ⊢ (i↑𝐾) = 𝑇 |
Ref | Expression |
---|---|
itgvallem | ⊢ (𝑘 = 𝐾 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7153 | . . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (i↑𝑘) = (i↑𝐾)) | |
2 | itgvallem.1 | . . . . . . . . 9 ⊢ (i↑𝐾) = 𝑇 | |
3 | 1, 2 | syl6eq 2869 | . . . . . . . 8 ⊢ (𝑘 = 𝐾 → (i↑𝑘) = 𝑇) |
4 | 3 | oveq2d 7161 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝐵 / (i↑𝑘)) = (𝐵 / 𝑇)) |
5 | 4 | fveq2d 6667 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / 𝑇))) |
6 | 5 | breq2d 5069 | . . . . 5 ⊢ (𝑘 = 𝐾 → (0 ≤ (ℜ‘(𝐵 / (i↑𝑘))) ↔ 0 ≤ (ℜ‘(𝐵 / 𝑇)))) |
7 | 6 | anbi2d 628 | . . . 4 ⊢ (𝑘 = 𝐾 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))))) |
8 | 7, 5 | ifbieq1d 4486 | . . 3 ⊢ (𝑘 = 𝐾 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)) |
9 | 8 | mpteq2dv 5153 | . 2 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0))) |
10 | 9 | fveq2d 6667 | 1 ⊢ (𝑘 = 𝐾 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ifcif 4463 class class class wbr 5057 ↦ cmpt 5137 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 0cc0 10525 ici 10527 ≤ cle 10664 / cdiv 11285 ↑cexp 13417 ℜcre 14444 ∫2citg2 24144 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-iota 6307 df-fv 6356 df-ov 7148 |
This theorem is referenced by: iblcnlem1 24315 itgcnlem 24317 |
Copyright terms: Public domain | W3C validator |