Theorems · Theorem · order theory
biInf_sup_biInf
∀ {α : Type u} [inst : Order.Coframe α] {ι : Type u_1} {ι' : Type u_2} {f : ι → α} {g : ι' → α} {s : Set ι}
{t : Set ι'}, (⨅ i ∈ s, f i) ⊔ ⨅ j ∈ t, g j = ⨅ p ∈ s ×ˢ t, f p.1 ⊔ g p.2- Defined in
- Mathlib.Order.CompleteBooleanAlgebra
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Quot.sound
- Assumes
- Order.Coframe
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Equiv.symmproof · cited by 3,681
- SProd.sprodstatement · cited by 1,750
- iInfstatement · cited by 1,690
- Equiv.surjectiveproof · cited by 198
- Order.Coframestatement and proof · cited by 38
- iInf_subtype'proof · cited by 34
- Function.Surjective.iInf_congrproof · cited by 11
- Equiv.Set.prodproof · cited by 9
- iInf_sup_iInfproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- sInf_sup_sInfproof · cited by 1
- biInf_inter_of_pairwise_codisjointproof · cited by 0