Proof step 42 from proof okarray-subset (previous step)

User applied rule insert rewrite lemma

And obtained the following new goals

• Proof step 1:

  ⊦ okarray(val, ty, i, st) ↔ okreftype(val, mkarraytype(ty), st) ∧ val .refval ≠ jvmref ∧ (val .refval -- _length) × intval(i) ∈ st ∧ 0 ≤ i ∧ is_arrayref(val .refval, i, st) ∧ (∀ j. 0 ≤ j ∧ j < i → oktype(st[val .refval -- j '], ty, st))

• Proof step 41:

  st ⊆ st0, okarray(val, ty, i, st) ⊦ okreftype(val, mkarraytype(ty), st0) ∧ val .refval ≠ jvmref ∧ (val .refval -- _length) × intval(i) ∈ st0 ∧ 0 ≤ i ∧ is_arrayref(val .refval, i, st0) ∧ (∀ j. 0 ≤ j ∧ j < i → oktype(st0[val .refval -- j '], ty, st0))

Rule argument

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (st0, i, ty, val)]]