[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-shift-two
m + 2 < # A ⊦ perm(A[m + 1, a][m + 2, b], A0) → perm(A[m, a][m + 1, b][m + 2, A[m]], A0)
Type: A user defined theorem
Validity: The proof is valid.
Features: lss, ss,
Comment:
Used by:
Used by units in proved state:
pair-insertion-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 34
Used lemmas:
in-mkbag-del-two
,
bag-swap-add
,
bag-del-add
,
in-mkbag-del
,
bag-swap-del
,
mkbag-del-add-content-two
,
mkbag-del-add-content
,
mkbag-update-out-of-bound
,
mkbag-update
,
perm
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
fle
nat-basic
/
l
array
/
cngetput
array
/
Size-put
nat
/
le-def
nat-basic
/
nls-fst
nat
/
ls-le-simp
nat
/
lels
bag-basic
/
bag-add2-eq-elim
bag-union
/
del-rec
nat
/
ler
nat-basic
/
eq-02
nat-basic
/
a
nat-basic
/
c
nat-basic
/
eq-01