[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 getarray-union
⊦ ¬ r ∈ st → getarray(r, i, j, st ∪ st0) = getarray(r, i, j, st0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
getbar-union-01
,
getbar-union-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
getArray-zero
,
getarray-offset-02
,
Used spec theorems:
storefunsx
/
union-at-right-02
Used simplifier rules:
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
zero-gels-04
list
/javavalues/
a
list
/javavalues/
app-01
int-basic2
/
ax-04
int-abs
/
numsub
int-abs
/
lels-01
int-abs
/
lels-04
storefuns
/
instore-01
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
elim-sub
int-abs
/
lels