Determinism of resolving theorems #
theorem
ResolveConcatOne_deterministic :
∀ {α : Type} {F : Factory α} {d : Doc} {m : Meas} {i : ℕ} {msr₁ msr₂ : MeasureSet},
ResolveConcatOne F d m i msr₁ → ResolveConcatOne F d m i msr₂ → msr₁ = msr₂
theorem
ResolveConcat_deterministic :
∀ {α : Type} {F : Factory α} {d : Doc} {i : ℕ} {msr₁ msr₂ : MeasureSet} {ms : List Meas},
ResolveConcat F ms d i msr₁ → ResolveConcat F ms d i msr₂ → msr₁ = msr₂