---

Step * of Lemma merge-int-sorted

∀[T:Type]. ∀[as,bs:T List].  sorted(merge-int(bs;as)) supposing sorted(bs) supposing T ⊆r ℤ
BY
{ (InductionOnList
   THEN Unfold `merge-int` 0
   THEN Reduce 0
   THEN Try (Fold `merge-int` 0)
   THEN Auto
   THEN BLemma `insert-int-sorted`
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[as,bs:T  List].    sorted(merge-int(bs;as))  supposing  sorted(bs)  supposing  T  \msubseteq{}r  \mBbbZ{}


By

---

Latex:
(InductionOnList
  THEN  Unfold  `merge-int`  0
  THEN  Reduce  0
  THEN  Try  (Fold  `merge-int`  0)
  THEN  Auto
  THEN  BLemma  `insert-int-sorted`
  THEN  Auto)

---

Home Index