[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 valid-group-nodes-app-transaction-prefix
⊦ transaction-prefix(ndx, gndx1) → valid-group-nodes(gndx0 + gndx1) = valid-group-nodes(gndx0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
valid-group-nodes-rec
,
Used spec theorems:
list
/group-store/
lastdiv-rew
Used simplifier rules:
list
/group-store/
app
groupnode
/
elim
gjournal-base
/
transaction-prefix-last-nonend
list
/group-store/
a
gjournal-base
/
transaction-prefix-app
list
/group-store/
len
list
/group-store/
len-02
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity
nat-basic
/
a
nat-basic
/
c