Theorems · Theorem · order theory
ciSup_neg
∀ {α : Type u_1} [inst : ConditionallyCompletePartialOrderSup α] {p : Prop} {f : p → α}, ¬p → ⨆ (h : p), f h = sSup ∅- Cited by
- 2 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Set.rangeproof · cited by 4,705
- iSupstatement · cited by 2,415
- SupSet.sSupstatement and proof · cited by 954
- SupSetproof · cited by 154
- ConditionallyCompletePartialOrderSupstatement and proof · cited by 52
- Set.range_eq_empty_iffproof · cited by 5
- isEmpty_Propproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- ciSup_eq_iteproof · cited by 4
- cbiSup_eq_of_not_forallproof · cited by 2