[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 sorted-2
m ≤ # ar, m - n = 2, ar[n] ≤ ar[n + 1] ⊦ sorted(ar, n, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
sorted
,
less-eq-elem
,
Used spec theorems:
Used simplifier rules:
nat
/
lep
nat-basic
/
a
nat-basic
/
c
nat
/
l-num-01
nat-basic
/
s-04
nat
/
lels
nat
/
anti
nat
/
le-def
nat
/
fle
nat-basic
/
lf
nat-basic
/
trans
nat-basic
/
f
nat-basic
/
succ
nat-basic
/
l-05
nat
/
elim-sub