[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 6 from proof weakmon-lem (
previous step
)
m0 ≤ m, ∀ m. ii(m) ≤ ii(m0), ∀ n. ii(n) ≤ ii(n + 1) ⊦ ii(m) = ii(m0), ∃ m. n ≤ ii(m)
User applied rule weakening
And obtained the following new goals
Proof step 7
:
m0 ≤ m, ∀ m. ii(m) ≤ ii(m0), ∀ n. ii(n) ≤ ii(n + 1) ⊦ ii(m) = ii(m0)
Rule argument
poslist: right 2
Additional information