[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 uint2bits-sgn-first
⊦ 0 < j → sgn(bitsinvert(uint2bits(j)) +1) ≠ false + bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
uint2bits-onein
,
uint2bits-expos0
,
Used spec theorems:
bitopsaux
/
sgn-first-04
Used simplifier rules:
list
/bitlista/
c-06
bitopsaux
/
succ-prefix
bitopsaux
/
invert-one
bitopsaux
/
invert-zero
list
/bitlista/
in-13
bitopsaux
/
sgn-in-02
list
/bitlista/
e-01
list-data
/bitlista/
elim-list-c
bitopsaux
/
succ-empty-01
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
a
list
/bitlista/
in-14
list
/bitlista/
c