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

7 < # bits0 ⊦ bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bytes2int(bits2bytes(boolvar ' + firstn(# bits0 % 8, bits0)) + bits2bytes(restn(# bits0 % 8, bits0))) ↔ ¬ boolvar

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 19:
⊦ # bits ≤ 8 → bits2bytes(bits) = i2b(bits2int(bits)) '
Proof step 20:
¬ #(boolvar ' + firstn(# bits0 % 8, bits0)) ≤ 8, 7 < # bits0 ⊦ bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bytes2int(bits2bytes(boolvar ' + firstn(# bits0 % 8, bits0)) + bits2bytes(restn(# bits0 % 8, bits0))) ↔ ¬ boolvar
Proof step 23:
#(boolvar ' + firstn(# bits0 % 8, bits0)) ≤ 8, 7 < # bits0 ⊦ bits0 = [], (# bits0 + 1) % 8 = 0, 0 ≤ bytes2int(i2b(bits2int(boolvar ' + firstn(# bits0 % 8, bits0))) ' + bits2bytes(restn(# bits0 % 8, bits0))) ↔ ¬ boolvar

Rule argument

name: bits2bytes-base rotate: F subst: [bits] → [boolvar ' + firstn(# bits0 % 8, bits0)]

Additional information

Used terms: boolvar ' + firstn(# bits0 % 8, bits0)