[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 prepost-decode-lpt
# buf = lptsize(# lpt, LEB_SIZE), buf0 = buf, lpt0 = lpt ⊦ ⟪persistence_io_decode_lpt#(buf; lpt, err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ # buf = # buf0 ∧ (err = ESUCCESS → is-encoded(lpt, buf) ∧ # lpt = # lpt0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-recover
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 27
Used lemmas:
decode-lpt
,
Used spec theorems:
encoding
/encoding-lprops/
decode-contract
encoding-lpt
/
is-encoded
encoding-lpt
/
is-encoded-full
Used simplifier rules:
nat
/
lez
nat-basic
/
zero-01
nat
/
ls-01
nat
/
le-ls-simp
nat
/
fle
nat-basic
/
lf-02
nat
/
le-def
nat
/
elim-sub
nat
/
lels-03
array-copy
/buffer/
size-subarray
encoding-fixed-size
/encoding-lprops/
is-encoded-size
oelem
/nat-set/
irreflexivity
nat-basic
/
l
nat
/
succ-01
encoding-fixed-size
/encoding-lprops/
encoding-size
nat-basic
/
lf-01
nat-basic
/
s-04
array
/lp-array/
Size-put
nat-basic
/
l-01
nat-basic
/
a
nat-basic
/
c
nat
/
le-add
array
/lp-array/
cgetput
encoding
/encoding-lprops/
is-encoded-unique
nat-basic
/
f
array
/lp-array/
ngp-07
nat
/
lels-02
nat
/
ler
nat
/
anti
nat
/
lels