[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 30 from proof bint-is-cast (
previous step
)
0 < cast(32, i), 32 < # int2bits(i), 2147483647 < cast(32, i) ⊦ bi2i(i2bi(cast(32, i))) = cast(32, i), i ∈bint
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 31
:
⊦ 2 ^ (i - 1) - 1 ≤ j0 ∧ 0 < i → ¬ j0 < cast(i, j)
Rule argument
seq: ⊦ 2 ^ (i - 1) - 1 ≤ j0 ∧ 0 < i → ¬ j0 < cast(i, j) subst: [j, i, j0] → [i, 32, 2147483647] rotate: F spec: intops inst: name: cast-nls-01
Additional information
Used terms: i, 32, 2147483647