[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 del1-01-02
⊦ a ≠ b ∧ ordered≤(x) → ins≤(a, x -1l b) = ins≤(a, x) -1l b
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
olist-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 16
Used lemmas:
ole-rec
,
ins-y
,
eq
,
ins-n
,
cons-02
,
app-01
,
ins-e
,
Used spec theorems:
list-del
/
del1-n
Used simplifier rules:
list-del
/
del1-e
list-del
/
one-01-01
list-del
/
del1-n
oelem
/
sls
list-del
/
del1-y
list
/
app
list
/
c-04
list
/
c-08
list
/
c-07
list-data
/
elim-list-c
list
/
e-01
list
/
c
list
/
a
list
/
app-08
oelem
/
transitivity
oelem
/
nll