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

Theorem prodeq1 12101
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 2372 . 2  |-  F/_ k A
2 nfcv 2372 . 2  |-  F/_ k B
31, 2prodeq1f 12100 1  |-  ( A  =  B  ->  prod_ k  e.  A  C  = 
prod_ k  e.  B  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395   prod_cprod 12098
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 2802  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3890  df-br 4085  df-opab 4147  df-mpt 4148  df-cnv 4729  df-dm 4731  df-rn 4732  df-res 4733  df-iota 5282  df-f 5326  df-f1 5327  df-fo 5328  df-f1o 5329  df-fv 5330  df-ov 6014  df-oprab 6015  df-mpo 6016  df-recs 6464  df-frec 6550  df-seqfrec 10698  df-proddc 12099
This theorem is referenced by:  prodeq1i  12109  prodeq1d  12112  prod1dc  12134  fprodf1o  12136  fprodssdc  12138  fprodmul  12139  fprodcl2lem  12153  fprodcllem  12154  fprodconst  12168  fprodap0  12169  fprod2d  12171  fprodrec  12177  fprodap0f  12184  fprodle  12188  fprodmodd  12189
  Copyright terms: Public domain W3C validator