[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 add-ones-grlen-02
⊦ ¬ false ∈ bits ∧ # bits0 ≤ # bits ∧ ¬ bits0.first ∧ bits0 ≠ [] → bitsand(bits, bits0) = bits0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsand-app-ones
,
bitsand-cast
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 18
Used lemmas:
and-rec-02
,
and-rec-01
,
and-rec
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
l
list
/bitlista/
e-02
list
/bitlista/
c-04
list-last
/bitlista/
last-elim
list
/bitlista/
app-01
nat
/
succ-01
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
e-01
list-last
/bitlista/
l-02
nat-basic2
/
one
list
/bitlista/
len
list
/bitlista/
c-06
list-last
/bitlista/
bapp
list
/bitlista/
app-04
list
/bitlista/
a
list
/bitlista/
in-14
list
/bitlista/
c
list-data
/bitlista/
elim-list
list-last
/bitlista/
bin-01
list-last
/bitlista/
b-01
nat-basic1
/
ref-1
nat-basic2
/
s
nat
/
ls-01
list-last
/bitlista/
lb
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls-03
nat
/
fle
nat-basic1
/
f
nat
/
sub-ls
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
Last
bitlista
/
one-02
bitlista
/
one-01
bitlista
/
leone
list-data
/bitlista/
le-one
list
/bitlista/
e
list
/bitlista/
len-02
list
/bitlista/
first
nat
/
lez-01
list-data
/bitlista/
size-01
list-data
/bitlista/
l
nat-basic1
/
one