| 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 46268. (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 7357 | . . . . 5 ⊢ (𝑛 = 𝑚 → (0...𝑛) = (0...𝑚)) | |
| 2 | 1 | oveq1d 7364 | . . . 4 ⊢ (𝑛 = 𝑚 → ((0...𝑛) ↑m (0...𝑀)) = ((0...𝑚) ↑m (0...𝑀))) |
| 3 | 2 | rabeqdv 3410 | . . 3 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛}) |
| 4 | fveq2 6822 | . . . . . . . 8 ⊢ (𝑗 = 𝑘 → (𝑐‘𝑗) = (𝑐‘𝑘)) | |
| 5 | 4 | cbvsumv 15603 | . . . . . . 7 ⊢ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = Σ𝑘 ∈ (0...𝑀)(𝑐‘𝑘) |
| 6 | fveq1 6821 | . . . . . . . 8 ⊢ (𝑐 = 𝑑 → (𝑐‘𝑘) = (𝑑‘𝑘)) | |
| 7 | 6 | sumeq2sdv 15610 | . . . . . . 7 ⊢ (𝑐 = 𝑑 → Σ𝑘 ∈ (0...𝑀)(𝑐‘𝑘) = Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘)) |
| 8 | 5, 7 | eqtrid 2776 | . . . . . 6 ⊢ (𝑐 = 𝑑 → Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘)) |
| 9 | 8 | eqeq1d 2731 | . . . . 5 ⊢ (𝑐 = 𝑑 → (Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛 ↔ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛)) |
| 10 | 9 | cbvrabv 3405 | . . . 4 ⊢ {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛} |
| 11 | eqeq2 2741 | . . . . 5 ⊢ (𝑛 = 𝑚 → (Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛 ↔ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚)) | |
| 12 | 11 | rabbidv 3402 | . . . 4 ⊢ (𝑛 = 𝑚 → {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 13 | 10, 12 | eqtrid 2776 | . . 3 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 14 | 3, 13 | eqtrd 2764 | . 2 ⊢ (𝑛 = 𝑚 → {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛} = {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| 15 | 14 | cbvmptv 5196 | 1 ⊢ (𝑛 ∈ ℕ0 ↦ {𝑐 ∈ ((0...𝑛) ↑m (0...𝑀)) ∣ Σ𝑗 ∈ (0...𝑀)(𝑐‘𝑗) = 𝑛}) = (𝑚 ∈ ℕ0 ↦ {𝑑 ∈ ((0...𝑚) ↑m (0...𝑀)) ∣ Σ𝑘 ∈ (0...𝑀)(𝑑‘𝑘) = 𝑚}) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 {crab 3394 ↦ cmpt 5173 ‘cfv 6482 (class class class)co 7349 ↑m cmap 8753 0cc0 11009 ℕ0cn0 12384 ...cfz 13410 Σcsu 15593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-mpt 5174 df-xp 5625 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-iota 6438 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-seq 13909 df-sum 15594 |
| This theorem is referenced by: etransclem32 46251 etransclem33 46252 etransclem36 46255 etransclem37 46256 etransclem38 46257 etransclem40 46259 etransclem41 46260 etransclem42 46261 etransclem44 46263 etransclem45 46264 |
| Copyright terms: Public domain | W3C validator |