[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 7 from proof hash-given (conclusion)
⊦ inv(T, h) ∧ T[h(b)] = full(a) → h(a) = h(b)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
T[h(b)] = full(a), inv(T, h) ⊦ h(a) = h(b)
Rule argument
Additional information
[Concretesimprules(())]