[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 13 from proof alloc (conclusion)
⊦ r ≠ null ∧ ¬ r ∈ rs → (R[rs, f, g] ↔ (a[r =>_] * R)[rs ++ r, f, g(r ; a)])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 12
:
⊦ r = null, R[rs, f, g] ↔ (a[r =>_] * R)[rs ++ r, f, g(r ; a)], r ∈ rs
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]