Theorems · Theorem · order theory
Antitone.iSup_comp_tendsto_atBot
∀ {α : Type u_3} {β : Type u_4} {γ : Type u_5} [inst : Preorder β] [inst_1 : ConditionallyCompleteLattice γ]
[OrderTop γ] {l : Filter α} [l.NeBot] {f : β → γ},
Antitone f → ∀ {g : α → β}, Filter.Tendsto g l Filter.atBot → ⨆ a, f (g a) = ⨆ b, f bIf f is an antitone function taking values in a complete lattice
and g tends to atBot along a nontrivial filter,
then the indexed supremum of f ∘ g is equal to the indexed supremum of f.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Filterstatement and proof · cited by 8,121
- Preorderstatement and proof · cited by 7,952
- Set.rangeproof · cited by 4,705
- Filter.Tendstostatement and proof · cited by 3,814
- iSupstatement · cited by 2,415
- Filter.NeBotstatement and proof · cited by 853
- Antitonestatement and proof · cited by 563
- Filter.atBotstatement and proof · cited by 512
- OrderTopstatement and proof · cited by 493
- ConditionallyCompleteLatticestatement and proof · cited by 364
- OrderTop.bddAboveproof · cited by 16
- Antitone.ciSup_comp_tendsto_atBotproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Antitone.iUnion_comp_tendsto_atBotproof · cited by 0