[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-swap
n + 1 < # x ⊦ x[n + 1] < x[n] → violations(x[n, x[n + 1]][n + 1, x[n]]) = violations(x) - 1
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
odd-even-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 17
Used lemmas:
less-same
,
less-rec
,
violations-rec
,
violations-exists
,
Used spec theorems:
list-del
/
get-rec
list-del
/
put-rec-02
list-del
/
put-rec
Used simplifier rules:
list-data
/
l
nat-basic
/
zero
list-del
/
get-zero-01
list-del
/
get-zero
nat-basic
/
lf-02
list-data
/
elim-list-c
nat-basic
/
l
nat-basic
/
succ
list
/
len-05
list-del
/
get-succ
list-del
/
put-zero
oelem
/
ls-le
nat-basic
/
add-base
nat-basic
/
eq-01
nat
/
elim-pred-c
nat-basic
/
oz
list
/
c
list-del
/
put-succ
list
/
e-01
nat
/
add-num-03
nat
/
ls-le-simp
nat
/
lels
nat
/
add-01
nat
/
pred-03
list
/
c-07
list
/
a
list
/
c-08
nat
/
le-def
nat
/
eqle-one
nat-basic
/
a
nat-basic
/
c
nat-basic
/
f
nat
/
le-add
nat
/
eq-02