Theorems · Theorem · order theory
iSup_split
∀ {α : Type u_1} {β : Type u_2} [inst : CompleteLattice α] (f : β → α) (p : β → Prop),
⨆ i, f i = (⨆ i, ⨆ (_ : p i), f i) ⊔ ⨆ i, ⨆ (_ : ¬p i), f i- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredproof · cited by 6,101
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- iSup_congr_Propproof · cited by 247
- iSup_posproof · cited by 61
- iSup_unionproof · cited by 8
Cited by6
Results whose statement or proof uses this declaration.
- iSup_split_singleproof · cited by 3
- Module.End.iSup_iInf_maxGenEigenspace_eq_top_of_forall_mapsToproof · cited by 2
- iSup_extend_botproof · cited by 2
- LieIdeal.restr_inf_cartan_eq_biSup_corootSubmoduleproof · cited by 1
- iSupIndep_ne_botproof · cited by 0
- IsPreconnected.transGen_of_iUnionproof · cited by 0