[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-swap
m < # A, m0 < # A ⊦ perm(A[m0, A[m]][m, A[m0]], A0) ↔ perm(A, A0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
sort-invariants
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
mkbag-del-add-content
,
mkbag-update
,
perm
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
bag-union
/
del-rec
array
/
Size-put
array
/
Put-other
nat
/
ler
nat
/
lels
nat
/
ls-le-simp
array
/
putgetinv