[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 32 from proof range-rem-in (
previous step
)
ri-cons(ri, nodes(gstore, ginval)), key ∈ ri, ∃ key. key ∈ ri ∧ ri[key] = adr ⊦ adr = ri[key], adr ∈ ri -- key
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 33
:
ri-cons(ri, nodes(gstore, ginval)), key0 ∈ ri, key ∈ ri ⊦ ri[key0] = ri[key], ri[key0] ∈ ri -- key
Rule argument
Additional information