Theorems · Theorem · order theory
Equiv.supSet_def
∀ {α : Type u_1} {β : Type u_2} (e : α ≃ β) [inst : SupSet β] (s : Set α), sSup s = e.symm (⨆ a ∈ s, e a)- Defined in
- Mathlib.Order.CompleteLattice.Defs
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Quot.sound
- Assumes
- SupSet
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.
- DFunLike.coestatement · cited by 62,936
- Setstatement and proof · cited by 53,352
- Equivstatement and proof · cited by 8,337
- Equiv.symmstatement · cited by 3,681
- iSupstatement · cited by 2,415
- SupSet.sSupstatement · cited by 954
- SupSetstatement and proof · cited by 154
- Equiv.supSetstatement · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.