Theorems · Theorem · order theory
Fin.strictMono_cons_zero_succ
∀ {n : ℕ} {f : Fin n → Fin (n + 1)}, StrictMono (Fin.cons 0 f) ↔ f = Fin.succ- Defined in
- Mathlib.Order.Fin.Tuple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- le_antisymmproof · cited by 2,068
- StrictMonostatement and proof · cited by 706
- Fin.consstatement and proof · cited by 190
- Fin.cons_succproof · cited by 54
- StrictMono.id_leproof · cited by 14
- StrictAnti.comp_strictMonoproof · cited by 4
- StrictAnti.compproof · cited by 3
- Fin.rev_strictAntiproof · cited by 2
- Fin.cons_zero_succproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.