[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 get-append3-fin (conclusion)
⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝
Proof step 3
:
⊦ (⌜x⌝ + ⌜x0 + x1⌝ )[m] = (x + x0 + x1)[m]
Rule argument
spec: stream inst: name: append-finfin seq: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ subst: [y, x] → [x1, x0] flags: rewrite, current
Additional information
Used terms: x1, x0