[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-last-nonend
⊦ ¬ transaction-prefix(ndx, gndx + mkgnode(nd, n, boolvar, true) ')
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: 3
Proof steps: 14
Used lemmas:
transaction-prefix
,
Used spec theorems:
list-del
/group-store/
get-append-grt
list
/group-store/
lastdiv-rew
Used simplifier rules:
list-data
/node-list/
l
nat-basic
/
f
nat-basic
/
zero
list
/group-store/
app-02
list
/group-store/
e
list-data
/group-store/
elim-list-c
list
/group-store/
e-02
list
/group-store/
c
groupnode
/
elim
list
/group-store/
in-15
list-del
/group-store/
get-append-less
list-data
/group-store/
size-01
list-del
/group-store/
one-03
list
/group-store/
app
list
/group-store/
c-05
nat-basic
/
zero-01
list
/group-store/
inapp-07
nat-basic
/
one-01
nat
/
elim-pred-c
list-data
/group-store/
l
list
/group-store/
app-06
list
/group-store/
a
list
/group-store/
len
list
/group-store/
len-02
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
list-del
/group-store/
get-last
list
/group-store/
in-append
list
/group-store/
in-17
list
/group-store/
in-14
groupnode
/
inj
list
/group-store/
in-rec
list
/group-store/
len-05
nat-basic
/
succ
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity