[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 junkrefs-delete
⊦ junkrefs(str, refs, ty, st -- r) ∧ ¬ r ∈ refs → junkrefs(str, refs, ty, st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
junkrefs-delete-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 32
Used lemmas:
junkrefs-class
,
junkrefs-array
,
junkrefs-is-junk
,
junkrefs-null
,
junkrefs-empty
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
forward-le-05
okfuns
/
is_array-del
int-abs
/
lels
int-abs
/
lels-01
addfuns
/
is_valid_ref-isarray
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-del
storefuns
/
look-del
addfuns
/
is_obj-isarray
addfuns
/
is_valid_ref-01
list
/references/
a
list
/references/
in-06
list
/references/
c