fact: Definition iswofun {X Y : WellOrderedSet} (f : X → Y) : UU := (iscomprelrelfun (WOrel X) (WOrel Y) f) × (∏ (x : X) (y : Y), y < f x → ∃ (z : X), z < x × f z = y).
imports: UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.Propositions UniMath.MoreFoundations.Subtypes UniMath.MoreFoundations.Sets UniMath.MoreFoundations.AxiomOfChoice UniMath.Combinatorics.OrderedSets