[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 elim-mapped (conclusion)
⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ aleb.mapped? ↔ (∃ buf. aleb = mapped(buf))
Rule argument
spec: aleb name: ex seq: ⊦ aleb.mapped? ↔ (∃ buf. aleb = mapped(buf)) subst: [aleb] → [avol[n]] flags: <all paths>
Additional information
Used terms: avol[n]