[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 3 from proof lookup-1init-01 (
previous step
)
∀ r, r0, j, st, sk. r = r0 ∨ (addarray(r, vals0, j, st)[r0 -- sk]) = st[r0 -- sk] ⊦ r = r0, (addarray(r, vals0, j + 1, st)[r0 -- sk]) = st[r0 -- sk]
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
[EXRARG : pos: left 1, [QUANTTERMLIST : (r, r0, j + 1, st, sk)]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (r, r0, j + 1, st, sk)]]