| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prodeq1iOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of prodeq1i 15820 as of 1-Sep-2025. (Contributed by Scott Fenton, 4-Dec-2017.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| prodeq1iOLD.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| prodeq1iOLD | ⊢ ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prodeq1iOLD.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | prodeq1 15811 | . 2 ⊢ (𝐴 = 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ∏cprod 15807 |
| 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 2113 ax-9 2121 ax-ext 2703 |
| 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 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-opab 5154 df-mpt 5173 df-xp 5622 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-iota 6437 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-seq 13906 df-prod 15808 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |