Improving over printing of let-tuple (see #4447).

For instance, #4447 is now printed:

λ Ca Da : ℕAlg,
let (ℕ, ℕ0) := (Ca, Da) in
let (C, p) := ℕ in
let (c₀, cs) := p in
let (D, p0) := ℕ0 in
let (d₀, ds) := p0 in
{h : C → D & ((h c₀ = d₀) * (∀ c : C, h (cs c) = ds (h c)))%type}
     : ℕAlg → ℕAlg → Type

0 files changed, 0 insertions, 0 deletions