Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  etransclem5 Structured version   Visualization version   GIF version

Theorem etransclem5 42544
Description: A change of bound variable, often used in proofs for etransc 42588. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
Assertion
Ref Expression
etransclem5 (𝑗 ∈ (0...𝑀) ↦ (𝑥𝑋 ↦ ((𝑥𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))) = (𝑘 ∈ (0...𝑀) ↦ (𝑦𝑋 ↦ ((𝑦𝑘)↑if(𝑘 = 0, (𝑃 − 1), 𝑃))))
Distinct variable groups:   𝑗,𝑀,𝑘   𝑃,𝑗,𝑘,𝑥,𝑦   𝑗,𝑋,𝑘,𝑥,𝑦
Allowed substitution hints:   𝑀(𝑥,𝑦)

Proof of Theorem etransclem5
StepHypRef Expression
1 oveq1 7163 . . . . 5 (𝑥 = 𝑦 → (𝑥𝑗) = (𝑦𝑗))
21oveq1d 7171 . . . 4 (𝑥 = 𝑦 → ((𝑥𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ((𝑦𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))
32cbvmptv 5169 . . 3 (𝑥𝑋 ↦ ((𝑥𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) = (𝑦𝑋 ↦ ((𝑦𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))
4 oveq2 7164 . . . . 5 (𝑗 = 𝑘 → (𝑦𝑗) = (𝑦𝑘))
5 eqeq1 2825 . . . . . 6 (𝑗 = 𝑘 → (𝑗 = 0 ↔ 𝑘 = 0))
65ifbid 4489 . . . . 5 (𝑗 = 𝑘 → if(𝑗 = 0, (𝑃 − 1), 𝑃) = if(𝑘 = 0, (𝑃 − 1), 𝑃))
74, 6oveq12d 7174 . . . 4 (𝑗 = 𝑘 → ((𝑦𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ((𝑦𝑘)↑if(𝑘 = 0, (𝑃 − 1), 𝑃)))
87mpteq2dv 5162 . . 3 (𝑗 = 𝑘 → (𝑦𝑋 ↦ ((𝑦𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) = (𝑦𝑋 ↦ ((𝑦𝑘)↑if(𝑘 = 0, (𝑃 − 1), 𝑃))))
93, 8syl5eq 2868 . 2 (𝑗 = 𝑘 → (𝑥𝑋 ↦ ((𝑥𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) = (𝑦𝑋 ↦ ((𝑦𝑘)↑if(𝑘 = 0, (𝑃 − 1), 𝑃))))
109cbvmptv 5169 1 (𝑗 ∈ (0...𝑀) ↦ (𝑥𝑋 ↦ ((𝑥𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))) = (𝑘 ∈ (0...𝑀) ↦ (𝑦𝑋 ↦ ((𝑦𝑘)↑if(𝑘 = 0, (𝑃 − 1), 𝑃))))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  ifcif 4467  cmpt 5146  (class class class)co 7156  0cc0 10537  1c1 10538  cmin 10870  ...cfz 12893  cexp 13430
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-iota 6314  df-fv 6363  df-ov 7159
This theorem is referenced by:  etransclem27  42566  etransclem29  42568  etransclem31  42570  etransclem32  42571  etransclem33  42572  etransclem34  42573  etransclem35  42574  etransclem38  42577  etransclem40  42579  etransclem42  42581  etransclem44  42583  etransclem45  42584  etransclem46  42585
  Copyright terms: Public domain W3C validator