[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 validrefs-put-notin
⊦ ¬ r ∈ refs → (validrefs(str, refs, ty, st[r -- sk, val]) ↔ validrefs(str, refs, ty, st))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
cyclic-put-nopathex
,
pathex-put-pathex-array-refval
,
validrefs-put-notin-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 53
Used lemmas:
validrefs-null-02
,
validrefs-null-01
,
validrefs-array
,
validrefs-class
,
validrefs-is-junk
,
validrefs-null
,
validrefs-empty
,
Used spec theorems:
addfuns
/
is-valid-ref-stronger-def
Used simplifier rules:
addfuns
/
is_valid_ref-put-01
int-abs
/
forward-lels
int-abs
/
lels-03
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
forward-le-05
okfuns
/
is_array-put-01
int-abs
/
lels
int-abs
/
lels-01
javavalue
/
sel-09
fieldspec
/
sel-03
javavalue
/
test-19
javavalue
/
elim-13
fieldspec
/
elim
list
/references/
in-17
list
/references/
in-append
list
/references/
e-01
list-data
/references/
elim-list-c
addfuns
/
is_obj-put-01
javastore
/
look-ins
list
/references/
app
list
/references/
a
list
/references/
in-06
list
/references/
c