[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 bitsor-mklist-in
⊦ n ≠ 0 ∧ bits0 ≠ [] → (boolvar ∈ bitsor(mklist(boolvar0, n) + bits, bits0) ↔ boolvar ∈ bitsor(boolvar0 ' + bits, bits0))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsor-sgn-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 34
Used lemmas:
bitsor-onel
,
or-rec-04
,
bitsor-zerol
,
or-rec-03
,
or-rec-02
,
or-rec-01
,
or-rec
,
Used spec theorems:
Used simplifier rules:
list-last
/bitlista/
last-def
list-last
/bitlista/
last-01
list-last
/bitlista/
butlast-def
nat
/
add-num-03
nat-basic2
/
one-03
list-last
/bitlista/
lapp
list-last
/bitlista/
bapp
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
nat-basic2
/
oz
nat
/
elim-pred-c
nat-basic2
/
z
list-data
/bitlista/
size-01
list-last
/bitlista/
mk-last-01
list-last
/bitlista/
mk-butlast-01
nat-basic2
/
one
list
/bitlista/
Last
list
/bitlista/
in-17
list
/bitlista/
in-06
list
/bitlista/
in-10
list-last
/bitlista/
mk-in
list
/bitlista/
e-01
list-last
/bitlista/
mk-elem
list
/bitlista/
in-append
list
/bitlista/
e
list
/bitlista/
c-04
list
/bitlista/
len-02
bitlista
/
one-01
list-last
/bitlista/
mk-empty
list
/bitlista/
app-02-ant
list-last
/bitlista/
mklist-one
list
/bitlista/
app
list-data
/bitlista/
l
nat-basic2
/
one-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
z-01
nat-basic1
/
one
list
/bitlista/
a
list-last
/bitlista/
mk-len
list
/bitlista/
len