[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-ls
⊦ n < valid-group-nodes(gndx) → n < # gndx
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
adr-in-index-node-key
,
nodes-append-subseteq
,
nodes-append-subseteq-nodown
,
valid-group-nodes-drop
,
valid-group-nodes-entire
,
valid-group-nodes-le
,
valid-group-nodes-shorter-prefix
,
valid-group-nodes-shorter-prefix-right
,
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
valid-group-nodes-rec
,
valid-group-nodes-base
,
induction-rev-list
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
l
list
/group-store/
in-17
list
/group-store/
in-append
list
/group-store/
in-15
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/group-store/
len-02
list
/group-store/
len
list
/group-store/
a
list
/group-store/
Last
nat-basic
/
zero-01
groupnode
/
elim
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
oelem
/nat-set/
irreflexivity