[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-rec
⊦ valid-group-nodes(gndx + gnd ') = (gnd.end ⊃ # gndx + 1;valid-group-nodes(gndx))
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
nodes-append-subseteq
,
valid-group-nodes-app-transaction
,
valid-group-nodes-app-transaction-prefix
,
valid-group-nodes-drop-superfluous-prefixn
,
valid-group-nodes-entire
,
valid-group-nodes-last-end
,
valid-group-nodes-ls
,
valid-group-nodes-prefixn-append-nonend
,
valid-group-nodes-shorter-prefix
,
valid-group-nodes-shorter-prefix-right
,
Used by units in proved state:
gjournal-refine
,
Proof exists?: No