Theorems · Theorem · general topology
Filter.mem_traverse
∀ {α β γ : Type u} {f : β → Filter α} {s : γ → Set α} (fs : List β) (us : List γ),
List.Forall₂ (fun b c => s c ∈ f b) fs us → traverse s us ∈ traverse f fs- Defined in
- Mathlib.Order.Filter.ListTraverse
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Filterstatement and proof · cited by 8,121
- Set.mem_singletonproof · cited by 183
- Traversable.traversestatement and proof · cited by 53
- Filter.image_mem_mapproof · cited by 39
- Filter.mem_pureproof · cited by 14
- Filter.seq_mem_seqproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- nhds_listproof · cited by 2
- Filter.mem_traverse_iffproof · cited by 1