[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 2 from proof append-extract-list (
previous step
)
σ = ⌜x0⌝ , finp(σ) ⊦ (⌜x⌝ + σ).l = x + x0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
⊦ (⌜x⌝ + ⌜x0⌝ ).l = x + x0
Rule argument
Additional information
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)