[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
,
Proof step 119 from proof pseq-sym-01 (
previous step
)
⊦ cyclic(str, r0, st) ∧ is_array(str, r, st) ∧ st[r -- i '] = refval(r0) ∧ 0 ≤ i ∧ i < st[r -- _length] .intval ∧ is_reftype(st[r -- _type] .type .type) ∧ st[r0 -- _type] .type ≤ st[r -- _type] .type .type → cyclic(str, r, st)
A spec-lemma