[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 58 from proof inv-inverts-leq (
previous step
)
# nσ = ∞, nσ[n1] = nσ[n], n1 < n, nσ[n] ≤ nσ[m], stutf(nσ), ∀ m. nσ[m] = nσ[n] → ¬ n1 < m, ∀ m0. m < m0 → nσ[m0] = nσ[m] + 1 ⊦
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 6 terms: n
Additional information
Used terms: n