[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-divide
⊦ perm(ints, ints0 + ints1) → Π ints = Π ints0 * Π ints1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
product-del1-02
,
product-one
,
product-app
,
prod-empty
,
Used spec theorems:
list-perm
/intlista/
del-01
list-del
/intlista/
app-01
Used simplifier rules:
list-perm
/intlista/
empty-01
list
/intlista/
app-02-ant
list
/intlista/
c
list
/intlista/
in-append
list
/intlista/
a
list-del
/intlista/
app
int-mult
/
associativity
int-mult
/
commutativity