Theorems · Theorem · general topology
OrderIso.isBoundedUnder_ge_comp
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} [inst : LE α] [inst_1 : LE β] (e : α ≃o β) {l : Filter γ} {u : γ → α},
(Filter.IsBoundedUnder (fun x1 x2 => x2 ≤ x1) l fun x => e (u x)) ↔ Filter.IsBoundedUnder (fun x1 x2 => x2 ≤ x1) l u- Defined in
- Mathlib.Order.Filter.IsBounded
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Filterstatement and proof · cited by 8,121
- Filter.Eventuallyproof · cited by 3,134
- OrderIsostatement and proof · cited by 874
- Filter.IsBoundedUnderstatement · cited by 247
- Filter.eventually_mapproof · cited by 70
- Function.Surjective.existsproof · cited by 53
- OrderIso.le_iff_leproof · cited by 29
- OrderIso.surjectiveproof · cited by 28
Cited by2
Results whose statement or proof uses this declaration.
- Filter.isBoundedUnder_le_negproof · cited by 1
- Filter.isBoundedUnder_le_invproof · cited by 0