[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 num-i2l-pos (conclusion)
9223372036854775807 < i ⊦ i2l((* i)) = i2l(bits2int(lastn(64, int2bits(i))))
Special step normalize
And obtained the following new goals
Proof step 2
:
9223372036854775807 < i ⊦ i2l(i) = i2l(bits2int(lastn(64, int2bits(i))))