[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 range-eq-validtrailer
⊦ is-aligned(# buf, NODE_HEADER_SIZE) ∧ is-aligned(m, NODE_HEADER_SIZE) → (range=(buf + mkempbuf(n), m, validtrailer, 0, NODE_HEADER_SIZE) ↔ range=(buf, m, validtrailer, 0, NODE_HEADER_SIZE))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-read-gblock-nodes
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 29
Used lemmas:
Used spec theorems:
array-splice
/buffer/
range-eq-subarrays
eraseblock
/
isempty
eraseblock
/
isempty-ext
array
/buffer/
Extension
array-splice
/buffer/
emparray-at
nat-basic
/
addex
array-splice
/buffer/
range-eq-ext
array-splice
/buffer/
append-at
Used simplifier rules:
array-copy
/buffer/
subarray-elim
nat
/
le-add
array-splice
/buffer/
subarray-append-elim-left
nat
/
elim-sub
nat
/
lep
node-header-size
/
validtrailer-not-empty
oelem
/nat-set/
irreflexivity
nat
/
lez
array-copy
/buffer/
subarray-at
array-copy
/buffer/
size-subarray
abs-node
/encoding-index-node/
buf-size-zero
align
/
is-aligned-add
align
/
is-aligned-ls-eq-zero
array-splice
/buffer/
subarray-elim-right
align
/
is-aligned-le-eq-zero
array-splice
/buffer/
append-a
array-splice
/buffer/
append-len
node-header-size
/
nodeheader-notzero
nat-basic
/
l-02
node-header-size
/
node-header-size-add-eq-0
nat
/
fle
nat
/
le-def
nat
/
ler
node-header-size
/
validtrailer-size
nat-basic
/
add-base
nat
/
ls-le-simp
nat
/
lep-02
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-01
nat
/
let
nat
/
fle-01
nat
/
lels
nat-basic
/
f
array-splice
/buffer/
emparray-len