Mathlib Map

Theorems · Theorem · order theory

UpperSet.symm_map

∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] [inst_1 : Preorder β] (f : α ≃o β),
  (UpperSet.map f).symm = UpperSet.map f.symm
Defined in
Mathlib.Order.UpperLower.CompleteLattice
Cited by
2 results in Mathlib
Foundations
Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
PreorderPreorder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

upperClosure_image · cited by 3upperClosure_imageUpperSet.mem_map · cited by 0UpperSet.mem_mapDFunLike.coe · cited by 62936DFunLike.coeSetLike.coe · cited by 8199SetLike.coePreorder · cited by 7952PreorderSet.ext · cited by 2266Set.extOrderIso · cited by 874OrderIsoOrderIso.symm · cited by 475OrderIso.symmUpperSet · cited by 245UpperSetUpperSet.ext · cited by 29UpperSet.extOrderIso.ext · cited by 23OrderIso.extUpperSet.map · cited by 12UpperSet.mapUpperSet.symm_mapCITED BYCITES

Cites10

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.