[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 ls-inv-prefixn-ladrs
⊦ inv(groupblock(gndx0 + gndx1, lax0 + lax1, n)) → prefixn(# gndx0 + # gndx1, lax0 + lax1) = lax0 + lax1
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
Used spec theorems:
ablock-store-inv
/group-store/
inv-block
Used simplifier rules:
nat-basic
/
f
nat
/
le-def
nat
/
ge
list-prefixn
/laddress-list/
prefixn-full-eq
ablock
/group-store/
sel-01
list
/group-store/
len
list
/group-store/
a
ablock
/group-store/
sel-02
list
/laddress-list/
len
list
/laddress-list/
a
nat-basic
/
lf-02
nat-basic
/
lf-01
list-dup
/laddress-list/
a
nat-basic
/
ls-02