[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 bint-and-011x-bits2unit
⊦ i ∈bint → (bits2uint(fillsgn(32, int2bits(i))) ≠ band(4294967295, i) ↔ false)
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: 7
Proof steps: 13
Used lemmas:
bint-fillsgn-len
,
bint-band-011x
,
inbint
,
Used spec theorems:
intops
/
band-commutativity
intops
/
band-011x-neg-02
int-div
/
mod-zero-05
int2bits
/
ubits2bits
int2bits
/
bits2int-fill
Used simplifier rules:
int2bits
/
int2int-inj
int-abs
/
numleledel-01
int-basic2
/
add-in
int-basic1
/
lst
bitopsaux
/
fill-empty
int2bits
/
int2bits-not-empty
int2bits
/
int2bits-fillfirst
int2bits
/
int2bits-first-01
int-abs
/
abs-05
int-abs
/
abs-08
int-abs
/
subsub
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
neg-13
int-abs
/
numls-02
int-abs
/
numlsledel-01
int-abs
/
lels
int-abs
/
lels-03
int2bits
/
int2bits-011x
int-abs
/
forward-le-02
int-abs
/
zero-gels-03
int-abs
/
lels-01
int-abs
/
numleledel
int-abs
/
forward-lele
int2bits
/
int2uint-fill