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