[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 1 from proof sgn-append (conclusion)
⊦ ¬ (¬ boolvar) ∈ bits → sgn(boolvar ' + bits + bits0) = sgn(boolvar ' + bits0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ sgn(boolvar ' + bits + bits0) = sgn(boolvar ' + bits0), (¬ boolvar) ∈ bits
Rule argument
Additional information