{α : Type u_2} →
  [inst : LE α] →
    {motive : NonemptyChain α → Sort u} →
      ((carrier : Set α) →
          (Nonempty' : carrier.Nonempty) →
            (isChain' : IsChain (fun x1 x2 => x1 ≤ x2) carrier) →
              motive { carrier := carrier, Nonempty' := Nonempty', isChain' := isChain' }) →
        (t : NonemptyChain α) → motive t