[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 inv-flashsize-prepend
⊦ inv-flashsize(a ' + x, ladr ' + lax) ↔ a.flashsize = ladr.size ∧ inv-flashsize(x, lax)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-base
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 20
Used lemmas:
inv-flashsize
,
Used spec theorems:
list-del
/
get-append-grt
Used simplifier rules:
laddress
/
elim
nat-basic
/
eq-01
list
/laddress-list/
len-05
nat-basic
/
succ
list
/
len-05
list-del
/
get-zero-01
nat-basic
/
zero-01
nat-basic
/
s-04
list-del
/
get-succ
nat
/
lels
list-del
/
get-append-less
list
/
a
list-del
/laddress-list/
get-zero-01
laddress
/
inj
list-del
/
one-03
nat-basic
/
one-01
list
/
len-02
nat
/
elim-pred-c
list-data
/laddress-list/
l
nat-basic
/
lf-01
nat-basic
/
f
nat
/
succ-01
nat-basic
/
oz
list
/laddress-list/
a
nat-basic
/
c
nat-basic
/
a
list-del
/laddress-list/
get-succ
laddress
/
sel-01