Theorems · Definition · logic and foundations
Set.diagonal
(α : Type u_1) → Set (α × α)
diagonal α is the set of α × α consisting of all pairs of the form (a, a).
- Defined in
- Mathlib.Data.Set.Operations
- Cited by
- 42 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.ofPredproof · cited by 6,101
Cited by46
Results whose statement or proof uses this declaration.
- isClosed_eqproof · cited by 71
- FirstOrder.Language.distinctConstantsTheoryproof · cited by 9
- Set.range_diagstatement · cited by 6
- t2_iff_isClosed_diagonalstatement and proof · cited by 4
- isSeparatedMap_iff_isClosed_diagonalproof · cited by 4
- nhdsSet_diagonal_le_uniformitystatement · cited by 3
- MeasureTheory.StronglyMeasurable.measurableSet_eq_funproof · cited by 3
- isClosed_diagonalstatement · cited by 3
- nhdsSet_diagonalstatement and proof · cited by 2
- nhdsSet_diagonal_eq_uniformitystatement and proof · cited by 2
- ContinuousMap.exists_finite_approximation_of_mem_nhds_diagonalstatement and proof · cited by 2
- FirstOrder.Language.model_distinctConstantsTheoryproof · cited by 2