[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 10 from proof update-index-shift (
previous step
)
# ax0 = # kx0, ∀ ax, ri, key, adr. # ax = # kx0 → ri[key, adr][kx0, ax] = ri[kx0, ax][key, adr] ∨ key ∈ kx0 ⊦ ri[key0, adr0][key, adr][kx0, ax0] = ri[key0, adr0][kx0, ax0][key, adr], key0 = key, key ∈ kx0
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: ax0, ri[key0, adr0], key, adr
Additional information
Used terms: ax0, ri[key0, adr0], key, adr