[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 violations-exists
n + 1 < # x ⊦ x[n + 1] < x[n] → violations(x) ≠ 0
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
violations-swap
,
Used by units in proved state:
odd-even-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 11
Used lemmas:
less-rec
,
violations-rec
,
Used spec theorems:
list-del
/
get-rec
Used simplifier rules:
nat-basic
/
f
nat-basic
/
l
nat-basic
/
succ
list
/
len-05
list-del
/
get-succ
list-del
/
get-zero-01
list-del
/
get-zero
list-data
/
l
nat-basic
/
zero
nat-basic
/
lf-02
list
/
c
nat-basic
/
z-01
list-data
/
elim-list-c
list
/
c-07
list
/
a
list
/
e-01
nat
/
elim-pred-c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz