[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem product-pot-rec
⊦ i ∈ ints → Π ints = i ^ n→i(#oc(i, ints)) * Π(ints -l i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max_exp-divides
,
product-pot-no-dups
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
Used spec theorems:
int-pot
/
Pot-pos
Used simplifier rules:
intlist
/
prod-empty
list-perm
/intlista/
oc-e
list-del
/intlista/
del-e
list
/intlista/
in-17
list
/intlista/
in-append
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list-perm
/intlista/
ocappend
list
/intlista/
c
list-del
/intlista/
del-y
list-perm
/intlista/
one
intnat
/
nat2int
int-abs
/
mone-06
int-abs
/
numls-02
int-basic2
/
pred
list-perm
/intlista/
notin
int-pot
/
Pot-zero
list-del
/intlista/
in-03
int-mult
/
one
int-mult
/
eq-nonzero
int-mult
/
commutativity
int-mult
/
neq-not-zero
int-mult
/
associativity
intlist
/
prod-rec
list
/intlista/
a
list-del
/intlista/
del-n
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
list-perm
/intlista/
one-01