[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 is-encoded-prefix
⊦ buf0 + buf1 = buf2 + buf3 ∧ is-encoded(a, buf0) → (is-encoded(b, buf2) ↔ # buf0 = # buf2 ∧ a = b)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 25
Used lemmas:
is-encoded-unique
,
is-encoded-unique-size
,
Used spec theorems:
array
/buffer/
Extension
Used simplifier rules:
nat
/
ler
nat
/
fle
array-splice
/buffer/
append-len
nat
/
lels-02
nat
/
le-def
nat
/
lels-03
nat-basic
/
ref
nat-basic
/
lf-01
nat-basic
/
lf-02
array-copy
/buffer/
subarray-elim
array-splice
/buffer/
append-inj
nat-basic
/
succ
nat-basic
/
trans
nat-basic
/
lf
nat-basic
/
f
nat-basic
/
add-base
array-copy
/buffer/
subarray-at
array-copy
/buffer/
size-subarray
array-splice
/buffer/
append-at1
array-splice
/buffer/
append-a
nat
/
lels
nat
/
fle-01
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c