[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-lastn
⊦ n = # bits0 + 1 → lastn(n, sgn(bits + boolvar ') + bits0) = boolvar ' + bits0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
sgn-last-same
,
sgn-last-04
,
Used spec theorems:
list-del
/bitlista/
lastN-all
list
/bitlista/
a
list-del
/bitlista/
lastN-append
Used simplifier rules:
list
/bitlista/
len
list
/bitlista/
len-02
list
/bitlista/
a
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c