[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 19 from proof sgn-last-diff (
previous step
)
⊦ (¬ boolvar)' = sgn((¬ boolvar)' + bits0), boolvar ∈ bits0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 20
:
¬ (¬ boolvar) ∈ bits ⊦ sgn(boolvar ' + bits) = boolvar '
Rule argument
name: sgn-in rotate: F subst: [bits, boolvar] → [bits0, ¬ boolvar]
Additional information
Used terms: bits0, ¬ boolvar