[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 bitsand-len-true
⊦ bits0.first ∧ # bits0 ≤ # bits ∧ bits0 ≠ [] → # bitsand(bits, bits0) = # bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
band-bitlength
,
band-min-01
,
band-min-02
,
bitsand-cast
,
bitsand-cast-01
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
and-oner-01
,
and-rec
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
ref-1
nat
/
lels
nat-basic2
/
s
nat-basic2
/
eq-01
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
nat-basic1
/
one
nat-basic2
/
oz
nat-basic2
/
one-03
list
/bitlista/
app
nat-basic1
/
lf-01
nat-basic1
/
one-01
list-data
/bitlista/
l
nat-basic1
/
f
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c