| 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 7425 | . . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (i↑𝑘) = (i↑𝐾)) | |
| 2 | itgvallem.1 | . . . . . . . . 9 ⊢ (i↑𝐾) = 𝑇 | |
| 3 | 1, 2 | eqtrdi 2813 | . . . . . . . 8 ⊢ (𝑘 = 𝐾 → (i↑𝑘) = 𝑇) |
| 4 | 3 | oveq2d 7433 | . . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝐵 / (i↑𝑘)) = (𝐵 / 𝑇)) |
| 5 | 4 | fveq2d 6886 | . . . . . 6 ⊢ (𝑘 = 𝐾 → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / 𝑇))) |
| 6 | 5 | breq2d 5119 | . . . . 5 ⊢ (𝑘 = 𝐾 → (0 ≤ (ℜ‘(𝐵 / (i↑𝑘))) ↔ 0 ≤ (ℜ‘(𝐵 / 𝑇)))) |
| 7 | 6 | anbi2d 642 | . . . 4 ⊢ (𝑘 = 𝐾 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))))) |
| 8 | 7, 5 | ifbieq1d 4510 | . . 3 ⊢ (𝑘 = 𝐾 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)) |
| 9 | 8 | mpteq2dv 5203 | . 2 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0))) |
| 10 | 9 | fveq2d 6886 | 1 ⊢ (𝑘 = 𝐾 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ifcif 4485 class class class wbr 5107 ↦ cmpt 5190 ‘cfv 6537 (class class class)co 7417 ℝcr 11127 0cc0 11128 ici 11130 ≤ cle 11272 / cdiv 11899 ↑cexp 14129 ℜcre 15188 ∫2citg2 25850 |
| 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-ext 2734 |
| 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-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-iota 6493 df-fv 6545 df-ov 7420 |
| This theorem is used by: iblcnlem1 26022 itgcnlem 26024 |
| Copyright terms: Public domain | W3C validator |