[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 newref-1init (
previous step
)
∀ r0, r, j, st. newref(r0, addarray(r, vals0, j, st)) ↔ r ≠ r0 ∧ newref(r0, st) ⊦ r0 ≠ r ∧ newref(r0, addarray(r, vals0, j + 1, st)) ↔ r ≠ r0 ∧ newref(r0, st), vals0 = []
User applied rule all left
And closed the goal!
Rule argument
[EXRARG : pos: left 1, [extquanttermlist: (r0, r, j + 1, st) abort:F , discard:T , computed:T ]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (r0, r, j + 1, st)]]