[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 3 from proof uint2bits-first (
previous step
)
0 ≤ i ∧ uint2bits(i).first, ∀ i0. i→n(i0) < i→n(i) → 0 ≤ i0 ∧ uint2bits(i0).first → false ⊦ false
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
uint2bits(i).first, 0 ≤ i, ∀ i0. i→n(i0) < i→n(i) → 0 ≤ i0 ∧ uint2bits(i0).first → false ⊦
Rule argument
Additional information