| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > etransclem11 | Structured version Visualization version GIF version | ||
| Description: A change of bound variable, often used in proofs for etransc 46726. (Contributed by Glauco Siliprandi, 5-Apr-2020.) |
| Ref | Expression |
|---|---|
| etransclem11 | ⊢ (𝑛 ∈ ℕ0 ↦ {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛}) = (𝑚 ∈ ℕ0 ↦ {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7364 | . . . . 5 ⊢ (𝑛 = 𝑚 → (0...𝑛) = (0...𝑚)) | |
| 2 | 1 | oveq1d 7371 | . . . 4 ⊢ (𝑛 = 𝑚 → ((0...𝑛) ↑m (0...𝑀)) = ((0...𝑚) ↑m (0...𝑀))) |
| 3 | 2 | rabeqdv 3406 | . . 3 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛}) |
| 4 | fveq2 6827 | . . . . . . . 8 ⊢ (𝑗 = 𝑘 → (𝑐‘𝑗) = (𝑐‘𝑘)) | |
| 5 | 4 | cbvsumv 15649 | . . . . . . 7 ⊢ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = Σ𝑘 ∈ (0...𝑀)(𝑐‘𝑘) |
| 6 | fveq1 6826 | . . . . . . . 8 ⊢ (𝑐 = 𝑑 → (𝑐‘𝑘) = (𝑑‘𝑘)) | |
| 7 | 6 | sumeq2sdv 15656 | . . . . . . 7 ⊢ (𝑐 = 𝑑 → Σ𝑘 ∈ (0...𝑀)(𝑐‘𝑘) = Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘)) |
| 8 | 5, 7 | eqtrid 2786 | . . . . . 6 ⊢ (𝑐 = 𝑑 → Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘)) |
| 9 | 8 | eqeq1d 2741 | . . . . 5 ⊢ (𝑐 = 𝑑 → (Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛 ↔ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛)) |
| 10 | 9 | cbvrabv 3401 | . . . 4 ⊢ {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛} |
| 11 | eqeq2 2751 | . . . . 5 ⊢ (𝑛 = 𝑚 → (Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛 ↔ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚)) | |
| 12 | 11 | rabbidv 3398 | . . . 4 ⊢ (𝑛 = 𝑚 → {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 13 | 10, 12 | eqtrid 2786 | . . 3 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 14 | 3, 13 | eqtrd 2774 | . 2 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 15 | 14 | cbvmptv 5176 | 1 ⊢ (𝑛 ∈ ℕ0 ↦ {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛}) = (𝑚 ∈ ℕ0 ↦ {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 {crab 3391 ↦ cmpt 5153 ‘cfv 6485 (class class class)co 7356 ↑m cmap 8763 0cc0 11029 ℕ0cn0 12428 ...cfz 13452 Σcsu 15639 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-xp 5624 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-iota 6441 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-seq 13955 df-sum 15640 |
| This theorem is referenced by: etransclem32 46709 etransclem33 46710 etransclem36 46713 etransclem37 46714 etransclem38 46715 etransclem40 46717 etransclem41 46718 etransclem42 46719 etransclem44 46721 etransclem45 46722 |
| Copyright terms: Public domain | W3C validator |