Theorems · Theorem · order theory
SetLike.ext
∀ {A : Type u_1} {B : Type u_2} [i : SetLike A B] {p q : A}, (∀ (x : B), x ∈ p ↔ x ∈ q) → p = qNote: implementers of SetLike must copy this lemma in order to tag it with @[ext].
- Defined in
- Mathlib.Data.SetLike.Basic
- Cited by
- 92 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses propext, Quot.sound
- Assumes
- SetLike
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.
- Set.extproof · cited by 2,266
- SetLikestatement and proof · cited by 1,084
- SetLike.coe_injectiveproof · cited by 374
Cited by92
Results whose statement or proof uses this declaration.
- Finset.extproof · cited by 565
- Submodule.extproof · cited by 204
- Subgroup.extproof · cited by 108
- AddSubgroup.extproof · cited by 75
- Submonoid.extproof · cited by 48
- AddSubmonoid.extproof · cited by 32
- Subalgebra.extproof · cited by 28
- LieSubmodule.extproof · cited by 20
- Function.Exact.linearMap_ker_eqproof · cited by 18
- IntermediateField.extproof · cited by 17
- AffineSubspace.extproof · cited by 16
- FractionalIdeal.extproof · cited by 13