[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 24 from proof bits2bits-def (previous step)

0 < bits2uint(false ' + bitsinvert(bits) + true ' + bits1) ⊦ sgn(sgn(true ' + bits + false ' + bitsinvert(bits1)) +1) = sgn(true ' + bits + true ' + bits1), true ∈ bits1

User applied rule cut formula

And obtained the following new goals

Proof step 25:
bits1 = [], 0 < bits2uint(false ' + bitsinvert(bits) + true ' + bits1) ⊦ sgn(sgn(true ' + bits + false ' + bitsinvert(bits1)) +1) = sgn(true ' + bits + true ' + bits1), true ∈ bits1
Proof step 28:
0 < bits2uint(false ' + bitsinvert(bits) + true ' + bits1) ⊦ bits1 = [], sgn(sgn(true ' + bits + false ' + bitsinvert(bits1)) +1) = sgn(true ' + bits + true ' + bits1), true ∈ bits1

Rule argument

fma: bits1 = []

Additional information

Used formulas: bits1 = []