[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 perm-ins
⊦ perm((x + ins≤(a, y)) -1l a, z) ↔ perm(x + y, z)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 6
Used lemmas:
del1-02
,
in-04
,
insperm-01
,
Used spec theorems:
list-perm
/
perm-del
list-del
/
app
Used simplifier rules:
list-perm
/
app
list-perm
/
trans
list-perm
/
sym-01
list-perm
/
sym-02
list-perm
/
app-02
list-perm
/
ref
list
/
a
list-del
/
app-01