[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 6 from proof idcircle-concrete-write (
previous step
)
# avol = # avol0, n0 < # avol0, ∀ m0. m0 < # avol0 ∧ m0 ≠ m → avol[m0] = avol0[n, aleb][m0] ⊦ avol[n0] = avol0[n0], m = n0, n0 = n
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: n0 abort: F discard: T computed: T
Additional information
Used simplifier rules: ⊦ m ≠ n → avol[n, aleb][m] = avol[m]; (s) Used terms: n0