[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-first
⊦ bits0 ≠ [] → bitsor(true ' + bits, bits0) ≠ false ' + bits1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bitsor-bi-sgn
,
bitsor-first-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 21
Used lemmas:
bitsor-empty
,
or-rec-03
,
or-rec-02
,
or-rec-01
,
or-rec
,
Used spec theorems:
list-last
/bitlista/
splitlasteq
Used simplifier rules:
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bitlista/
e-01
list-last
/bitlista/
l-in
list
/bitlista/
inapp-07
list
/bitlista/
in-empty
list
/bitlista/
c-05
list
/bitlista/
e-02
list-last
/bitlista/
last-elim
list
/bitlista/
in-15
list-last
/bitlista/
l-02
list-last
/bitlista/
bapp
nat-basic2
/
one
list
/bitlista/
Last
list
/bitlista/
app
bitlista
/
one-01
bitlista
/
one-02
list
/bitlista/
e
list
/bitlista/
c-06
list
/bitlista/
app-02-ant
list
/bitlista/
c-03
list-data
/bitlista/
l
nat-basic2
/
one-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
one
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
a
list
/bitlista/
in-14