Theorems · Theorem · group theory
Equiv.Perm.pow_apply_mem_support
∀ {α : Type u_1} [inst : DecidableEq α] [inst_1 : Fintype α] {f : Equiv.Perm α} {n : ℕ} {x : α},
(f ^ n) x ∈ f.support ↔ x ∈ f.support- Defined in
- Mathlib.GroupTheory.Perm.Support
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintype
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.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Equiv.Permstatement and proof · cited by 1,375
- Equiv.Perm.supportstatement · cited by 230
Cited by4
Results whose statement or proof uses this declaration.
- Equiv.Perm.IsCycle.zpowersEquivSupport_applystatement · cited by 1
- Equiv.Perm.IsCycle.zpowersEquivSupport_symm_applystatement · cited by 1
- Equiv.Perm.IsCycle.support_congrproof · cited by 1
- Equiv.Perm.IsCycle.eq_on_support_inter_nonempty_congrproof · cited by 1