| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvprodi | Structured version Visualization version GIF version | ||
| Description: Change bound variable in a product. (Contributed by Scott Fenton, 4-Dec-2017.) |
| Ref | Expression |
|---|---|
| cbvprodi.1 | ⊢ Ⅎ𝑘𝐵 |
| cbvprodi.2 | ⊢ Ⅎ𝑗𝐶 |
| cbvprodi.3 | ⊢ (𝑗 = 𝑘 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvprodi | ⊢ ∏𝑗 ∈ 𝐴 𝐵 = ∏𝑘 ∈ 𝐴 𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvprodi.3 | . 2 ⊢ (𝑗 = 𝑘 → 𝐵 = 𝐶) | |
| 2 | nfcv 2926 | . 2 ⊢ Ⅎ𝑘𝐴 | |
| 3 | nfcv 2926 | . 2 ⊢ Ⅎ𝑗𝐴 | |
| 4 | cbvprodi.1 | . 2 ⊢ Ⅎ𝑘𝐵 | |
| 5 | cbvprodi.2 | . 2 ⊢ Ⅎ𝑗𝐶 | |
| 6 | 1, 2, 3, 4, 5 | cbvprod 16126 | 1 ⊢ ∏𝑗 ∈ 𝐴 𝐵 = ∏𝑘 ∈ 𝐴 𝐶 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Ⅎwnfc 2911 ∏cprod 16116 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| 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-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-xp 5664 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-iota 6520 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-seq 14185 df-prod 16117 |
| This theorem is used by: prodfc 16156 fprodcllemf 16169 prodsn 16173 prodsnf 16175 fprodm1s 16181 fprodp1s 16182 prodsns 16183 fprod2dlem 16191 fprodcom2 16195 fproddivf 16198 fprodsplitf 16199 |
| Copyright terms: Public domain | W3C validator |