Theorems · Theorem · commutative algebra

Module.IsStablyFree.equiv_iff

∀ {R : Type u} [inst : Ring R] {M : Type v} [inst_1 : AddCommGroup M] [inst_2 : Module R M] {N : Type w}
  [inst_3 : AddCommGroup N] [inst_4 : Module R N] (e : M ≃ₗ[R] N), Module.IsStablyFree R M ↔ Module.IsStablyFree R N

Defined in: Mathlib.Algebra.Module.StablyFree.Basic
Cited by: 0 results in Mathlib
Foundations: Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Ring AddCommGroup Module AddCommGroup Module

Mathlib docs Source Loogle LeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Modulestatement and proof · cited by 20,661
RingHom.idstatement and proof · cited by 18,349
AddCommGroupstatement and proof · cited by 12,871
Ringstatement and proof · cited by 7,463
LinearEquivstatement and proof · cited by 3,317
LinearEquiv.symmproof · cited by 1,461
Module.IsStablyFreestatement and proof · cited by 8
Module.IsStablyFree.equivproof · cited by 3

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.