[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 39 from proof getsetShort-theorem (previous step)

j ≤ 32767, ub2i(i2b(j)) < 256, 0 ≤ ub2i(i2b(j)), 0 ≤ j ⊦ 256 * b2i(i2b(j / 256)) + ub2i(i2b(j)) = j, (j / 256)∈byte

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 40:
⊦ i ≤ j ↔ i < j + 1
Proof step 41:
j < 32767 + 1, ub2i(i2b(j)) < 256, 0 ≤ ub2i(i2b(j)), 0 ≤ j ⊦ 256 * b2i(i2b(j / 256)) + ub2i(i2b(j)) = j, (j / 256)∈byte

Rule argument

spec: int-abs inst: name: le-rew-succ seq: ⊦ i ≤ j ↔ i < j + 1 subst: [j, i] → [32767, j] flags: rewrite

Additional information

Used terms: 32767, j