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