∀ (R : Type u_2) (M : Type u_1) [inst : CommSemiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M]
  (e : TensorProduct R M (Module.Dual R M) ≃ₗ[R] R),
  let N := Module.Dual R M;
  ∀ (motive : (∃ S, e.symm 1 = ∑ i ∈ S, i.1 ⊗ₜ[R] i.2) → Prop) (x : ∃ S, e.symm 1 = ∑ i ∈ S, i.1 ⊗ₜ[R] i.2),
    (∀ (S : Finset (M × N)) (hS : e.symm 1 = ∑ i ∈ S, i.1 ⊗ₜ[R] i.2), motive ⋯) → motive x