[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-app
⊦ inv-flashsize(x0, lax0) ∧ inv-flashsize(x1, lax1) → inv-flashsize(x0 + x1, lax0 + lax1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
apersistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
inv-flashsize
,
Used spec theorems:
list-del
/
get-append-grt
Used simplifier rules:
list
/laddress-list/
len
list
/
len
laddress
/
elim
list-del
/laddress-list/
get-append-less
list
/
a
list-del
/
get-append-less
laddress
/
sel-01
nat-basic
/
l-01
nat
/
fle-01
nat
/
lels
nat
/
elim-sub
list-data
/laddress-list/
l
nat-basic
/
lf-01
nat-basic
/
f
nat-basic
/
l
nat
/
lep
list
/laddress-list/
a
nat-basic
/
c
nat-basic
/
a
list-del
/laddress-list/
get-append-grt-02