[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 25 from proof long-shiftzero-in (
previous step
)
l2i(lo) = ~1, 0 < >>>(64, ~1, band(j, 63)), 9223372036854775807 < >>>(64, ~1, band(j, 63)), 64 < # int2bits(~1), 0 < band(j, 63) ⊦
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 26
:
⊦ i + 1 = 0 → int2bits(i) = true '
Rule argument
seq: ⊦ i + 1 = 0 → int2bits(i) = true ' subst: [i] → [~1] rotate: F spec: int2bits inst: name: int2bits-mone
Additional information
Used simplifier rules: ⊦ # boolvar ' = 0 +1; Used terms: ~1