Theorems · Theorem · order theory

RelEmbedding.orderEmbeddingOfLTEmbedding_apply

∀ {α : Type u_2} {β : Type u_3} [inst : PartialOrder α] [inst_1 : PartialOrder β]
  {f : (fun x1 x2 => x1 < x2) ↪r fun x1 x2 => x1 < x2} {x : α}, f.orderEmbeddingOfLTEmbedding x = f x

Defined in

Mathlib.Order.Hom.Basic

Cited by

0 results in Mathlib

Foundations

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

Assumes

PartialOrderPartialOrder