Section Gapless.
Variable A : Type.
Implicit Type h : natmap A.
Definition gapless h := forall k, 0 < k <= last_key h -> k \in dom h.

Lemma gpPtUn h k u :
valid (k \-> u \+ h) ->
gapless (k \-> u \+ h) -> last_key h < k -> k = fresh h.