proposition: Lemma oplus_unary_sup_sup : forall (X:Type) (f : X -> WFT X) (g : X -> WFT X), oplus_unary (SUP f) (SUP g) = SUP (fun x => oplus_nullary (oplus_unary (f x) (SUP g)) (oplus_unary (SUP f) (g x))).
proof: Proof. intros; auto. Defined.
imports: Coq(Lia) AlmostFull.Default(AlmostFull)