[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 367 from proof bitsand-cast (
previous step
)
⊦ true ∈ bits ∧ false ∈ bits → (∃ boolvar, n, boolvar0, bits0. bits = mklist(boolvar, n) + (boolvar0 + bits0) ∧ sgn(bits) = boolvar + boolvar0 + bits0 ∧ ¬(boolvar ↔ boolvar0) ∧ n ≠ 0)
A spec-lemma