[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 20 from proof int2bits-restsgn (
previous step
)
1 < 2 ^ (i + 2), 0 ≤ i, 0 < 2 ^ i, 0 < 2 ^ (i + 2), 0 ≤ 2 ^ (i + 2) ⊦ 2 ^ (i + 2) = 2 ^ i, sgn(uint2bits(2 ^ (i + 2) - 2 ^ i).rest) = uint2bits(2 ^ (i + 2) - 2 ^ i).rest, ∃ i0. 2 ^ i0 = 2 ^ i
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 3 terms: i
Additional information
Used terms: i