[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 split-prefix-append-to (conclusion)
⊦ # σ0 = ∞ → ((σ0 to n) + σ1 = σ0 ↔ σ1 = σ0 from n)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# σ0 = ∞ ⊦ (σ0 to n) + σ1 = σ0 ↔ σ1 = σ0 from n
Rule argument
Additional information