[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 decode-contract
n + ENCODED_ELEM_SIZE ≤ # buf ⊦ ⟪decode_nonempty#(n, buf; a; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-encoded-nonempty(a, subarray(buf, n, ENCODED_ELEM_SIZE))))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
encoding-page-size-nonempty
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 17
Used lemmas:
is-encoded-nonempty
,
decode
,
Used spec theorems:
encoding
/
decode-contract
eraseblock
/
isempty-ext
array
/buffer/
Extension
Used simplifier rules:
error
/
disj-78
error-class
/
einval
eraseblock
/
isempty-empbuf
encoding-fixed-size
/
encoding-size
encoding-fixed-size
/
is-encoded-size
nat-basic
/
a
encoding-fixed-size
/
encoding-requires-space
nat-basic
/
l-01
nat
/
fle-01
nat
/
fle
nat-basic
/
f
array-splice
/buffer/
emparray-at
array-copy
/buffer/
subarray-at
array-splice
/buffer/
emparray-len
array-copy
/buffer/
size-subarray
nat
/
ls-01
nat
/
le-ls-simp
nat
/
le-def
nat-basic
/
c
nat
/
elim-sub