[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 13 from proof lsucc-01 (
previous step
)
⊦ 2 * n + 1 < 4 * 2 ^ log2 n, log2(2 * n + 1) = log2 n + 1, n = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 14
:
⊦ log2(2 * n + 1) = log2 n + 1, n = 0, 2 * n + 1 < 4 * 2 ^ log2 n
Rule argument
Additional information