[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 4 from proof int2bits-inv-first (
previous step
)
int2bits(j) = true ' + bitsinvert(bits), 0 < j ⊦ j = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ 0 < j → int2bits(j) ≠ true ' + bits
Rule argument
name: int2bits-first-03 rotate: F subst: [bits, j] → [bitsinvert(bits), j]
Additional information
Used terms: bitsinvert(bits), j