[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 ordered-append
⊦ ordered≤(arx) ∧ arx.toSet = smallerPerms(ar) → ordered≤(arx + ar ')
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
permut-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
smaller-perms
,
toSet
,
ordered-arraylist-append-last
,
ordered-arraylist-base1
,
ordered-arraylist-base0
,
nil-toSet
,
Used spec theorems:
list
/list-of-natarray/
lastdiv-rew
set-basic
/array-set/
Extension
Used simplifier rules:
list
/list-of-natarray/
Nil
list
/list-of-natarray/
a
list
/list-of-natarray/
in-17
list
/list-of-natarray/
in-append