[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 putarray-subset-new-01
⊦ ¬ r ∈ st → (st ⊆ putArray(vals, r, i, st0) ↔ st ⊆ st0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
putarray-subset-new
,
putbytearray-subset-new-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
putArray-in
,
putar-inref
,
putar-atref
,
Used spec theorems:
store
/javastore/
Subset
Used simplifier rules:
store
/javastore/
subset-elem-eq-02
store
/javastore/
superset-elem-in-01
refkey
/
elim
int-abs
/
lels
int-abs
/
lels-01
storekey
/
test
storefuns
/
instore-01