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

true ∈ bits1 ∧ false ∈ bits1 → bits1 = mklist(boolvar, n) + boolvar0 ' + bits ∧ sgn(mklist(boolvar, n) + boolvar0 ' + bits) = boolvar ' + boolvar0 ' + bits ∧ ¬(boolvar ↔ boolvar0) ∧ n ≠ 0 ⊦ bits2 + bits1 = [], bits0 = [], lastn(# bits1, fillsgn(# bits1, bitsand(sgn(bits1), bits0))) = lastn(# bits1, fillsgn(# bits1, bitsand(bits2 + bits1, bits0)))

User applied rule cut formula

And obtained the following new goals

Proof step 370:
true ∈ bits1, true ∈ bits1 ∧ false ∈ bits1 → bits1 = mklist(boolvar, n) + boolvar0 ' + bits ∧ sgn(mklist(boolvar, n) + boolvar0 ' + bits) = boolvar ' + boolvar0 ' + bits ∧ ¬(boolvar ↔ boolvar0) ∧ n ≠ 0 ⊦ bits2 + bits1 = [], bits0 = [], lastn(# bits1, fillsgn(# bits1, bitsand(sgn(bits1), bits0))) = lastn(# bits1, fillsgn(# bits1, bitsand(bits2 + bits1, bits0)))
Proof step 955:
true ∈ bits1 ∧ false ∈ bits1 → bits1 = mklist(boolvar, n) + boolvar0 ' + bits ∧ sgn(mklist(boolvar, n) + boolvar0 ' + bits) = boolvar ' + boolvar0 ' + bits ∧ ¬(boolvar ↔ boolvar0) ∧ n ≠ 0 ⊦ true ∈ bits1, bits2 + bits1 = [], bits0 = [], lastn(# bits1, fillsgn(# bits1, bitsand(sgn(bits1), bits0))) = lastn(# bits1, fillsgn(# bits1, bitsand(bits2 + bits1, bits0)))

Rule argument

fma: true ∈ bits1

Additional information

Used formulas: true ∈ bits1