[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 sorted-eq-entry
⊦ m0 < m ∧ m1 < m ∧ m ≤ # zbrar ∧ sorted(zbrar, 0, m) ∧ zbrar[m0] = mkzentry(key, adr0) → (zbrar[m1] = mkzentry(key, adr1) ↔ m0 = m1 ∧ adr0 = adr1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
sorted-eq-entry-strong
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
sorted-all
,
Used spec theorems:
Used simplifier rules:
nat
/
fle
nat-basic
/
f
nat
/
le-def
nat
/
le-ls-simp
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
fle-01
zbranch
/
sel-04
oelem
/key-order/
irreflexivity
nat
/
lels
nat
/
anti
nat-basic
/
lf-02
nat
/
ler
zbranch
/
inj-01