Theorems · Theorem · general topology
Filter.Eventually.eventually_prod_of_eventually_swap
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : Filter α} {g : Filter β} {h : Filter γ} [g.NeBot] {p : α → β → Prop}
{q : β → γ → Prop} {r : α → γ → Prop},
(∀ᶠ (x : α) in f, ∀ᶠ (y : β) in g, p x y) →
(∀ᶠ (z : γ) in h, ∀ᶠ (y : β) in g, q y z) →
(∀ (x : α) (y : β) (z : γ), p x y → q y z → r x z) → ∀ᶠ (xz : α × γ) in f ×ˢ h, r xz.1 xz.2A technical lemma which is a generalization of Filter.Eventually.trans_prod.
- Defined in
- Mathlib.Order.Filter.Prod
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Filter.NeBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Filter.Eventuallystatement and proof · cited by 3,134
- SProd.sprodstatement · cited by 1,750
- Filter.NeBotstatement and proof · cited by 853
- Filter.Eventually.existsproof · cited by 168
- Filter.Eventually.andproof · cited by 157
- Filter.eventually_prod_iffproof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- Filter.Eventually.trans_prodproof · cited by 1