[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 16 from proof split-del (
previous step
)
str ∈ sdt, p0 ∈ sdt[str], ∀ tree, q. p0 ∈ tree → tree -- (p0 + q) = tree[p0, tree[p0] -- q] ∨ q = ε ⊦ dnode(md, sdt[str, sdt[str] -- (p0 + q)]) = dnode(md, sdt[str, sdt[str][p0, sdt[str][p0] -- q]]), q = ε
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: sdt[str], q abort: F discard: F computed: T
Additional information
Used terms: sdt[str], q