[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 monls-exists-maxls (conclusion)
mon<(nσ), nσ[0] ≤ n, n < nσ[m], ⌜m⌝ < # nσ ⊦ ∃ m0. nσ[m0] ≤ n ∧ n < nσ[m0 + 1] ∧ m0 ≤ m
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⌜m⌝ < # nσ, n < nσ[m], mon<(nσ), nσ[0] ≤ n ⊦ ∃ m0. nσ[m0] ≤ n ∧ n < nσ[m0 + 1] ∧ m0 ≤ m
Rule argument
Additional information