[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
,
Theorem uint2bits-rec
⊦ 1 < i → uint2bits(i) = uint2bits(i / 2) + (i % 2 = 1)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-len-one
,
int2bits-rec-pos
,
int2bits-rest
,
ubits2ubits-def
,
uint2bits-2pot-01
,
uint2bits-div2pot
,
uint2bits-pos-num
,
uint2bits-pred
,
uint2bits-rec-01
,
uint2bits-succ
,
Used by units in proved state:
Proof exists?: No