Theorems · Theorem · order theory
Nat.Subtype.orderIsoOfNat_apply
∀ {s : Set ℕ} [inst : Infinite ↑s] [dP : DecidablePred fun x => x ∈ s] {n : ℕ},
(Nat.Subtype.orderIsoOfNat s) n = Nat.Subtype.ofNat s n- Defined in
- Mathlib.Order.OrderIsoNat
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- InfiniteDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- Set.Elemstatement and proof · cited by 7,166
- OrderIsostatement · cited by 874
- Infinitestatement and proof · cited by 352
- Nat.Subtype.ofNatstatement and proof · cited by 9
- Nat.Subtype.orderIsoOfNatstatement · cited by 4
- RelEmbedding.natLTproof · cited by 4
- RelEmbedding.orderEmbeddingOfLTEmbeddingproof · cited by 3
- RelIso.ofSurjective_applyproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.