Theorems · Theorem · general topology
ShrinkingLemma.PartialRefinement.find_apply_of_mem
∀ {ι : Type u_1} {X : Type u_2} [inst : TopologicalSpace X] {u : ι → Set X} {s : Set X} {p : Set X → Prop}
{c : Set (ShrinkingLemma.PartialRefinement u s p)},
IsChain (fun x1 x2 => x1 ≤ x2) c →
∀ (ne : c.Nonempty) {i : ι} {v : ShrinkingLemma.PartialRefinement u s p},
v ∈ c → i ∈ v.carrier → (ShrinkingLemma.PartialRefinement.find c ne i).toFun i = v.toFun i- Defined in
- Mathlib.Topology.ShrinkingLemma
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- TopologicalSpace
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- TopologicalSpacestatement and proof · cited by 24,529
- Set.Nonemptystatement and proof · cited by 2,627
- IsChainstatement and proof · cited by 158
- Set.mem_iUnion₂proof · cited by 70
- ShrinkingLemma.PartialRefinementstatement and proof · cited by 21
- ShrinkingLemma.PartialRefinement.carrierstatement and proof · cited by 15
- ShrinkingLemma.PartialRefinement.toFunstatement · cited by 14
- ShrinkingLemma.PartialRefinement.findstatement · cited by 4
- ShrinkingLemma.PartialRefinement.find_memproof · cited by 1
- ShrinkingLemma.PartialRefinement.mem_find_carrier_iffproof · cited by 1
- ShrinkingLemma.PartialRefinement.apply_eq_of_chainproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- ShrinkingLemma.PartialRefinement.le_chainSupproof · cited by 2