[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 8 from proof adr-in-ri-notin-nodes (
previous step
)
key ∈ ri, ∀ key0. key0 ∈ ri → ri[key0] ∈ gstore ∧ ¬ ri[key0].lnum ∈ ginval ∧ key-cons(key0, nodes(gstore, ginval)[ri[key0]]) ⊦ ri[key] ∈ gstore ∧ ¬ ri[key].lnum ∈ ginval
User applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: key abort: F discard: T computed: T
Additional information
Used terms: key