Theorems · Definition · group theory
SubAddAction.FG
{R : Type u_1} → {M : Type u_2} → [inst : VAdd R M] → SubAddAction R M → PropA SubAddAction is finitely generated if it is the closure of a finite set.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
- Assumes
- VAdd
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Set.Finiteproof · cited by 1,814
- VAddstatement and proof · cited by 616
- SubAddActionstatement and proof · cited by 86
- SubAddAction.closureproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- SubAddAction.fg_iffstatement · cited by 1