[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-first-04
⊦ j < 0 → ¬ uint2bits(~ j).first
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
int2bits-rec-2pot-neg-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
uint2bits-first-01
,
uint2bits-onein-01
,
uint2bits-empty-01
,
Used spec theorems:
Used simplifier rules:
list-data
/bitlista/
elim-list-c
list
/bitlista/
a
list
/bitlista/
in-14
list
/bitlista/
c
int-abs
/
negle-07
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-01
int-basic1
/
ls-01