Proof step 42 from proof validval-putrkvs (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 41:

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

Rule argument

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (st[rkvs], val, sk, r, str)]]