[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 appins
⊦ sort(x + ins≤(a, y)) = ins≤(a, sort(x + y))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
ole
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
Ordered
,
perm
,
Used spec theorems:
olist
/
eqdef
list-perm
/
perm-l
Used simplifier rules:
list
/
c
olist
/
insperm-03
olist
/
ole-01
list-perm
/
ref
list-perm
/
app
olist
/
perm-ins
list-perm
/
sym-02
list
/
a
olist
/
in-04
list
/
in-append