[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 35 from proof okarray-substore (previous step)

st[r -- _type] = typeval(mkarraytype(ty0)), st0[r -- _type] = typeval(mkarraytype(ty0)), st[r -- _length] = intval(i), r ∈ st0, r -- _type ∈ st0, r ∈ st, 0 ≤ i, r -- _length ∈ st, ty0 ≤ ty, r -- _type ∈ st, is_arrayref(r, i, st), ∀ j. ¬ j < 0 ∧ ¬ i ≤ j → oktype(st[r -- j '], ty, st), ∀ rk. rk ∈ st → rk ∈ st0 ∧ st[rk] = st0[rk] ⊦ r = jvmref, (0 ≤ j ∧ j < i → oktype(st0[r -- j '], ty, st0)) ∧ is_arrayref(r, i, st0) ∧ st0[r -- _length] = intval(i) ∧ r -- _length ∈ st0

User applied rule all left

And obtained the following new goals

Proof step 34:
st[r -- _type] = typeval(mkarraytype(ty0)), st0[r -- _type] = typeval(mkarraytype(ty0)), st[r -- _length] = intval(i), r ∈ st0, r -- _type ∈ st0, r ∈ st, 0 ≤ i, r -- _length ∈ st, ty0 ≤ ty, r -- _type ∈ st, is_arrayref(r, i, st), ∀ j. ¬ j < 0 ∧ ¬ i ≤ j → oktype(st[r -- j '], ty, st), r -- _length ∈ st → r -- _length ∈ st0 ∧ st[r -- _length] = st0[r -- _length], ∀ rk. rk ∈ st → rk ∈ st0 ∧ st[rk] = st0[rk] ⊦ r = jvmref, (0 ≤ j ∧ j < i → oktype(st0[r -- j '], ty, st0)) ∧ is_arrayref(r, i, st0) ∧ st0[r -- _length] = intval(i) ∧ r -- _length ∈ st0

Rule argument

[EXRARG : pos: left 13, [extquanttermlist: (r -- _length) abort:F , discard:F , computed:T ]]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (r -- _length)]]