[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
,
Proof step 15 from proof transaction-prefix-is-transaction-prefix (
previous step
)
⊦ # gndx ≤ n → prefixn(n, gndx + gndx0) = gndx + prefixn(n - # gndx, gndx0)
A spec-lemma