[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 from-to-rest
⊦ # buf = n + m → (⌜buf⌝ from n) to m = ⌜buf⌝ from n
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
from-empty
,
finp-buf
,
tostream-size
,
Used spec theorems:
stream
/buffer-inf/
extensionality
stream
/buffer-inf/
size-to
stream
/buffer-inf/
fin-size-from
Used simplifier rules:
nat-basic
/
lf-02
nat-basic
/
lf
nat-basic
/
trans
nat-basic
/
ls-02
stream
/buffer-inf/
size-to
stream
/buffer-inf/
finlen-tolen
nat-inf
/
sel
nat-inf
/
inj
nat-inf
/
less-fin
nat
/
le-def
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c
nat
/
ls-01
nat
/
lels
nat-basic
/
lf-01
nat
/
fle
stream-basic
/buffer-inf/
stream-fin-forward
nat-basic
/
f
nat
/
eq-01
nat
/
le-add
nat-basic
/
add-base
stream
/buffer-inf/
size-empty-equiv
nat-inf
/
not-less-zero