[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-shorter-prefix
⊦ n1 ≤ n0 → ¬ valid-group-nodes(prefixn(n0, gndx)) < valid-group-nodes(prefixn(n1, gndx))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 12
Used lemmas:
valid-group-nodes-shorter-prefix-right
,
valid-group-nodes-prefixn-append-nonend
,
valid-group-nodes-rec
,
induction-rev-list
,
valid-group-nodes-ls
,
Used spec theorems:
list-prefixn
/group-store/
prefixn-append-left
Used simplifier rules:
list
/group-store/
Last
groupnode
/
elim
list
/group-store/
e-02
list-prefixn
/group-store/
prefixn-eq-empty
list
/group-store/
len
list
/group-store/
len-02
nat
/
succ-01
nat
/
lels
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-02
list-prefixn
/group-store/
prefixn-fulln
groupnode
/
sel-05
nat-basic
/
l
list-data
/group-store/
l
nat
/
ls-le-simp
list
/group-store/
a
list-prefixn
/group-store/
prefixn-append-left
nat
/
fle
nat
/
let
nat
/
fle-01
nat
/
le-def
nat
/
le-ls-simp
list-prefixn
/group-store/
prefixn-len-n
nat-basic
/
f