library colibrilib.models — module SetFactsFacts on sets, for BDDModel (in a small context)
module SetFacts610use int.Int611use set.Set612use set.Cardinal613use map.MapExt614615type a616
The intersection with a disjoint union
Valid (1.3s) (colibri2 4) (cvc4) (cvc5 2) (split_vc) (depth 1)let ghost inter_union (c sa sb ga gb: set a) : unit619requires { subset ga sa /\ subset gb sb }620requires { forall i. not (mem i sa /\ mem i sb) }621ensures { inter c (union sa sb) = union ga gb <->622(inter c sa = ga /\ inter c sb = gb) }623= if pure { inter c (union sa sb) = union ga gb } then begin624assert { forall i. mem i (inter c (union sa sb)) <-> mem i (union ga gb) };625assert { inter c sa == ga };626assert { inter c sb == gb }627end;628if pure { inter c sa = ga /\ inter c sb = gb } then begin629assert { forall i. mem i (inter c sa) <-> mem i ga };630assert { forall i. mem i (inter c sb) <-> mem i gb };631assert { inter c (union sa sb) == union ga gb }632end633Valid (25ms) (colibri2)634let ghost card_remove (x:a) (s:set a) : unit635requires { is_finite s /\ mem x s }636ensures { cardinal (remove x s) = cardinal s - 1 }637= let r = remove x s in638assert { is_finite r };639assert { not mem x r };640assert { add x r == s };641assert { cardinal (add x r) = cardinal r + 1 }642end643