| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prodeq1 | GIF version | ||
| Description: Equality theorem for a product. (Contributed by Scott Fenton, 1-Dec-2017.) |
| Ref | Expression |
|---|---|
| prodeq1 | ⊢ (𝐴 = 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2374 | . 2 ⊢ Ⅎ𝑘𝐴 | |
| 2 | nfcv 2374 | . 2 ⊢ Ⅎ𝑘𝐵 | |
| 3 | 1, 2 | prodeq1f 12118 | 1 ⊢ (𝐴 = 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∏cprod 12116 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-if 3606 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-cnv 4733 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6021 df-oprab 6022 df-mpo 6023 df-recs 6471 df-frec 6557 df-seqfrec 10711 df-proddc 12117 |
| This theorem is referenced by: prodeq1i 12127 prodeq1d 12130 prod1dc 12152 fprodf1o 12154 fprodssdc 12156 fprodmul 12157 fprodcl2lem 12171 fprodcllem 12172 fprodconst 12186 fprodap0 12187 fprod2d 12189 fprodrec 12195 fprodap0f 12202 fprodle 12206 fprodmodd 12207 |
| Copyright terms: Public domain | W3C validator |