Theorems · Theorem
Equiv.swap_apply_right
∀ {α : Sort u_1} [inst : DecidableEq α] (a b : α), (Equiv.swap a b) b = a- Defined in
- Mathlib.Logic.Equiv.Basic
- Cited by
- 31 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
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 · cited by 62,936
- Equiv.Permstatement · cited by 1,375
- Equiv.swapstatement · cited by 197
Cited by31
Results whose statement or proof uses this declaration.
- MonovaryOn.sum_smul_comp_perm_eq_sum_smul_iffproof · cited by 5
- Equiv.Perm.decomposeFin_symm_apply_succproof · cited by 3
- Similar.comm_leftproof · cited by 3
- Equiv.Perm.card_support_eq_twoproof · cited by 2
- Equiv.Perm.isCycle_swapproof · cited by 2
- Matrix.cons_cons_comp_swap_zero_oneproof · cited by 2
- IsTranscendenceBasis.of_isAlgebraic_adjoin_insert_sdiffproof · cited by 2
- Similar.comm_rightproof · cited by 2
- Equiv.bijOn_swapproof · cited by 1
- finRotate_succ_eq_decomposeFinproof · cited by 1
- Fin.succAbove_cycleRangeproof · cited by 1
- Equiv.Perm.IsThreeCycle.eq_swap_mul_swap_iff_mem_supportproof · cited by 1