[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-subset
⊦ st ⊆ st1 ∧ junkrefs(str, refs, ty, st1) → junkrefs(str, refs, ty, st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
junkref-subset
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 50
Used lemmas:
junkrefs-array
,
junkrefs-class
,
junkrefs-is-junk
,
junkrefs-null
,
junkrefs-empty
,
Used spec theorems:
addfuns
/
is-valid-ref-stronger-def
store
/javastore/
Subset
store
/javastore/
superset-elem-eq
Used simplifier rules:
okfuns
/
is_array-notin-01
int-abs
/
forward-lels
int-abs
/
lels-03
okfuns
/
is_array-lenfield
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
forward-le-05
okfuns
/
is_array-type-02
okfuns
/
is_array-subset
int-abs
/
lels
int-abs
/
lels-01
javavalue
/
sel-09
addfuns
/
is_obj-notin-01
store
/javastore/
notmemlookup
storefunsx
/
lookup-xtra
fieldspec
/
sel-03
javavalue
/
test-19
javavalue
/
elim-13
fieldspec
/
elim
list
/references/
a
list
/references/
e-01
list-data
/references/
elim-list-c
addfuns
/
is_obj-type
storefuns
/
instore-01
addfuns
/
is_obj-subset
list
/references/
c