[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 divide-list-at-value
⊦ ∃ ints0, ints1. perm(ints, ints0 + ints1) ∧ (ints0 = [] ∨ max(ints0) ≤ j) ∧ (ints1 = [] ∨ j < min(ints1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-fac
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 18
Used lemmas:
max-rec
,
max-one
,
min-rec
,
min-one
,
Used spec theorems:
int-min
/
Min-right
int-min
/
Max-left
Used simplifier rules:
list-perm
/intlista/
empty-01
list
/intlista/
Nil
list-perm
/intlista/
c
int-min
/
Min-left
int-min
/
min-a
int-min
/
min-c
int-abs
/
lels
int-abs
/
forward-lels
list
/intlista/
app
int-abs
/
lels-01
list
/intlista/
e-01
list-perm
/intlista/
a
list
/intlista/
a
list
/intlista/
c
int-abs
/
lels-03
int-min
/
Max-right
int-min
/
max-a
int-min
/
max-c
int-abs
/
lenls