Theorems · Theorem · order theory

OrderIso.map_succ

∀ {α : Type u_1} {β : Type u_2} [inst : PartialOrder α] [inst_1 : SuccOrder α] [inst_2 : PartialOrder β]
  [inst_3 : SuccOrder β] (f : α ≃o β) (a : α), f (Order.succ a) = Order.succ (f a)

Defined in

Mathlib.Order.SuccPred.Basic

Cited by

4 results in Mathlib

Foundations

Depth 29 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PartialOrderSuccOrderPartialOrderSuccOrder