Proof step 9 from proof initundone-05 (conclusion)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 1:

  ⊦ initundone(class1, st) ↔ ¬ ¬ ( (jvmref -- mkfs(class1, void_type, `initstate' .field) ') × initval(undone) ∈ st ∨ ¬ jvmref -- mkfs(class1, void_type, `initstate' .field) ' ∈ st ∧ _uninit ∈ st)

• Proof step 8:

  init(st) ⊦ (¬ jvmref -- mkfs(class1, void_type, `initstate' .field) ' ∈ st ∨ st[jvmref -- mkfs(class1, void_type, `initstate' .field) '] ≠ initval(undone)) ∧ (jvmref -- mkfs(class1, void_type, `initstate' .field) ' ∈ st ∨ ¬ _uninit ∈ st)

Rule argument

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ rk × val ∈ st ↔ rk ∈ st ∧ st[rk] = val])]]