[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 smaller
⊦ copy-node-prepost(H0, H, map) → # map ≤ # H0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
copy-new-node
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 23
Proof steps: 45
Used lemmas:
copy-node-prepost
,
Used spec theorems:
heap
/node-heap/
ext
store
/ref-map/
exin
heap
/node-heap/
in-alloc
heap
/node-heap/
exin
functions
/
dom-write
functions
/
dom-alloc
set-union
/refset/
subdef
Used simplifier rules:
nat
/
lels-01
functions
/
dom-empty
set-basic
/refset/
subset-empty
store+set
/ref-map-store+set-r/
dom-isemp
heap
/node-heap/
size-emp
nat-basic1
/
zero
heap
/node-heap/
in-emp
nat
/
lels
store
/ref-map/
Size-insert
set-basic
/refset/
sub-add-03
store+set
/ref-map-store+set-r/
dom-ins
heap
/node-heap/
sanity
store
/ref-map/
empty
nat-basic1
/
f
nat
/
succ-01
set-basic
/refset/
sub-insert-01
set-basic
/refset/
in-03
set-basic
/refset/
rax
functions
/
dom
store+set
/ref-map-store+set-r/
Dom
heap
/node-heap/
nonnull
heap
/node-heap/
in-alloc
heap
/node-heap/
size-write
heap
/node-heap/
size-alloc
nat-basic2
/
s
nat-basic1
/
ref-1
set-basic
/refset/
sub-ntrans
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
nls-fst