[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 nds-split
⊦ gndx.nds = ndx0 + ndx1 ↔ (∃ gndx0, gndx1. gndx = gndx0 + gndx1 ∧ ndx0 = gndx0.nds ∧ ndx1 = gndx1.nds)
Type: A user defined theorem
Validity: The proof is valid.
Features: 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: 10
Used lemmas:
Used spec theorems:
Used simplifier rules:
list
/node-list/
app-01
gjournal-base
/
nds-app
gjournal-base
/
nds-base
list
/node-list/
app-02
list
/group-store/
c
groupnode
/
elim
list
/node-list/
in-append
list
/node-list/
in-14
list
/node-list/
Nil
list
/node-list/
in-empty
gjournal-base
/
nds-eq-empty
list
/group-store/
Nil
list
/node-list/
in-rec
list
/node-list/
c-06
list
/group-store/
a
gjournal-base
/
nds-rec
groupnode
/
sel
list
/node-list/
c
list
/node-list/
app-08
list
/node-list/
a