[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 revertedelems-notorderedle
⊦ a < b → ¬ ordered≤(x + b ' + y + a ' + z)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
revertedelems-notorderedle-1
,
revertedelems-notorderedle-2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
orderedle-all
,
Used spec theorems:
Used simplifier rules:
list
/
a
nat-basic
/
c
nat-basic
/
a
nat-basic
/
succ
list
/
len-05
list
/
len
nat
/
lep
nat-basic
/
l
nat-basic
/
one
nat
/
add-num-03
list-del
/
get-append-grt-02
list-del
/
get-succ
list-del
/
get-app