ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvprodv Unicode version

Theorem cbvprodv 12119
Description: Change bound variable in a product. (Contributed by Scott Fenton, 4-Dec-2017.)
Hypothesis
Ref Expression
cbvprod.1  |-  ( j  =  k  ->  B  =  C )
Assertion
Ref Expression
cbvprodv  |-  prod_ j  e.  A  B  =  prod_ k  e.  A  C
Distinct variable groups:    j, k, A    B, k    C, j
Allowed substitution hints:    B( j)    C( k)

Proof of Theorem cbvprodv
StepHypRef Expression
1 cbvprod.1 . 2  |-  ( j  =  k  ->  B  =  C )
2 nfcv 2374 . 2  |-  F/_ k A
3 nfcv 2374 . 2  |-  F/_ j A
4 nfcv 2374 . 2  |-  F/_ k B
5 nfcv 2374 . 2  |-  F/_ j C
61, 2, 3, 4, 5cbvprod 12118 1  |-  prod_ j  e.  A  B  =  prod_ k  e.  A  C
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397   prod_cprod 12110
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-3an 1006  df-tru 1400  df-fal 1403  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-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  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-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-recs 6470  df-frec 6556  df-seqfrec 10709  df-proddc 12111
This theorem is referenced by:  eulerthlemth  12803
  Copyright terms: Public domain W3C validator