[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-greaterPerms
⊦ nextperm(ar1, ar2) → greaterPerms(ar1) = greaterPerms(ar2) ++ ar2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
permut-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
array-neg-le-eq
,
array-neg-le-eq-2
,
array-le-trans
,
greater-perms
,
next-permutation
,
Used spec theorems:
set-basic
/array-set/
Extension
list-perm
/natarray-oarray-sort/
trans
list-perm
/natarray-oarray-sort/
sym
Used simplifier rules:
set-basic
/array-set/
In-insert
list-perm
/natarray-oarray-sort/
neq
list-perm
/natarray-oarray-sort/
trans
list-perm
/natarray-oarray-sort/
ref