Theorems · Definition · order theory
Set.inclusion
{α : Type u_1} → {s t : Set α} → s ⊆ t → ↑s → ↑tinclusion is the "identity" function between two subsets s and t, where s ⊆ t
- Defined in
- Mathlib.Data.Set.Inclusion
- Cited by
- 145 results in Mathlib
- Foundations
- Depth 7 from the axioms, rests on 14 definitions · 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.
Cited by160
Results whose statement or proof uses this declaration.
- AffineSubspace.inclusionstatement and proof · cited by 39
- Subalgebra.inclusionproof · cited by 36
- Affine.Simplex.restrictstatement · cited by 35
- Set.inclusion_injectivestatement · cited by 28
- LinearIndepOn.monoproof · cited by 14
- cfcₙ_eq_cfcproof · cited by 13
- NonUnitalSubalgebra.inclusionproof · cited by 12
- Set.range_inclusionstatement · cited by 12
- continuous_inclusionstatement · cited by 8
- Topology.IsEmbedding.inclusionstatement · cited by 8
- cfcₙHom_of_cfcHomproof · cited by 6
- Set.coe_inclusionstatement · cited by 6