Theorems · Theorem · order theory

LowerSet.map_map

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} [inst : Preorder α] [inst_1 : Preorder β] [inst_2 : Preorder γ]
  {s : LowerSet α} (g : β ≃o γ) (f : α ≃o β), (LowerSet.map g) ((LowerSet.map f) s) = (LowerSet.map (f.trans g)) s

Defined in

Mathlib.Order.UpperLower.CompleteLattice

Cited by

0 results in Mathlib

Foundations

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

Assumes

PreorderPreorderPreorder