[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 31 from proof byte2bits-val (
previous step
)
0 ≤ n→i(# int2bits(b2i(by))) ∧ 0 ≤ n→i(n), 8 = n + # int2bits(b2i(by)), # int2bits(b2i(by)) ≤ 8, b2i(by) < 0 ⊦ n = 0, 2 ^ n→i(n + # int2bits(b2i(by))) = 256
User applied rule insert equation
And closed the goal!
Rule argument
pos: left 2 flags: rotate, discard
Additional information