[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 fix-value (conclusion)
⊦ # bytes ≤ n ∧ bytes ≠ [] → bytes2int(fix(n, bytes)) = bytes2int(bytes)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
# bytes ≤ n ⊦ bytes = [], bytes2int(fix(n, bytes)) = bytes2int(bytes)
Rule argument
Additional information