[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
,
Theorem sgn-append-03
⊦ ¬ boolvar ∈ bits ∧ bits ≠ [] → sgn(bits + bits0) = sgn((¬ boolvar)' + bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
sgn-append-04
,
sgn-append-05
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 20
Used lemmas:
sgn-rec
,
sgn-base-01
,
sgn-base-02
,
sgn-one
,
sgn-rec-01
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
in-14
list-data
/bitlista/
elim-list-c
list
/bitlista/
first-01
list
/bitlista/
c-04
list
/bitlista/
app
list
/bitlista/
app-02-ant
list
/bitlista/
in-empty
list
/bitlista/
Nil
list
/bitlista/
in-06
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c