[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 transaction-prefix-app
⊦ transaction-prefix(ndx, gndx0 + gndx1) → transaction-prefix(ndx, gndx0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-abs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 31
Used lemmas:
transaction-prefix
,
Used spec theorems:
list-del
/group-store/
get-append-grt
Used simplifier rules:
nat-basic
/
nls-fst
list-data
/node-list/
l
nat-basic
/
zero
list
/group-store/
len
groupnode
/
elim
list-data
/group-store/
l
list-data
/group-store/
elim-list-c
oelem
/nat-set/
transitivity
nat-basic
/
lf
list-del
/group-store/
get-append-less
list
/group-store/
app-02
groupnode
/
inj
list
/group-store/
first-01
nat-basic
/
s-04
nat-basic
/
succ
list
/group-store/
len-05
list
/group-store/
a
list
/group-store/
e-01
list
/group-store/
c
nat
/
le-ls-simp
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-02
nat
/
fle
nat-basic
/
f