[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 1 from proof lebs-idexpt-below (conclusion)
n < m0, m0 + m1 ≤ # avol1 ⊦ id○(avol1, avol0, n) → lebs(avol1, m0, m1) = lebs(avol0, m0, m1)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n < m0, id○(avol1, avol0, n), m0 + m1 ≤ # avol1 ⊦ lebs(avol1, m0, m1) = lebs(avol0, m0, m1)
Rule argument
Additional information