Mathlib Map

Theorems · Theorem · order theory

Fin.image_natAdd_uIcc

∀ {n : ℕ} (m : ℕ) (i j : Fin n), Fin.natAdd m '' Set.uIcc i j = Set.uIcc (Fin.natAdd m i) (Fin.natAdd m j)
Defined in
Mathlib.Order.Interval.Set.Fin
Cited by
2 results in Mathlib
Foundations
Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Fin.map_natAddEmb_uIcc · cited by 0Fin.map_natAddEmb_uIccFin.finsetImage_natAdd_uIcc · cited by 0Fin.finsetImage_natAdd_uI…Set · cited by 53352SetSet.image · cited by 5609Set.imageSet.Icc · cited by 1702Set.IccSet.uIcc · cited by 393Set.uIccStrictMono.monotone · cited by 118StrictMono.monotoneMonotone.map_max · cited by 55Monotone.map_maxMonotone.map_min · cited by 43Monotone.map_minFin.strictMono_natAdd · cited by 11Fin.strictMono_natAddFin.image_natAdd_Icc · cited by 3Fin.image_natAdd_IccFin.image_natAdd_uIccCITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.