[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 13 from proof prefixn-shorter (
previous step
)
prefixn(m + 1, x) = prefixn(m + 1, x0), ∀ n, x1. prefixn(n + 1, x) = prefixn(n + 1, x1) → prefixn(n, x) = prefixn(n, x1) ⊦ prefixn(m, x) = prefixn(m, x0)
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: m, x0
Additional information
Used terms: m, x0