[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 4 from proof extensionality-to (
previous step
)
# σ0 = # σ1, ∀ n. ¬ # σ1 < ⌜n⌝ → σ0 to n = σ1 to n ⊦ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
# σ0 = # σ1, ⌜n⌝ < # σ1, ∀ n. ¬ # σ1 < ⌜n⌝ → σ0 to n = σ1 to n ⊦ σ0[n] = σ1[n]
Rule argument
Additional information