[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 11 from proof to-unwind-end (
previous step
)
m < # x ⊦ (x to m) + x[m] ' = x to m + 1, ⌜a '⌝ + ⌜x⌝ = [], x = []
User applied rule insert lemma
And obtained the following new goals
Proof step 12
:
m < # x ⊦ x to m + 1 = (x to m) + x[m] '
Rule argument
spec: inst: name: to-unwind-end-fin seq: m < # x ⊦ x to m + 1 = (x to m) + x[m] ' subst: [m, x] → [m, x] flags: current, []
Additional information
Used terms: m, x