[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 3 from proof uint2bits-2potrec (
previous step
)
0 ≤ i, 2 ^ i < j ⊦ uint2bits(j % 2 ^ i) = sgn(false ' + lastn(i→n(i), uint2bits(j).rest))
Lemma
uint2bits-mod2pot