[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 short-size-01 (
previous step
)
n→i(# int2bits(s2i(sho))) - 1 = n→i(# int2bits(s2i(sho)) - 1), 32768 < 2 ^ (n→i(# int2bits(s2i(sho))) - 1) ⊦ # int2bits(s2i(sho)) = 1
User applied rule insert equation
And closed the goal!
Rule argument
pos: left 1 flags: discard
Additional information
Used simplifier rules: short-size: ⊦ ¬ 32768 < 2 ^ n→i(# int2bits(s2i(sho)) - 1);