Theorems · Theorem · order theory
iInf_psigma
∀ {α : Type u_1} [inst : CompleteLattice α] {ι : Sort u_8} {κ : ι → Sort u_9} (f : (i : ι) ×' κ i → α),
⨅ ij, f ij = ⨅ i, ⨅ j, f ⟨i, j⟩- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext, Quot.sound
- Assumes
- CompleteLattice
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.
- iInfstatement · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- eq_of_forall_le_iffproof · cited by 65
- le_iInf_iffproof · cited by 30
- PSigma.forallproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- iInf_psigma'proof · cited by 2
- Set.iInter_psigmaproof · cited by 0