[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 19 from proof leq-leninv (
previous step
)
# nσ ≠ ∞, nσ[(# nσ).n - 1] = n1, ⌜n⌝ < # nσ, stutf(nσ), n1 + 1 < nσ[n] ⊦ nσ[n] = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 20
:
⌜n⌝ < # nσ, stutf(nσ), nσ[(# nσ).n - 1] + 1 < nσ[n] ⊦ nσ[n] = 0, # nσ = ∞
Rule argument
Additional information