[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 max-size (conclusion)
⊦ (maxenc(m) * (maxenc(m) + 1)) / 2 ≤ m ∧ m < ((maxenc(m) + 1) * (maxenc(m) + 2)) / 2
User applied rule insert lemma
And obtained the following new goals
Proof step 2
:
⊦ maxenc(m) = n → (n * (n + 1)) / 2 ≤ m ∧ m < ((n + 1) * (n + 2)) / 2
Rule argument
spec: nat-pair inst: name: max-rev-01 seq: ⊦ maxenc(m) = n → (n * (n + 1)) / 2 ≤ m ∧ m < ((n + 1) * (n + 2)) / 2 subst: [m, n] → [m, maxenc(m)] flags: current, []
Additional information
Used terms: m, maxenc(m)