[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 less-leninv (conclusion)
⊦ stutf(nσ) ∧ # nσ = ∞ ∧ nσ[n + 1] = nσ[n] + 1 → (¬ ⌜nσ[n]⌝ < leninv(nσ) ↔ false)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
# nσ = ∞, nσ[n + 1] = nσ[n] + 1, stutf(nσ) ⊦ ⌜nσ[n]⌝ < leninv(nσ)
Rule argument
Additional information