[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 bits2int-zero-02
⊦ bits ≠ [] → (bits2int(bits) = 0 ↔ ¬ true ∈ bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
bits2uint-ls
,
bits2uint-one-03
,
bits2uint-split
,
bits2uint-not-zero
,
bits2int-pos
,
bits2ubits
,
bits2int-zero-01
,
Used spec theorems:
int-pot
/
succ
Used simplifier rules:
nat
/
lels-01
nat-basic1
/
ref-1
int-basic1
/
irref
int-mult
/
numeq-03
intnat
/
nat2int
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
one
list-data
/bitlista/
l
list
/bitlista/
app
list-data
/bitlista/
size-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/bitlista/
len-02
list
/bitlista/
len
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-abs
/
sub-eq
list
/bitlista/
c
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
in-append
list
/bitlista/
in-17
list-data
/bitlista/
elim-list-c