[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 5 from proof int2bits-less-2pot-01 (
previous step
)
2 ^ (n→i(# int2bits(j)) - 1) < j, 0 ≤ j ⊦
User applied rule insert lemma
And obtained the following new goals
Proof step 6
:
0 ≤ j ⊦ j < 2 ^ (n→i(# int2bits(j)) - 1)
Rule argument
name: int2bits-less-2pot subst: [j] → [j]
Additional information
Used simplifier rules: ⊦ i < j → ¬ j < i; Used terms: j