Theorems · Definition · order theory
WithTop.insertTop
{α : Type u_1} → Finset α ↪o Finset (WithTop α)Given a finset on α, lift it to being a finset on WithTop α
using WithTop.some and then insert ⊤.
- Defined in
- Mathlib.Order.Interval.Finset.Defs
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, 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.
- Finsetstatement and proof · cited by 13,712
- Top.topproof · cited by 9,680
- WithTopstatement · cited by 3,754
- Finset.mapproof · cited by 747
- OrderEmbeddingstatement · cited by 619
- Finset.consproof · cited by 221
- OrderEmbedding.ofMapLEIffproof · cited by 6
- Function.Embedding.coeWithTopproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- WithTop.top_mem_insertTopstatement · cited by 0
- WithTop.some_mem_insertTopstatement · cited by 0