Theorems · Theorem · general topology
Filter.EventuallyEq.preimage
∀ {α : Type u} {β : Type v} {l : Filter α} {f g : α → β}, f =ᶠ[l] g → ∀ (s : Set β), f ⁻¹' s =ᶠ[l] g ⁻¹' s- Defined in
- Mathlib.Order.Filter.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- Filterstatement and proof · cited by 8,121
- Set.preimagestatement · cited by 4,946
- Filter.EventuallyEqstatement and proof · cited by 1,912
- Filter.EventuallyEq.fun_compproof · cited by 47
Cited by8
Results whose statement or proof uses this declaration.
- MeasureTheory.Measure.map_apply₀proof · cited by 5
- ProbabilityTheory.Kernel.IndepFun.process_congr_leftproof · cited by 4
- MeasureTheory.Measure.mapₗ_congrproof · cited by 3
- ProbabilityTheory.Kernel.iIndepFun.process_congrproof · cited by 2
- Filter.EventuallyEq.supportproof · cited by 2
- EventuallyMeasurable.congrproof · cited by 2
- Filter.EventuallyEq.mulSupportproof · cited by 1
- MeasureTheory.Measure.restrict_map_of_aemeasurableproof · cited by 1