[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 22 from proof uint2bits-add-high-02 (
previous step
)
⊦ bits ≠ [] → sgn(fillsgn(n, bits)) = sgn(bits)
A spec-lemma