MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  itgvallem Structured version   Visualization version   GIF version

Theorem itgvallem 25742
Description: Substitution lemma. (Contributed by Mario Carneiro, 7-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
Hypothesis
Ref Expression
itgvallem.1 (i↑𝐾) = 𝑇
Assertion
Ref Expression
itgvallem (𝑘 = 𝐾 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0))))
Distinct variable groups:   𝑥,𝑘   𝑥,𝐾
Allowed substitution hints:   𝐴(𝑥,𝑘)   𝐵(𝑥,𝑘)   𝑇(𝑥,𝑘)   𝐾(𝑘)

Proof of Theorem itgvallem
StepHypRef Expression
1 oveq2 7366 . . . . . . . . 9 (𝑘 = 𝐾 → (i↑𝑘) = (i↑𝐾))
2 itgvallem.1 . . . . . . . . 9 (i↑𝐾) = 𝑇
31, 2eqtrdi 2787 . . . . . . . 8 (𝑘 = 𝐾 → (i↑𝑘) = 𝑇)
43oveq2d 7374 . . . . . . 7 (𝑘 = 𝐾 → (𝐵 / (i↑𝑘)) = (𝐵 / 𝑇))
54fveq2d 6838 . . . . . 6 (𝑘 = 𝐾 → (ℜ‘(𝐵 / (i↑𝑘))) = (ℜ‘(𝐵 / 𝑇)))
65breq2d 5110 . . . . 5 (𝑘 = 𝐾 → (0 ≤ (ℜ‘(𝐵 / (i↑𝑘))) ↔ 0 ≤ (ℜ‘(𝐵 / 𝑇))))
76anbi2d 630 . . . 4 (𝑘 = 𝐾 → ((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))) ↔ (𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇)))))
87, 5ifbieq1d 4504 . . 3 (𝑘 = 𝐾 → if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0) = if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0))
98mpteq2dv 5192 . 2 (𝑘 = 𝐾 → (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0)))
109fveq2d 6838 1 (𝑘 = 𝐾 → (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / (i↑𝑘)))), (ℜ‘(𝐵 / (i↑𝑘))), 0))) = (∫2‘(𝑥 ∈ ℝ ↦ if((𝑥𝐴 ∧ 0 ≤ (ℜ‘(𝐵 / 𝑇))), (ℜ‘(𝐵 / 𝑇)), 0))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  ifcif 4479   class class class wbr 5098  cmpt 5179  cfv 6492  (class class class)co 7358  cr 11025  0cc0 11026  ici 11028  cle 11167   / cdiv 11794  cexp 13984  cre 15020  2citg2 25573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-iota 6448  df-fv 6500  df-ov 7361
This theorem is referenced by:  iblcnlem1  25745  itgcnlem  25747
  Copyright terms: Public domain W3C validator