[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 mininv-inverts-inner (conclusion)
⊦ mon<(nσ) ∧ ⌜n⌝ < # nσ → min(nσ, nσ[n]) = n
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
mon<(nσ), ⌜n⌝ < # nσ ⊦ min(nσ, nσ[n]) = n
Rule argument
Additional information