[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 ex-validrefs-fits
validrefs(str, refs, ty, st), refs ≠ [] ⊦ ∃ sks. fits(refs .first, sks, st) ∧ st[refs .first -- sks] .refval = refs .last
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
disjoint-def-fits
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
ex-validrefs-fits-stronger
,
Used spec theorems:
list-del
/references/
get-last2
Used simplifier rules:
list-last
/references/
l-02
list-data
/references/
size-01
list-data
/storekeys/
l
list
/references/
app
list-last
/references/
l
storefuns
/
lookup-empty
javavalue
/
sel-09
list-del
/storekeys/
first-all-01
nat-basic1
/
ref-1
list-data
/references/
l
nat
/
lels-01
nat-basic1
/
z
list
/references/
c-08
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
list
/references/
len-02
list
/references/
len
list
/references/
app-02-ant
list
/references/
e
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c