Theorems · Definition
Equiv.xor
{α : Type u_1} → [inst : XorOp α] → [inst_1 : Zero α] → [LawfulXor α] → α → Equiv.Perm αXorOp.xor as a permutation.
- Defined in
- Mathlib.Data.LawfulXor.Equiv
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
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.
- Equiv.Permstatement · cited by 1,375
- LawfulXorstatement and proof · cited by 28
- xor_cancel_leftproof · cited by 1
Cited by7
Results whose statement or proof uses this declaration.
- Equiv.xor_eq_one_iffstatement · cited by 0
- Equiv.xor_involutivestatement · cited by 0
- Equiv.xor_symmstatement · cited by 0
- Equiv.xor_trans_xorstatement · cited by 0
- Equiv.xor_zerostatement · cited by 0
- Equiv.isFixedPt_xorstatement · cited by 0
- Equiv.xor_applystatement and proof · cited by 0