[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 induction-rev-list
φ([]) ∧ (∀ gndx, gnd. φ(gndx) → φ(gndx + gnd)) ⊦ φ(gndx)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
valid-group-nodes-drop-superfluous-prefixn
,
valid-group-nodes-entire
,
valid-group-nodes-ls
,
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: 8
Used lemmas:
Used spec theorems:
list
/group-store/
lastdiv-rew
Used simplifier rules:
list
/group-store/
Last
list
/group-store/
len
list
/group-store/
len-02
list
/group-store/
a
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity
nat-basic
/
a
nat-basic
/
c