{α : Type} →
  {motive : Lean.Meta.RefinedDiscrTree.Trie α → Sort u} →
    (t : Lean.Meta.RefinedDiscrTree.Trie α) →
      ((values : Array α) →
          (star : Option Lean.Meta.RefinedDiscrTree.TrieIndex) →
            (labelledStars : Std.HashMap ℕ Lean.Meta.RefinedDiscrTree.TrieIndex) →
              (children : Std.HashMap Lean.Meta.RefinedDiscrTree.Key Lean.Meta.RefinedDiscrTree.TrieIndex) →
                (pending : Array (Lean.Meta.RefinedDiscrTree.LazyEntry × α)) →
                  motive
                    { values := values, star := star, labelledStars := labelledStars, children := children,
                      pending := pending }) →
        motive t