[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 122 from proof byte-law-righthift-not (
previous step
)
⊦ n ≠ 0 → firstn(n, boolvar ' + bits) = boolvar ' + firstn(n -1, bits)
A spec-lemma