Theorems · Theorem · order theory
iInf_Prop_eq
∀ {ι : Sort u_4} {p : ι → Prop}, ⨅ i, p i = ∀ (i : ι), p i- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.rangeproof · cited by 4,705
- le_antisymmproof · cited by 2,068
- iInfstatement and proof · cited by 1,690
Cited by12
Results whose statement or proof uses this declaration.
- CategoryTheory.MorphismProperty.sInf_iffproof · cited by 4
- partialSups_iff_forallproof · cited by 3
- AddCon.coe_sInfproof · cited by 1
- CategoryTheory.ObjectProperty.preservesLimitsOfShape_eq_iSupproof · cited by 1
- RingCon.coe_sInfproof · cited by 1
- Con.coe_sInfproof · cited by 1
- CategoryTheory.MorphismProperty.isLocal_iSupproof · cited by 1
- binary_relation_sInf_iffproof · cited by 0
- Setoid.sInf_defproof · cited by 0
- CategoryTheory.ObjectProperty.preservesColimitsOfShape_eq_iSupproof · cited by 0
- CategoryTheory.MorphismProperty.isColocal_iSupproof · cited by 0
- unary_relation_sInf_iffproof · cited by 0