[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-prefixn-append-nonend
⊦ valid-group-nodes(prefixn(n, gndx + mkgnode(nd, m, boolvar, false) ')) = valid-group-nodes(prefixn(n, gndx))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
valid-group-nodes-drop-superfluous-prefixn
,
valid-group-nodes-shorter-prefix
,
valid-group-nodes-shorter-prefix-right
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 5
Used lemmas:
valid-group-nodes-rec
,
Used spec theorems:
list-prefixn
/group-store/
prefixn
Used simplifier rules:
list
/group-store/
len-02
list
/group-store/
len
nat
/
fle
nat-basic
/
l-02
nat
/
le-def
nat
/
les
nat-basic
/
a
nat-basic
/
c
nat
/
eqle-one
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
oz
list-del
/group-store/
firstn-app
list-del
/group-store/
firstn-one-02
list
/group-store/
a
groupnode
/
sel-05
list-del
/group-store/
first-append