[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 embed-split
⊦ a[P0 * P1] = a[P0] * a[P1]
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
linked-list-aux
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 36
Proof steps: 64
Used lemmas:
lift-aux
,
Used spec theorems:
heap-fun
/heap-aux/
mk-ext
heap-fun
/heap-aux/
apply
heap-fun
/
sep
heap-fun
/heap-aux/
uni
heap-sep
/heap-aux/
split-union
heap-fun
/
apply
heap-sep
/heap-aux/
sep
heap-fun
/heap-aux/
mk-exists
heap-sep
/
sep
heap
/
ext
heap
/
in-uni
heap-fun
/heap-aux/
in-uni
heap
/heap-aux/
ext
heap
/heap-aux/
in-uni
Used simplifier rules:
set-basic
/refset/
size-zero-01
set-union
/refset/
unin-01
set-union
/refset/
una
set-union
/refset/
unc
heap-fun
/
at-mk
heap-fun
/
in-mk
heap-fun
/
disj
set-basic
/refset/
ne-01
heap-fun
/heap-aux/
at-unil-M01
heap-fun
/heap-aux/
at-unil-M02
heap-fun
/
at-unil
heap-fun
/heap-aux/
at-unir-M01
heap-fun
/heap-aux/
at-unir-M02
heap-fun
/
at-unir
heap-fun
/heap-aux/
disj
heap
/heap-aux/
at-uni-M01
heap-fun
/heap-aux/
in-mk
heap
/heap-aux/
at-uni-M02
heap
/heap-aux/
in-uni
set-union
/refset/
int-a
set-union
/refset/
int-c
set-union
/refset/
int-empty-02
heap-fun
/heap-aux/
at-mk-M02
heap-fun
/heap-aux/
at-mk-M01