Theorems · Theorem · order theory
iSup_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 16 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- iSupstatement and proof · cited by 2,415
- le_antisymmproof · cited by 2,068
Cited by12
Results whose statement or proof uses this declaration.
- CategoryTheory.ObjectProperty.prop_iSup_iffproof · cited by 3
- hasCardinalLT_iUnionproof · cited by 2
- hasCardinalLT_subtype_iSupproof · cited by 2
- MeasurableSpace.exists_eq_iUnion_countablyGeneratedAtomproof · cited by 1
- binary_relation_sSup_iffproof · cited by 0
- Setoid.sSup_defproof · cited by 0
- CategoryTheory.MorphismProperty.sSup_iffproof · cited by 0
- Con.sSup_eq_conGenproof · cited by 0
- RingCon.sSup_eq_ringConGenproof · cited by 0
- unary_relation_sSup_iffproof · cited by 0
- AddCon.sSup_eq_addConGenproof · cited by 0
- Scott.isOpen_sUnionproof · cited by 0