Common — library colibrilib.models — module SetFacts

Facts on sets, for BDDModel (in a small context)

610
module SetFacts
611
use int.Int
612
use set.Set
613
use set.Cardinal
614
use map.MapExt
615
616
type
a

The intersection with a disjoint union

  Valid (1.3s) (colibri2 4) (cvc4) (cvc5 2) (split_vc) (depth 1)
619
let ghost
inter_union
(c sa sb ga gb: set a) : unit
620
requires { subset ga sa /\ subset gb sb }
621
requires { forall i. not (mem i sa /\ mem i sb) }
622
ensures { inter c (union sa sb) = union ga gb <->
623
(inter c sa = ga /\ inter c sb = gb) }
624
= if pure { inter c (union sa sb) = union ga gb } then begin
625
assert { forall i. mem i (inter c (union sa sb)) <-> mem i (union ga gb) };
626
assert { inter c sa == ga };
627
assert { inter c sb == gb }
628
end;
629
if pure { inter c sa = ga /\ inter c sb = gb } then begin
630
assert { forall i. mem i (inter c sa) <-> mem i ga };
631
assert { forall i. mem i (inter c sb) <-> mem i gb };
632
assert { inter c (union sa sb) == union ga gb }
633
end
634
Valid (25ms) (colibri2)
635
let ghost
card_remove
(x:a) (s:set a) : unit
636
requires { is_finite s /\ mem x s }
637
ensures { cardinal (remove x s) = cardinal s - 1 }
638
= let r = remove x s in
639
assert { is_finite r };
640
assert { not mem x r };
641
assert { add x r == s };
642
assert { cardinal (add x r) = cardinal r + 1 }
643
end