| 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 2372 | . 2 ⊢ Ⅎ𝑘𝐴 | |
| 2 | nfcv 2372 | . 2 ⊢ Ⅎ𝑘𝐵 | |
| 3 | 1, 2 | prodeq1f 12049 | 1 ⊢ (𝐴 = 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∏cprod 12047 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-if 3603 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-mpt 4146 df-cnv 4724 df-dm 4726 df-rn 4727 df-res 4728 df-iota 5274 df-f 5318 df-f1 5319 df-fo 5320 df-f1o 5321 df-fv 5322 df-ov 5997 df-oprab 5998 df-mpo 5999 df-recs 6441 df-frec 6527 df-seqfrec 10657 df-proddc 12048 |
| This theorem is referenced by: prodeq1i 12058 prodeq1d 12061 prod1dc 12083 fprodf1o 12085 fprodssdc 12087 fprodmul 12088 fprodcl2lem 12102 fprodcllem 12103 fprodconst 12117 fprodap0 12118 fprod2d 12120 fprodrec 12126 fprodap0f 12133 fprodle 12137 fprodmodd 12138 |
| Copyright terms: Public domain | W3C validator |