[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
⊦ sort(x -1l a) = sort(x) -1l a
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
Ordered
,
rec
,
empty
,
Used spec theorems:
list-del
/
del1-n
olist
/
del1-01-02
Used simplifier rules:
list-del
/
del1-e
list
/
c
list-del
/
del1-y
olist
/
del1-02
list
/
a