Theorems · Theorem · group theory
SubAddAction.ofFixingAddSubgroup.append_right
∀ {M : Type u_1} {α : Type u_2} [inst : AddGroup M] [inst_1 : AddAction M α] {s : Set α} {n : ℕ} [inst_2 : Finite ↑s]
(x : Fin n ↪ ↥(SubAddAction.ofFixingAddSubgroup M s)) (i : Fin n),
(SubAddAction.ofFixingAddSubgroup.append x) (Fin.natAdd s.ncard i) = ↑(x i)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- AddGroupstatement and proof · cited by 4,410
- AddSubgroupstatement · cited by 3,232
- Finitestatement and proof · cited by 3,029
- Function.Embeddingstatement and proof · cited by 988
- AddActionstatement and proof · cited by 820
- Set.ncardstatement · cited by 344
- Equiv.toEmbeddingproof · cited by 254
- Function.Embedding.subtypeproof · cited by 128
- SubAddActionstatement · cited by 86
Cited by1
Results whose statement or proof uses this declaration.
- SubAddAction.ofFixingAddSubgroup.isMultiplyPretransitiveproof · cited by 3