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