[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 11 from proof lsucc-01 (
previous step
)
n < 2 ^ log2 n ⊦ n < 2^ log2 n, n = 0, log2(2 * n + 1) = log2 n + 1
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 12
:
⊦ 2^ m = 2 ^ m
Rule argument
spec: inst: name: pot2-def seq: ⊦ 2^ m = 2 ^ m subst: [m] → [log2 n] flags: rewrite, current
Additional information
Used terms: log2 n