[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 29 from proof bits2int-pos (previous step)

7 < # bits0, # bits0 % 8 ≤ 7, # bits0 % 8 < # bits0 ⊦ bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bits2int(fillsgn(8, int2bits(b2i(i2b(bits2int(boolvar ' + firstn(# bits0 % 8, bits0)))))) + bytes2bits(bits2bytes(restn(# bits0 % 8, bits0)))) ↔ ¬ boolvar

User applied rule cut formula

And obtained the following new goals

Proof step 30:
boolvar, 7 < # bits0, # bits0 % 8 ≤ 7, # bits0 % 8 < # bits0 ⊦ bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bits2int(fillsgn(8, int2bits(b2i(i2b(bits2int(boolvar ' + firstn(# bits0 % 8, bits0)))))) + bytes2bits(bits2bytes(restn(# bits0 % 8, bits0)))) ↔ ¬ boolvar
Proof step 54:
7 < # bits0, # bits0 % 8 ≤ 7, # bits0 % 8 < # bits0 ⊦ boolvar, bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bits2int(fillsgn(8, int2bits(b2i(i2b(bits2int(boolvar ' + firstn(# bits0 % 8, bits0)))))) + bytes2bits(bits2bytes(restn(# bits0 % 8, bits0)))) ↔ ¬ boolvar

Rule argument

fma: boolvar

Additional information

Used formulas: boolvar