In Lambek and Scott's "Introduction to higher order categorical logic" (1988), they state that every Heyting Algebra can be understood as a bicartesian closed category.

On the other hand, fixing a bicartesian closed category, and using $A \cong B$ to denote that morphisms^{1} exists between $A$ and $B$, we can see that every bicartesian closed category exhibits the intuitionistic equational axiomatization of a Heyting algebra. Specifically, we can observe that:

- If $X \to Y \cong 1$ and $Y \to X \cong 1$ then $X \cong Y$
- If $1 \to X \cong 1$ then $X \cong 1$
- $X \to (Y \to X) \cong 1$
- $(X \to (Y \to Z)) \to (X \to Y) \to (X \to Z) \cong 1$
- $X \times Y \to X \cong 1$
- $X \times Y \to Y \cong 1$
- $X \to Y \to X \times Y \cong 1$
- $X \to X + Y \cong 1$
- $Y \to X + Y \cong 1$
- $(X \to Z) \to (Y \to Z) \to (X + Y \to Z) \cong 1$
- $0 \to X \cong 1$

Here $\to$ is an exponential, $\times$ is a product, and $+$ is a co-product, $1$ is a final object and $0$ is an initial object.

I cannot find the statement of this in Lambek & Scott, however. So I have two questions:

(A) Does this follow from some general theorem regarding bicartesian closed categories?

(B) Is this a folk theorem, or is there a place in the literature where this is established?

I originally wrote isomorphism here, but as Andreas Blass notes this is not true (for instance, in the category of sets). However, as noted below, this is true if we weaken the statement to *equimorphic*.