Theorems · Theorem · order theory

LTSeries.map_toFun

∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] [inst_1 : Preorder β] (p : LTSeries α) (f : α → β)
  (hf : StrictMono f) (a : Fin (p.length + 1)), (p.map f hf).toFun a = f (p.toFun a)

Defined in

Mathlib.Order.RelSeries

Cited by

0 results in Mathlib

Foundations

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

Assumes

PreorderPreorder