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

Theorem prodeq1 12345
Description: Equality theorem for a product. (Contributed by Scott Fenton, 1-Dec-2017.)
Assertion
Ref Expression
prodeq1  |-  ( A  =  B  ->  prod_ k  e.  A  C  = 
prod_ k  e.  B  C )
Distinct variable groups:    A, k    B, k
Allowed substitution hint:    C( k)

Proof of Theorem prodeq1
StepHypRef Expression
1 nfcv 2392 . 2  |-  F/_ k A
2 nfcv 2392 . 2  |-  F/_ k B
31, 2prodeq1f 12344 1  |-  ( A  =  B  ->  prod_ k  e.  A  C  = 
prod_ k  e.  B  C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402   prod_cprod 12342
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-cnv 4784  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-recs 6580  df-frec 6666  df-seqfrec 10906  df-proddc 12343
This theorem is used by:  prodeq1i  12353  prodeq1d  12356  prod1dc  12378  fprodf1o  12380  fprodssdc  12382  fprodmul  12383  fprodcl2lem  12397  fprodcllem  12398  fprodconst  12412  fprodap0  12413  fprod2d  12415  fprodrec  12421  fprodap0f  12428  fprodle  12432  fprodmodd  12433
  Copyright terms: Public domain W3C validator