[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-zero-01 (conclusion)
⊦ maxenc(m) = 1 ↔ m = 1 ∨ m = 2
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ maxenc(n) = maxenc(0, n)
Proof step 3
:
⊦ maxenc(0, m) = 1 ↔ m = 1 ∨ m = 2
Rule argument
spec: nat-pair inst: name: maxi-start seq: ⊦ maxenc(n) = maxenc(0, n) subst: [n] → [m] flags: rewrite, current
Additional information
Used terms: m