[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 next-perm
ar = ar0 ⊦ ⟨next#(; ar; hasNext)⟩ perm(ar, ar0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 36
Used lemmas:
next
,
Used spec theorems:
list-perm
/natarray-oarray-sort/
perm-switch
list-perm
/natarray-oarray-sort/
sym
Used simplifier rules:
list-data
/natarray-oarray-sort/
l
nat
/
lez-01
nat-basic
/
succ
nat-basic
/
zero
nat
/
gr-def
list-perm
/natarray-oarray-sort/
perm-e
nat
/
pred-03
nat
/
le-def
nat-basic
/
one-01
nat
/
ls-01
nat-basic
/
s-04
nat-basic
/
ls-02
nat-basic
/
a
nat-basic
/
c
oelem
/natarray/
irreflexivity
nat
/
ge
oelem
/natarray/
ls-le
nat-basic
/
f
list-perm
/natarray-oarray-sort/
ref
nat
/
fle
oelem
/natarray/
transitivity
nat-basic
/
lf
nat
/
fle-01
nat
/
ls-02
nat
/
succ-01
nat
/
lels
nat
/
anti
array
/natarray/
Size-put
nat
/
ls-le-simp
nat
/
elim-pred-c
nat
/
eqle-one
nat-basic
/
oz
list-del
/natarray-oarray-sort/
put-length
list-perm
/natarray-oarray-sort/
perm-swap
list-del
/natarray-oarray-sort/
get-zero-01
nat-basic
/
less-zero