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