[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 intshiftleft-is-mult (
previous step
)
0 < 32 ∧ 0 ≤ j ∧ j < 32, j < 32, 0 ≤ j ⊦ bits2int(int2bits(i) + mklist(false, i→n(j))) = i * 2 ^ j
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 12
:
j < 32, 0 ≤ j ⊦ bits2int(int2bits(i) + mklist(false, i→n(j))) = i * 2 ^ j
Rule argument
Additional information