[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 18 from proof inv-get-lslen (
previous step
)
# nσ ≠ ∞, nσ[(# nσ).n - 1] = n1, max∞(λ n0. ⌜n0⌝ < # nσ ∧ nσ[n0] = n) = ∞, stutf(nσ), n ≤ n1 ⊦ ⌜∞.n⌝ < # nσ
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 19
:
max∞(λ n0. ⌜n0⌝ < # nσ ∧ nσ[n0] = n) = ∞, stutf(nσ), n ≤ nσ[(# nσ).n - 1] ⊦ # nσ = ∞, ⌜∞.n⌝ < # nσ
Rule argument
Additional information