exists (A.Pure x)
case h₀.Pure.refl
C : _root_.Container
R : Type u₁
x y : R
⊢ ∃ node k₁ k₂,
    M.destruct (construct (Functor.Pure x)) = { fst := node, snd := k₁ } ∧
      M.destruct (construct (Functor.Pure x)) = { fst := node, snd := k₂ } ∧
        ∀ (i : Container.B (Container C R) node), eq (k₁ i) (k₂ i)
case h₀.Pure.refl
C : _root_.Container
R : Type u₁
x y : R
⊢ ∃ k₁ k₂,
    M.destruct (construct (Functor.Pure x)) = { fst := A.Pure x, snd := k₁ } ∧
      M.destruct (construct (Functor.Pure x)) = { fst := A.Pure x, snd := k₂ } ∧
        ∀ (i : Container.B (Container C R) (A.Pure x)), eq (k₁ i) (k₂ i)