[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 11 from proof sgn-notsame (
previous step
)
sgn(bits0) = boolvar0 ' + boolvar0 ', boolvar0 ∈ bits0, ∀ boolvar. ¬ boolvar ∈ bits0 ∨ sgn(bits0) ≠ boolvar ' + boolvar ' ⊦ bits0 = []
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: boolvar0
Additional information
Used terms: boolvar0