proposition: Lemma oplus_nullary_cor (X : Type) (A B : Prop) (C : X -> X -> Prop) : almost_full (fun x y => C x y \/ A) -> almost_full (fun x y => C x y \/ B) -> almost_full (fun x y => C x y \/ (A /\ B)).
proof: Proof. intros. apply oplus_nullary with (R := fun x y => C x y \/ A). apply H. auto. intros. firstorder. apply H0. Defined.
imports: Coq(Arith Wf_nat Lia) AlmostFull.PropBounded(AlmostFull)