[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 1 from proof to-adrs-one (conclusion)
⊦ ladr '.to-adr(n) = @(n, ladr.off, ladr.size) '
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ ladr ' = ladr + []
Proof step 3
:
⊦ (ladr + []).to-adr(n) = @(n, ladr.off, ladr.size) '
Rule argument
spec: list, inst: laddress-list name: One seq: ⊦ ladr ' = ladr + [] subst: [ladr] → [ladr] flags: <all paths>
Additional information
Used terms: ladr