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

Theorem prodeq1 11596
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 2332 . 2  |-  F/_ k A
2 nfcv 2332 . 2  |-  F/_ k B
31, 2prodeq1f 11595 1  |-  ( A  =  B  ->  prod_ k  e.  A  C  = 
prod_ k  e.  B  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364   prod_cprod 11593
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-if 3550  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-mpt 4081  df-cnv 4652  df-dm 4654  df-rn 4655  df-res 4656  df-iota 5196  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-ov 5900  df-oprab 5901  df-mpo 5902  df-recs 6331  df-frec 6417  df-seqfrec 10479  df-proddc 11594
This theorem is referenced by:  prodeq1i  11604  prodeq1d  11607  prod1dc  11629  fprodf1o  11631  fprodssdc  11633  fprodmul  11634  fprodcl2lem  11648  fprodcllem  11649  fprodconst  11663  fprodap0  11664  fprod2d  11666  fprodrec  11672  fprodap0f  11679  fprodle  11683  fprodmodd  11684
  Copyright terms: Public domain W3C validator