[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 totality
⊦ key < key0 ∨ key = key0 ∨ key0 < key
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment: |- a < b or a = b or b < a
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
Used spec theorems:
string-less
/
val-total
Used simplifier rules:
key
/
test-05
key
/
test-08
key
/
inj-03
key
/
sel-05
key
/
inj-02
nat-basic
/
neq-01
key
/
disj-01
key
/
test-04
key
/
disj-03
key
/
sel-03
key-order-def
/
datakey-less
key
/
test-03
key
/
test-09
key
/
disj-02
key
/
sel-04
key-order-def
/
inode-less
key
/
test-06
nat
/
lels-02
nat
/
ler
key
/
inj-01
nat
/
anti
nat
/
lels
key
/
test-07
key
/
sel-01
key
/
test-01
key-order-def
/
dentrykey-less
key
/
sel-02