[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 889 from proof bitsand-cast (previous step)

# bits1 = n + # bits0, bits0.first, # bits0 < # bits1 ⊦ lastn(# bits1, mklist(true, n) + bits0) = lastn(# bits1, fillsgn(# bits1, bits2 + mklist(true, n) + bits0)), bits1 = [], bits2 + bits1 = [], bits0 = [], n = 0, false ∈ bits1

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 890:
⊦ n ≤ # bits → fillsgn(n, bits) = bits
Proof step 891:
# bits1 ≤ #(bits2 + mklist(true, n) + bits0), # bits1 = n + # bits0, bits0.first, # bits0 < # bits1 ⊦ lastn(# bits1, mklist(true, n) + bits0) = lastn(# bits1, bits2 + mklist(true, n) + bits0), bits1 = [], bits2 + bits1 = [], bits0 = [], n = 0, false ∈ bits1

Rule argument

seq: ⊦ n ≤ # bits → fillsgn(n, bits) = bits subst: [bits, n] → [bits2 + mklist(true, n) + bits0, # bits1] rotate: F spec: bitopsaux inst: name: fillsgn-longer

Additional information

Used simplifier rules: ⊦ #(bits + bits0) = # bits + # bits0;% ⊦ # mklist(boolvar, n) = n;% ⊦ (bits + bits0) + bits1 = bits + bits0 + bits1;% ⊦ ¬ m ≤ n ↔ n < m;% ⊦ (m + n0) + n1 = m + n0 + n1;% ⊦ m + n = n + m;% ⊦ m < n ∧ n = n0 → m < n0; (forward)% ⊦ ¬ m + n < m; Used terms: bits2 + mklist(true, n) + bits0, # bits1