[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 union-write-above (
previous step
)
m0 < # asar, m0 < n, ∀ n, asar, as. m0 ≤ n ∧ m0 ≤ # asar → union(asar[n, as], 0, m0) = union(asar, 0, m0) ⊦ asar[m0] ∪ union(asar[n, as], 0, m0) = asar[m0] ∪ union(asar, 0, m0)
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: n, asar, as abort: F discard: T computed: F
Additional information
Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: n, asar, as