[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 1 from proof prefix-prefixn-exact (conclusion)
n = # x0 ⊦ x0 ⊑ x1 → prefixn(n, x1) = x0
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n = # x0, x0 ⊑ x1 ⊦ prefixn(n, x1) = x0
Rule argument
Additional information