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