[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 10 from proof append-assoc (
previous step
)
⊦ (⌜x⌝ + ⌜x0⌝ ) + ⌜nf⌝ = ⌜x⌝ + ⌜λ n. (n < # x0 ⊃ x0[n];nf(n - # x0))⌝
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 11
:
⊦ (⌜x⌝ + ⌜x0⌝ ) + ⌜nf⌝ = ⌜x⌝ + ⌜λ n. (n < # x0 ⊃ x0[n];nf(n - # x0))⌝
Rule argument
Additional information