[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 stutf-def
⊦ stutf(nσ) ↔ nσ ≠ [] ∧ nσ[0] = 0 ∧ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n + 1] = nσ[n] ∨ nσ[n + 1] = nσ[n] + 1)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-get-inverse-between
,
inv-get-inverse-succ
,
leninv-succ
,
not-stutf-empty
,
stutf-alltaken
,
stutf-alltakenmax
,
stutf-monle
,
stutf-notbig
,
stutf-slowincrease
,
stutf-zero
,
Used by units in proved state:
Proof exists?: No