Theorems · Theorem · order theory
IsStrongAntichain.eq
∀ {α : Type u_1} {r : α → α → Prop} {s : Set α},
IsStrongAntichain r s → ∀ {a b c : α}, a ∈ s → b ∈ s → r a c → r b c → a = b- Defined in
- Mathlib.Order.Antichain
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Classical.choice, 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.
- Setstatement and proof · cited by 53,352
- Set.Pairwise.eqproof · cited by 12
- IsStrongAntichainstatement and proof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- IsStrongAntichain.subsingletonproof · cited by 0