[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 keyset-xchg
m ≤ # kar ⊦ n0 < m ∧ n1 < m ∧ kar[n0] = ki1 ∧ kar[n1] = ki0 → keyset(kar[n0, ki0][n1, ki1], m) = keyset(kar, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 15
Used lemmas:
keyset-overwrite-add
,
keyset-rec
,
keyset-base
,
key-set-write-other
,
Used spec theorems:
array
/key-index-array/
cputput-reverse
Used simplifier rules:
nat
/
fle
nat
/
lez
nat-basic
/
s-04
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
array
/key-index-array/
cgetput
nat
/
ls-le-simp
nat
/
anti
nat-basic
/
neq-01
nat-basic
/
ls-02
nat
/
lels
nat-basic
/
f
array
/key-index-array/
Put-same
nat
/
ler
array
/key-index-array/
Size-put
nat-basic
/
succ
nat-basic
/
lf
nat
/
lels-02
array
/key-index-array/
Put-other
nat
/
lels-03