[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 43 from proof leninv-inf (
previous step
)
# nσ = ∞, stutf(nσ), ∀ m. ∃ m0. m < m0 ∧ nσ[m] < nσ[m0] ⊦ ∃ m0. nσ[m0] = nσ[m] + 1
User applied rule all left
And obtained the following new goals
Proof step 44
:
# nσ = ∞, stutf(nσ), ∃ m0. m < m0 ∧ nσ[m] < nσ[m0] ⊦ ∃ m0. nσ[m0] = nσ[m] + 1
Rule argument
pos: left 3 terms: m abort: F discard: T computed: F
Additional information
Used terms: m