Theorems · Definition · order theory
Nat.Subtype.orderIsoOfNat
(s : Set ℕ) → [Infinite ↑s] → ℕ ≃o ↑s
Nat.Subtype.ofNat as an order isomorphism between ℕ and an infinite subset. See also
Nat.nth for a version where the subset may be finite.
- Defined in
- Mathlib.Order.OrderIsoNat
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Infinite
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.
- Setstatement and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- OrderIsostatement · cited by 874
- Infinitestatement and proof · cited by 352
- Nat.Subtype.ofNatproof · cited by 9
- RelIso.ofSurjectiveproof · cited by 4
- RelEmbedding.natLTproof · cited by 4
- RelEmbedding.orderEmbeddingOfLTEmbeddingproof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- Nat.nthproof · cited by 84
- Nat.nth_strictMonoproof · cited by 6
- Nat.nth_eq_orderIsoOfNatstatement · cited by 2
- Nat.nth_apply_eq_orderIsoOfNatstatement and proof · cited by 1
- Nat.Subtype.orderIsoOfNat_applystatement · cited by 0