[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 1 from proof hash-given (
previous step
)
⊦ inv(T, h) ↔ # T = SIZE ∧ (∀ a. h(a) < SIZE) ∧ (∀ n, a. n < # T ∧ T[n] = full(a) → h(a) = n)
Lemma
inv