{n : Type u_1} →
  {R : Type u_2} →
    [inst : Ring R] →
      [inst_1 : LinearOrder R] →
        [inst_2 : Fintype n] →
          [inst_3 : DecidableEq n] →
            {A : Matrix n n R} →
              {motive : A.IsPrimitive → Sort u} →
                (t : A.IsPrimitive) →
                  ((nonneg : ∀ (i j : n), 0 ≤ A i j) →
                      (exists_pos_pow : ∃ k > 0, ∀ (i j : n), 0 < (A ^ k) i j) → motive ⋯) →
                    motive t