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