[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 41 from proof fill-sgn-01 (previous step)

n1 + # bits0 = 1 + n, mklist(boolvar, # bits0) = bits0, ∀ n0. ¬ n0 < # bits0 → fillsgn(n0, sgn(bits0)) = fillsgn(n0, bits0) ⊦ mklist(boolvar, n + 1) = mklist(boolvar, n1) + mklist(boolvar, # bits0), n1 = 0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 42:
⊦ mklist(boolvar, m + n) = mklist(boolvar, m) + mklist(boolvar, n)
Proof step 43:
n1 + # bits0 = 1 + n, mklist(boolvar, # bits0) = bits0, ∀ n0. ¬ n0 < # bits0 → fillsgn(n0, sgn(bits0)) = fillsgn(n0, bits0) ⊦ mklist(boolvar, n + 1) = mklist(boolvar, n1 + # bits0), n1 = 0

Rule argument

seq: ⊦ mklist(boolvar, m + n) = mklist(boolvar, m) + mklist(boolvar, n) subst: [n, m, boolvar] → [# bits0, n1, boolvar] rotate: T spec: list-last inst: bitlista name: mk-plus

Additional information

Used terms: # bits0, n1, boolvar