[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 shiftzero-not-neg
⊦ 0 ≤ i ∨ j ≠ 0 → ¬ >>>(n, i, j) < 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
longshiftzero-not-neg-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
shiftright-not-neg
,
shiftrzero-def-01
,
shiftzero-pos
,
Used spec theorems:
int2bits
/
bits2int-lez
list-del
/bitlista/
sublist-def
list-del
/bitlista/
firstn-first
list-last
/bitlista/
mk-first
Used simplifier rules:
list
/bitlista/
app-02-ant
list-last
/bitlista/
mk-empty
intnat
/
abs-zero
list
/bitlista/
a
list-del
/bitlista/
restN-zero
list-del
/bitlista/
sublist-empty
list-data
/bitlista/
l
bitopsaux
/
fill-empty
int2bits
/
int2bits-not-empty
int-abs
/
lels-03
int-abs
/
lels-01
int-abs
/
forward-le-02