Theorems · Theorem · order theory
ULift.down_iSup
∀ {α : Type u_1} {ι : Sort u_4} [inst : SupSet α] (f : ι → ULift.{v, u_1} α), (⨆ i, f i).down = ⨆ i, (f i).down- Defined in
- Mathlib.Order.CompleteLattice.Lemmas
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SupSet
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.
- iSupstatement · cited by 2,415
- SupSet.sSupproof · cited by 954
- Set.range_compproof · cited by 223
- SupSetstatement and proof · cited by 154
- Set.preimage_eq_iff_eq_imageproof · cited by 5
- ULift.up_bijectiveproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- ULift.up_iSupproof · cited by 0