[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 fill-in
⊦ bits ≠ [] → (boolvar ∈ fillsgn(n, bits) ↔ boolvar ∈ bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int2bits
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
fill-fill
,
fillsgn-longer
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
ls-02
list
/bitlista/
in-12
list
/bitlista/
a
list
/bitlista/
in-append
nat
/
lels-03
list-last
/bitlista/
mk-elem
list-last
/bitlista/
mk-in
nat
/
zero-01
list
/bitlista/
in-08
nat-basic1
/
f
nat
/
lels-01