[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 okbar-nopath
⊦ r ≠ r0 ∧ okbytearray(r, st) → ¬ path∃(str, r, r0, st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 12
Used lemmas:
validrefs-array
,
pathex-def
,
Used spec theorems:
okfuns
/
okbytearray-01
Used simplifier rules:
okfuns
/
okbar-norefval
javavalue
/
elim-13
int-abs
/
forward-le-01
int-abs
/
forward-le-05
list-last
/references/
l-02
list-last
/references/
l
list
/references/
app
okfuns
/
is_array-okarray
okfuns
/
is_array-typele
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c