/-- Constructs an equivalence between Boolean algebras from an order isomorphism between them. -/
@[simps]
def Iso.mk {α β : BoolAlg.{u}} (e : α ≃o β) : α ≅ β where
  hom := (e : BoundedLatticeHom α β)
  inv := (e.symm : BoundedLatticeHom β α)
  hom_inv_id := by ext; exact e.symm_apply_apply _
  inv_hom_id := by ext; 

Proof state:
case w
α β : BoolAlg
e : ↑α ≃o ↑β
x✝ : (forget BoolAlg).obj β
⊢ ((let src :=
          {
            toSupHom :=
              { toFun := ⇑(OrderIso.symm e),
                map_sup' := (_ : ∀ (a b : ↑β), (OrderIso.symm e) (a ⊔ b) = (OrderIso.symm e) a ⊔ (OrderIso.symm e) b) },
            map_inf' := (_ : ∀ (a b : ↑β), (OrderIso.symm e) (a ⊓ b) = (OrderIso.symm e) a ⊓ (OrderIso.symm e) b) };
        {
          toLatticeHom :=
            {
              toSupHom :=
                { toFun := ⇑(OrderIso.symm e),
                  map_sup' :=
                    (_ :
                      ∀ (a b : ↑β),
                        SupHom.toFun
                            {
                                toSupHom :=
                                  { toFun := ⇑(OrderIso.symm e),
                                    map_sup' :=
                                      (_ :
                                        ∀ (a b : ↑β),
                                          (OrderIso.symm e) (a ⊔ b) = (OrderIso.symm e) a ⊔ (OrderIso.symm e) b) },
                                map_inf' :=
                                  (_ :
                                    ∀ (a b : ↑β),
                                      (OrderIso.symm e) (a ⊓ b) = (OrderIso.symm e) a ⊓ (OrderIso.symm e) b) }.toSupHom
                            (a ⊔ b) =
                          SupHom.toFun
                              {
                                  toSupHom :=
                                    { toFun := ⇑(OrderIso.symm e),
                                      map_sup' :=
                                        (_ :
                                          ∀ (a b : ↑β),
                                            (OrderIso.symm e) (a ⊔ b) = (OrderIso.symm e) a ⊔ (OrderIso.symm e) b) },
                                  map_inf' :=
                                    (_ :
                                      ∀ (a b : ↑β),
                                        (OrderIso.symm e) (a ⊓ b) =
                                          (OrderIso.symm e) a ⊓ (OrderIso.symm e) b) }.toSupHom
                              a ⊔
                            SupHom.toFun
                              {
                                  toSupHom :=
                                    { toFun := ⇑(OrderIso.symm e),
                                      map_sup' :=
                                        (_ :
                                          ∀ (a b : ↑β),
                                            (OrderIso.symm e) (a ⊔ b) = (OrderIso.symm e) a ⊔ (OrderIso.symm e) b) },
                                  map_inf' :=
                                    (_ :
                                      ∀ (a b : ↑β),
                                        (OrderIso.symm e) (a ⊓ b) =
                                          (OrderIso.symm e) a ⊓ (OrderIso.symm e) b) }.toSupHom
                              b) },
              map_inf' :=
                (_ :
                  ∀ (a b : ↑β),
                    SupHom.toFun src.toSupHom (a ⊓ b) = SupHom.toFun src.toSupHom a ⊓ SupHom.toFun src.toSupHom b) },
          map_top' := (_ : (OrderIso.symm e) ⊤ = ⊤), map_bot' := (_ : (OrderIso.symm e) ⊥ = ⊥) }) ≫
        let src :=
          { toSupHom := { toFun := ⇑e, map_sup' := (_ : ∀ (a b : ↑α), e (a ⊔ b) = e a ⊔ e b) },
            map_inf' := (_ : ∀ (a b : ↑α), e (a ⊓ b) = e a ⊓ e b) };
        {
          toLatticeHom :=
            {
              toSupHom :=
                { toFun := ⇑e,
                  map_sup' :=
                    (_ :
                      ∀ (a b : ↑α),
                        SupHom.toFun
                            { toSupHom := { toFun := ⇑e, map_sup' := (_ : ∀ (a b : ↑α), e (a ⊔ b) = e a ⊔ e b) },
                                map_inf' := (_ : ∀ (a b : ↑α), e (a ⊓ b) = e a ⊓ e b) }.toSupHom
                            (a ⊔ b) =
                          SupHom.toFun
                              { toSupHom := { toFun := ⇑e, map_sup' := (_ : ∀ (a b : ↑α), e (a ⊔ b) = e a ⊔ e b) },
                                  map_inf' := (_ : ∀ (a b : ↑α), e (a ⊓ b) = e a ⊓ e b) }.toSupHom
                              a ⊔
                            SupHom.toFun
                              { toSupHom := { toFun := ⇑e, map_sup' := (_ : ∀ (a b : ↑α), e (a ⊔ b) = e a ⊔ e b) },
                                  map_inf' := (_ : ∀ (a b : ↑α), e (a ⊓ b) = e a ⊓ e b) }.toSupHom
                              b) },
              map_inf' :=
                (_ :
                  ∀ (a b : ↑α),
                    SupHom.toFun src.toSupHom (a ⊓ b) = SupHom.toFun src.toSupHom a ⊓ SupHom.toFun src.toSupHom b) },
          map_top' := (_ : e ⊤ = ⊤), map_bot' := (_ : e ⊥ = ⊥) })
      x✝ =
    (𝟙 β) x✝

Next tactic:
exact e.apply_symm_apply _