Theorems · Theorem · logic and foundations
Set.pairwise_insert_of_symm
∀ {α : Type u_1} {r : α → α → Prop} {s : Set α} {a : α} [Std.Symm r],
(insert a s).Pairwise r ↔ s.Pairwise r ∧ ∀ b ∈ s, a ≠ b → r a b- Defined in
- Mathlib.Data.Set.Pairwise.Basic
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Std.Symm
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.Pairwisestatement and proof · cited by 321
- Std.Symm.iffproof · cited by 8
Cited by10
Results whose statement or proof uses this declaration.
- Set.Pairwise.insert_of_symmproof · cited by 4
- Set.pairwiseDisjoint_insertproof · cited by 3
- isAntichain_insert_of_symmproof · cited by 2
- isStrongAntichain_insertproof · cited by 1
- ArithmeticFunction.IsMultiplicative.map_prodproof · cited by 1
- Metric.isSeparated_insertproof · cited by 1
- SetRel.isSeparated_insertproof · cited by 1
- Ideal.iSup_iInf_eq_top_iff_pairwiseproof · cited by 1
- SimpleGraph.isClique_insertproof · cited by 0
- Set.pairwise_insert_of_symmetricproof · cited by 0