{α : Type u_1} →
  [inst : ChainCompletePartialOrder α] →
    {x : α} →
      {f : α → α} →
        {s : Set α} →
          {motive : ChainCompletePartialOrder.IsAdmissible x f s → Sort u} →
            (t : ChainCompletePartialOrder.IsAdmissible x f s) →
              ((base_isLeast : IsLeast s x) →
                  (image_self_subset_self : f '' s ⊆ s) →
                    (cSup_mem : ∀ (c : NonemptyChain α), ↑c ⊆ s → ChainCompletePartialOrder.cSup c ∈ s) → motive ⋯) →
                motive t