Theorems · Theorem · order theory
antisymm_of
∀ {α : Sort u_1} (r : α → α → Prop) [Std.Antisymm r] {a b : α}, r a b → r b a → a = bA version of antisymm with r explicit.
This lemma matches the lemmas from lean core in Init.Algebra.Classes, but is missing there.
- Defined in
- Mathlib.Order.Defs.Unbundled
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
- Assumes
- Std.Antisymm
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- antisymmproof · cited by 13
Cited by2
Results whose statement or proof uses this declaration.
- Function.Injective.antisymm_onFunproof · cited by 1
- Order.Preimage.antisymmproof · cited by 1