Theorems · Definition · order theory

FrameHom.casesOn

{α : Type u_8} →
  {β : Type u_9} →
    [inst : CompleteLattice α] →
      [inst_1 : CompleteLattice β] →
        {motive : FrameHom α β → Sort u} →
          (t : FrameHom α β) →
            ((toInfTopHom : InfTopHom α β) →
                (map_sSup' : ∀ (s : Set α), toInfTopHom.toFun (sSup s) = sSup (toInfTopHom.toFun '' s)) →
                  motive { toInfTopHom := toInfTopHom, map_sSup' := map_sSup' }) →
              motive t

Defined in

Mathlib.Order.Hom.CompleteLattice

Cited by

0 results in Mathlib

Foundations

Depth 11 from the axioms · uses no axioms

Assumes

CompleteLatticeCompleteLattice