[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-true-mklist
⊦ 0 < i → sgn(true ' + mklist(false, i→n(i)) + bits) = true ' + mklist(false, i→n(i)) + bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int2bits
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
sgn-one
,
sgn-base-03
,
Used spec theorems:
list-last
/bitlista/
mk-first
Used simplifier rules:
list-last
/bitlista/
mk-zero
list
/bitlista/
Nil
list
/bitlista/
app
list
/bitlista/
c-04
intnat
/
abs-zero
list-last
/bitlista/
mk-empty
list
/bitlista/
app-02-ant
int-abs
/
forward-le-05
list
/bitlista/
a