Theorems · Theorem · order theory
iSupIndep_ne_bot
∀ {α : Type u_1} {ι : Type u_3} [inst : CompleteLattice α] {t : ι → α}, (iSupIndep fun i => t ↑i) ↔ iSupIndep t- Defined in
- Mathlib.Order.SupIndep
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 17 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.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderproof · cited by 6,410
- Bot.botstatement and proof · cited by 4,720
- iSupproof · cited by 2,415
- Disjointproof · cited by 2,201
- eq_or_neproof · cited by 1,117
- OrderBotproof · cited by 1,055
- CompleteLatticestatement and proof · cited by 1,048
- iSup_congr_Propproof · cited by 247
- Subtype.val_injectiveproof · cited by 232
- sup_of_le_rightproof · cited by 143
- iSupIndepstatement and proof · cited by 100
- iSup_botproof · cited by 29
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.