Theorems · Theorem
Equiv.Perm.ext
∀ {α : Sort u} {σ τ : Equiv.Perm α}, (∀ (x : α), σ x = τ x) → σ = τ- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 75 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Equiv.Permstatement and proof · cited by 1,375
- Equiv.extproof · cited by 102
Cited by75
Results whose statement or proof uses this declaration.
- Matrix.det_fromBlocks_zero₂₁proof · cited by 10
- Equiv.Perm.ext_iffproof · cited by 9
- exists_prime_orderOf_dvd_cardproof · cited by 5
- finCongr_reflproof · cited by 4
- Equiv.Perm.IsCycle.support_pow_eq_iffproof · cited by 4
- Equiv.Perm.SameCycle.cycleOf_eqproof · cited by 4
- Equiv.Perm.one_lt_card_support_of_ne_oneproof · cited by 4
- Matrix.det_blockDiagonalproof · cited by 4
- Equiv.Perm.OnCycleFactors.kerParam_range_eqproof · cited by 3
- Set.powersetCard.fixedPoints_ne_univ_of_faithfulSMulproof · cited by 3
- mem_closure_isSwapproof · cited by 2
- Equiv.Perm.extendDomainHom_injectiveproof · cited by 2