Proof step 5 from proof validval-index-norefval (previous step)

User applied rule insert rewrite lemma

And obtained the following new goals

• Proof step 1:

  ⊦ validval(str, r -- sk, val, st) ↔ (is_fskey(sk) → validval(str, val, sk .fs .type, st) ∧ sk .fs .type ≠ void_type ∧ sk ≠ _length) ∧ (is_indexkey(sk) → validval(str, val, st[r -- _type] .type .type, st))

• Proof step 4:

  ⊦ (is_fskey(i ') → validval(str, val, i ' .fs .type, st) ∧ i ' .fs .type ≠ void_type ∧ i ' ≠ _length) ∧ (is_indexkey(i ') → validval(str, val, st[r -- _type] .type .type, st)) ↔ okval(val, st[r -- _type] .type .type), is_referencevalue(val)

Rule argument

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (st, val, i ', r, str)]]