{A : Type u_1} →
  {α : Type u_2} →
    [inst : AddMonoid A] →
      [inst_1 : SMul α A] →
        [inst_2 : Zero α] →
          {motive : DivisibleBy A α → Sort u} →
            (t : DivisibleBy A α) →
              ((div : A → α → A) →
                  (div_zero : ∀ (a : A), div a 0 = 0) →
                    (div_cancel : ∀ {n : α} (a : A), n ≠ 0 → n • div a n = a) →
                      motive { div := div, div_zero := div_zero, div_cancel := div_cancel }) →
                motive t