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