Datasets:

piercemaloney

/

coqgym_coq_projects_v2

like 0

(*************************************************************************) (* Copyright (C) 2013 - 2015 *) (* Author C. Cohen *) (* DRAFT - PLEASE USE WITH CAUTION *) (* License CeCILL-B *) (*************************************************************************) From mathcomp Require Import ssreflect ssrbool ssrnat eqtype ssrfun seq. From mathcomp Require Import choice path finset finfun fintype bigop. Require Import finmap. (*****************************************************************************) (* This file provides a representation of multisets based on fsfun *) (* {mset T} == the type of multisets on a choiceType T *) (* The following notations are in the %mset scope *) (* mset0 == the empty multiset *) (* mset n a == the multiset with n times element a *) (* [mset a] == the singleton multiset {k} := mset 1 a *) (* [mset a1; ..; an] == the multiset obtained from the elements a1,..,an *) (* A `&` B == the intersection of A and B (the min of each) *) (* A `|` B == the union of A and B (the max of each) *) (* A `+` B == the sum of A and B *) (* a |` B == the union of singleton a and B *) (* a +` B == the addition of singleton a to B *) (* A `\` B == the difference A minus B *) (* A `\ b == A without one b *) (* A `*` B == the product of A and B *) (* [disjoint A & B] := A `&` B == 0 *) (* A `<=` B == A is a sub-multiset of B *) (* A `<` B == A is a proper sub-multiset of B *) (*****************************************************************************) Set Implicit Arguments. Unset Strict Implicit. Unset Printing Implicit Defensive. Lemma sumn_map I (f : I -> nat) s : sumn [seq f i | i <- s] = \sum_(i <- s) f i. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) Proof. by elim: s => [|i s IHs] in f *; rewrite ?(big_nil, big_cons) //= IHs. Qed. Lemma sumn_filter s P : sumn [seq i <- s | P i] = \sum_(i <- s | P i) i. Proof. by rewrite -big_filter -sumn_map map_id. Qed. Lemma sumn_map_filter I s (f : I -> nat) P : sumn [seq f i | i <- s & P i] = \sum_(i <- s | P i) f i. Proof. by rewrite sumn_map big_filter. Qed. Delimit Scope mset_scope with mset. Local Open Scope fset_scope. Local Open Scope fmap_scope. Local Open Scope mset_scope. Local Open Scope nat_scope. Definition multiset (T : choiceType) := {fsfun T -> nat with 0}. Definition multiset_of (T : choiceType) of phant T := @multiset T. Notation "'{mset' T }" := (@multiset_of _ (Phant T)) (format "'{mset' T }") : mset_scope. Notation "[ 'mset[' key ] x 'in' aT => F ]" := ([fsfun[key] x in aT => F] : {mset _}) (at level 0, x ident, only parsing) : mset_scope. Notation "[ 'mset' x 'in' aT => F ]" := ([fsfun x in aT => F] : {mset _}) (at level 0, x ident, only parsing) : mset_scope. Notation "[ 'm' 'set' x 'in' aT => F ]" := ([fsfun[_] x in aT => F] : {mset _}) (at level 0, x ident, format "[ 'm' 'set' x 'in' aT => F ]") : mset_scope. Identity Coercion multiset_multiset_of : multiset_of >-> multiset. Notation enum_mset_def A := (flatten [seq nseq (A%mset x) x | x <- finsupp A%mset]). Module Type EnumMsetSig. Axiom f : forall K, multiset K -> seq K. Axiom E : f = (fun K (A : multiset K) => enum_mset_def A). End EnumMsetSig. Module EnumMset : EnumMsetSig. Definition f K (A : multiset K) := enum_mset_def A. Definition E := (erefl f). End EnumMset. Notation enum_mset := EnumMset.f. Coercion enum_mset : multiset >-> seq. Canonical enum_mset_unlock := Unlockable EnumMset.E. Canonical multiset_predType (K : choiceType) := Eval hnf in mkPredType (fun (A : multiset K) a => a \in enum_mset A). Canonical mset_finpredType (T: choiceType) := mkFinPredType (multiset T) (fun A => undup (enum_mset A)) (fun _ => undup_uniq _) (fun _ _ => mem_undup _ _). Section MultisetOps. Context {K : choiceType}. Implicit Types (a b c : K) (A B C D : {mset K}) (s : seq K). Definition mset0 : {mset K} := [fsfun]. Fact msetn_key : unit. Proof. exact: tt. Qed. Definition msetn n a := [mset[msetn_key] x in [fset a] => n]. Fact seq_mset_key : unit. Proof. exact: tt. Qed. Definition seq_mset (s : seq K) := [mset[seq_mset_key] x in [fset x in s] => count (pred1 x) s]. Fact msetU_key : unit. Proof. exact: tt. Qed. Definition msetU A B := [mset[msetU_key] x in finsupp A `|` finsupp B => maxn (A x) (B x)]. Fact msetI_key : unit. Proof. exact: tt. Qed. Definition msetI A B := [mset[msetI_key] x in finsupp A `|` finsupp B => minn (A x) (B x)]. Fact msetD_key : unit. Proof. exact: tt. Qed. Definition msetD A B := [mset[msetD_key] x in finsupp A `|` finsupp B => A x + B x]. Fact msetB_key : unit. Proof. exact: tt. Qed. Definition msetB A B := [mset[msetB_key] x in finsupp A `|` finsupp B => A x - B x]. Fact msetM_key : unit. Proof. exact: tt. Qed. Definition msetM A B := [mset[msetM_key] x in finsupp A `*` finsupp B => A x.1 * B x.2]. Definition msubset A B := [forall x : finsupp A, A (val x) <= B (val x)]. Definition mproper A B := msubset A B && ~~ msubset B A. Definition mdisjoint A B := (msetI A B == mset0). End MultisetOps. Notation "[ 'mset' a ]" := (msetn 1 a) (at level 0, a at level 99, format "[ 'mset' a ]") : mset_scope. Notation "[ 'mset' a : T ]" := [mset (a : T)] (at level 0, a at level 99, format "[ 'mset' a : T ]") : mset_scope. Notation "A `|` B" := (msetU A B) : mset_scope. Notation "A `+` B" := (msetD A B) : mset_scope. Notation "A `\` B" := (msetB A B) : mset_scope. Notation "A `\ a" := (A `\` [mset a]) : mset_scope. Notation "a |` A" := ([mset (a)] `|` A) : mset_scope. Notation "a +` A" := ([mset (a)] `+` A) : mset_scope. Notation "A `*` B" := (msetM A B) : mset_scope. Notation "A `<=` B" := (msubset A B) (at level 70, no associativity) : mset_scope. Notation "A `<` B" := (mproper A B) (at level 70, no associativity) : mset_scope. (* This is left-associative due to historical limitations of the .. Notation. *) Notation "[ 'mset' a1 ; a2 ; .. ; an ]" := (msetD .. (a1 +` (msetn 1 a2)) .. (msetn 1 an)) (at level 0, a1 at level 99, format "[ 'mset' a1 ; a2 ; .. ; an ]") : mset_scope. Notation "A `&` B" := (msetI A B) : mset_scope. Section MSupp. Context {K : choiceType}. Implicit Types (a b c : K) (A B C D : {mset K}) (s : seq K). Lemma enum_msetE a A : (a \in A) = (a \in flatten [seq nseq (A x) x | x <- finsupp A]). Proof. by transitivity (a \in enum_mset A); rewrite // unlock. Qed. Lemma msuppE a A : (a \in finsupp A) = (a \in A). Proof. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite enum_msetE. (* Goal: Bool.reflect (@eq (@multiset_of K (Phant (Choice.sort K))) (@seq_mset K s) (@seq_mset K s')) (@perm_eq (Choice.eqType K) s s') *) apply/idP/flattenP => [aA|/=[_ /mapP[x xA -> /nseqP[->//]]]]. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) exists (nseq (A a) a); first by apply/mapP; exists a. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/nseqP; split=> //; rewrite lt0n -mem_finsupp. Qed. End MSupp. Section MSetTheory. Context {K : choiceType}. Implicit Types (a b c : K) (A B C D : {mset K}) (s : seq K). Lemma msetP {A B} : A =1 B <-> A = B. Proof. exact: fsfunP. Qed. Lemma mset_neq0 a A : (A a != 0) = (a \in A). Proof. by rewrite -msuppE mem_finsupp. Qed. Lemma in_mset a A : (a \in A) = (A a > 0). Proof. by rewrite -mset_neq0 lt0n. Qed. Lemma mset_eq0 a A : (A a == 0) = (a \notin A). Proof. by rewrite -mset_neq0 negbK. Qed. Lemma mset_eq0P {a A} : reflect (A a = 0) (a \notin A). Proof. by rewrite -mset_eq0; apply: eqP. Qed. Lemma mset_gt0 a A : (A a > 0) = (a \in A). Proof. by rewrite -in_mset. Qed. Lemma mset_eqP {A B} : reflect (A =1 B) (A == B). Proof. exact: (equivP eqP (iff_sym msetP)). Qed. Lemma mset0E a : mset0 a = 0. Proof. by rewrite /mset0 fsfunE. Qed. Lemma msetnE n a b : (msetn n a) b = if b == a then n else 0. Proof. by rewrite fsfunE inE. Qed. Lemma msetnxx n a : (msetn n a) a = n. Proof. by rewrite msetnE eqxx. Qed. Lemma msetE2 A B a : ((A `+` B) a = A a + B a) * ((A `|` B) a = maxn (A a) (B a)) * ((A `&` B) a = minn (A a) (B a)) * ((A `\` B) a = (A a) - (B a)). Proof. (* Goal: @eq (Equality.sort nat_eqType) (@fun_of_fsfun (prod_choiceType K K) nat_eqType (fun _ : Choice.sort (prod_choiceType K K) => O) (@msetM K A B) u) (muln (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) A (@fst (Choice.sort K) (Choice.sort K) u)) (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) B (@snd (Choice.sort K) (Choice.sort K) u))) *) rewrite !fsfunE !inE !msuppE -!mset_neq0; case: ifPn => //. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite negb_or !negbK => /andP [/eqP-> /eqP->]. Qed. Lemma count_mem_mset a A : count_mem a A = A a. Proof. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite unlock count_flatten sumn_map big_map. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite (eq_bigr _ (fun _ _ => esym (sum1_count _ _))) /=. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite (eq_bigr _ (fun _ _ => big_nseq_cond _ _ _ _ _ _)) /= -big_mkcond /=. (* Goal: @eq nat (@BigOp.bigop nat (Choice.sort K) O (@enum_fset K (@FinSupp.fs K nat_eqType (fun _ : Choice.sort K => O) A)) (fun i : Choice.sort K => @BigBody nat (Choice.sort K) i addn (@eq_op (Choice.eqType K) i a) (@iter nat (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) A i) (addn (S O)) O))) (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) A a) *) have [aNA|aA] := finsuppP. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite big1_fset // => i iA /eqP eq_ia; rewrite -eq_ia iA in aNA. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite big_fset_condE/= (big_fsetD1 a) ?inE ?eqxx ?andbT //= iter_addn mul1n. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite (_ : (_ `\ _)%fset = fset0) ?big_seq_fset0 ?addn0//. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/fsetP=> i; rewrite !inE; case: (i == a); rewrite ?(andbF, andbT). Qed. Lemma perm_undup_mset A : perm_eq (undup A) (finsupp A). Proof. (* Goal: is_true (@perm_eq (Choice.eqType K) (@undup (Choice.eqType K) (@EnumMset.f K A)) (@enum_fset K (@FinSupp.fs K nat_eqType (fun _ : Choice.sort K => O) A))) *) apply: uniq_perm_eq; rewrite ?undup_uniq // => a. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite mem_undup msuppE. Qed. Section big_com. Variables (R : Type) (idx : R) (op : Monoid.com_law idx). Implicit Types (X : {mset K}) (P : pred K) (F : K -> R). Lemma big_mset X P F : \big[op/idx]_(i <- X | P i) F i = \big[op/idx]_(i <- finsupp X | P i) iterop (X i) op (F i) idx. Proof. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite [in RHS](eq_big_perm (undup X)) 1?perm_eq_sym ?perm_undup_mset//. (* Goal: @eq bool (@eq_op nat_eqType (@BigOp.bigop nat (Equality.sort I) O r (fun i : Equality.sort I => @BigBody nat (Equality.sort I) i addn (P i) (E i))) O) (@all (Equality.sort I) (@pred_of_simpl (Equality.sort I) (@SimplPred (Equality.sort I) (fun i : Equality.sort I => implb (P i) (@eq_op nat_eqType (E i) O)))) r) *) rewrite -[in LHS]big_undup_iterop_count; apply: eq_bigr => i _. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite count_mem_mset. Qed. End big_com. Lemma sum_mset (X : {mset K}) (P : pred K) (F : K -> nat) : \sum_(i <- X | P i) F i = \sum_(i <- finsupp X | P i) X i * F i. Proof. (* Goal: @eq bool (@eq_op nat_eqType (@BigOp.bigop nat (Equality.sort I) O r (fun i : Equality.sort I => @BigBody nat (Equality.sort I) i addn (P i) (E i))) O) (@all (Equality.sort I) (@pred_of_simpl (Equality.sort I) (@SimplPred (Equality.sort I) (fun i : Equality.sort I => implb (P i) (@eq_op nat_eqType (E i) O)))) r) *) rewrite big_mset; apply: eq_bigr => i _ //. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite Monoid.iteropE iter_addn addn0 mulnC. Qed. Lemma prod_mset (X : {mset K}) (P : pred K) (F : K -> nat) : \prod_(i <- X | P i) F i = \prod_(i <- finsupp X | P i) F i ^ X i. Proof. by rewrite big_mset. Qed. Lemma mset_seqE s a : (seq_mset s) a = count_mem a s. Proof. by rewrite fsfunE inE/=; case: ifPn => // /count_memPn ->. Qed. Lemma perm_eq_seq_mset s : perm_eq (seq_mset s) s. Proof. by apply/allP => a _ /=; rewrite count_mem_mset mset_seqE. Qed. Lemma seq_mset_id A : seq_mset A = A. Proof. by apply/msetP=> a; rewrite mset_seqE count_mem_mset. Qed. Lemma eq_seq_msetP s s' : reflect (seq_mset s = seq_mset s') (perm_eq s s'). Proof. (* Goal: Bool.reflect (@eq (@multiset_of K (Phant (Choice.sort K))) (@seq_mset K s) (@seq_mset K s')) (@perm_eq (Choice.eqType K) s s') *) apply: (iffP idP) => [/perm_eqP perm_ss'|eq_ss']. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/msetP => a; rewrite !mset_seqE perm_ss'. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/allP => a _ /=; rewrite -!mset_seqE eq_ss'. Qed. Lemma msetME A B (u : K * K) : (A `*` B) u = A u.1 * B u.2. Proof. (* Goal: @eq (Equality.sort nat_eqType) (@fun_of_fsfun (prod_choiceType K K) nat_eqType (fun _ : Choice.sort (prod_choiceType K K) => O) (@msetM K A B) u) (muln (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) A (@fst (Choice.sort K) (Choice.sort K) u)) (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) B (@snd (Choice.sort K) (Choice.sort K) u))) *) rewrite !fsfunE inE; case: ifPn => //=. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite negb_and !memNfinsupp => /orP [] /eqP->; rewrite ?muln0. Qed. Lemma mset1DE a A b : (a +` A) b = (b == a) + A b. Proof. by rewrite msetE2 msetnE; case: (b == a). Qed. Lemma mset1UE a A b : (a |` A) b = maxn (b == a) (A b). Proof. by rewrite msetE2 msetnE; case: (b == a). Qed. Lemma msetB1E a A b : (A `\ a) b = (A b) - (b == a). Proof. by rewrite msetE2 msetnE; case: (b == a). Qed. Let msetE := (mset0E, msetE2, msetnE, msetnxx, mset1DE, mset1UE, msetB1E, mset_seqE, msetME). Lemma in_mset0 a : a \in mset0 = false. Proof. by rewrite in_mset !msetE. Qed. Lemma in_msetn n a' a : a \in msetn n a' = (n > 0) && (a == a'). Proof. by rewrite in_mset msetE; case: (a == a'); rewrite ?andbT ?andbF. Qed. Lemma in_mset1 a' a : a \in [mset a'] = (a == a'). Proof. by rewrite in_msetn. Qed. Lemma in_msetD A B a : (a \in A `+` B) = (a \in A) || (a \in B). Proof. by rewrite !in_mset !msetE addn_gt0. Qed. Lemma in_msetU A B a : (a \in A `|` B) = (a \in A) || (a \in B). Proof. by rewrite !in_mset !msetE leq_max. Qed. Lemma in_msetDU A B a : (a \in A `+` B) = (a \in A `|` B). Proof. by rewrite in_msetU in_msetD. Qed. Lemma in_msetI A B a : (a \in A `&` B) = (a \in A) && (a \in B). Proof. by rewrite !in_mset msetE leq_min. Qed. Lemma in_msetB A B a : (a \in A `\` B) = (B a < A a). Proof. by rewrite -mset_neq0 msetE subn_eq0 ltnNge. Qed. Lemma in_mset1U a' A a : (a \in a' |` A) = (a == a') || (a \in A). Proof. by rewrite in_msetU in_mset msetE; case: (_ == _). Qed. Lemma in_mset1D a' A a : (a \in a' +` A) = (a == a') || (a \in A). Proof. by rewrite in_msetDU in_mset1U. Qed. Lemma in_msetB1 A b a : (a \in A `\ b) = ((a == b) ==> (A a > 1)) && (a \in A). Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite in_msetB msetE in_mset; case: (_ == _); rewrite -?geq_max. Qed. Lemma in_msetM A B (u : K * K) : (u \in A `*` B) = (u.1 \in A) && (u.2 \in B). Proof. by rewrite -!msuppE !mem_finsupp msetE muln_eq0 negb_or. Qed. Definition in_msetE := (in_mset0, in_msetn, in_msetB1, in_msetU, in_msetI, in_msetD, in_msetM). Let inE := (inE, in_msetE, (@msuppE K)). Lemma enum_mset0 : mset0 = [::] :> seq K. Proof. by rewrite unlock finsupp0. Qed. Lemma msetn0 (a : K) : msetn 0 a = mset0. Proof. by apply/msetP=> i; rewrite !msetE if_same. Qed. Lemma finsupp_msetn n a : finsupp (msetn n a) = if n > 0 then [fset a] else fset0. Proof. by apply/fsetP => i; rewrite !inE; case: ifP => //=; rewrite inE. Qed. Lemma enum_msetn n a : msetn n a = nseq n a :> seq K. Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) case: n => [|n]; first by rewrite msetn0 /= enum_mset0. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite unlock finsupp_msetn /= enum_fsetE /= enum_fset1 /= cats0. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite msetE eqxx. Qed. Section big. Variables (R : Type) (idx : R) (op : Monoid.law idx). Implicit Types (X : {mset K}) (P : pred K) (F : K -> R). Lemma big_mset0 P F : \big[op/idx]_(i <- mset0 | P i) F i = idx. Proof. by rewrite enum_mset0 big_nil. Qed. Lemma big_msetn n a P F : \big[op/idx]_(i <- msetn n a | P i) F i = if P a then iterop n op (F a) idx else idx. Proof. by rewrite enum_msetn big_nseq_cond Monoid.iteropE. Qed. End big. Lemma msetDC (A B : {mset K}) : A `+` B = B `+` A. Proof. by apply/msetP=> a; rewrite !msetE addnC. Qed. Lemma msetIC (A B : {mset K}) : A `&` B = B `&` A. Proof. by apply/msetP=> a; rewrite !msetE minnC. Qed. Lemma msetUC (A B : {mset K}) : A `|` B = B `|` A. Proof. by apply/msetP => a; rewrite !msetE maxnC. Qed. (* intersection *) Lemma mset0I A : mset0 `&` A = mset0. Proof. by apply/msetP => x; rewrite !msetE min0n. Qed. Lemma msetI0 A : A `&` mset0 = mset0. Proof. by rewrite msetIC mset0I. Qed. Lemma msetIA A B C : A `&` (B `&` C) = A `&` B `&` C. Proof. by apply/msetP=> x; rewrite !msetE minnA. Qed. Lemma msetICA A B C : A `&` (B `&` C) = B `&` (A `&` C). Proof. by rewrite !msetIA (msetIC A). Qed. Lemma msetIAC A B C : A `&` B `&` C = A `&` C `&` B. Proof. by rewrite -!msetIA (msetIC B). Qed. Lemma msetIACA A B C D : (A `&` B) `&` (C `&` D) = (A `&` C) `&` (B `&` D). Proof. by rewrite -!msetIA (msetICA B). Qed. Lemma msetIid A : A `&` A = A. Proof. by apply/msetP=> x; rewrite !msetE minnn. Qed. Lemma msetIIl A B C : A `&` B `&` C = (A `&` C) `&` (B `&` C). Proof. by rewrite msetIA !(msetIAC _ C) -(msetIA _ C) msetIid. Qed. Lemma msetIIr A B C : A `&` (B `&` C) = (A `&` B) `&` (A `&` C). Proof. by rewrite !(msetIC A) msetIIl. Qed. (* union *) Lemma mset0U A : mset0 `|` A = A. Proof. by apply/msetP => x; rewrite !msetE max0n. Qed. Lemma msetU0 A : A `|` mset0 = A. Proof. by rewrite msetUC mset0U. Qed. Lemma msetUA A B C : A `|` (B `|` C) = A `|` B `|` C. Proof. by apply/msetP=> x; rewrite !msetE maxnA. Qed. Lemma msetUCA A B C : A `|` (B `|` C) = B `|` (A `|` C). Proof. by rewrite !msetUA (msetUC B). Qed. Lemma msetUAC A B C : A `|` B `|` C = A `|` C `|` B. Proof. by rewrite -!msetUA (msetUC B). Qed. Lemma msetUACA A B C D : (A `|` B) `|` (C `|` D) = (A `|` C) `|` (B `|` D). Proof. by rewrite -!msetUA (msetUCA B). Qed. Lemma msetUid A : A `|` A = A. Proof. by apply/msetP=> x; rewrite !msetE maxnn. Qed. Lemma msetUUl A B C : A `|` B `|` C = (A `|` C) `|` (B `|` C). Proof. by rewrite msetUA !(msetUAC _ C) -(msetUA _ C) msetUid. Qed. Lemma msetUUr A B C : A `|` (B `|` C) = (A `|` B) `|` (A `|` C). Proof. by rewrite !(msetUC A) msetUUl. Qed. (* adjunction *) Lemma mset0D A : mset0 `+` A = A. Proof. by apply/msetP => x; rewrite !msetE add0n. Qed. Lemma msetD0 A : A `+` mset0 = A. Proof. by rewrite msetDC mset0D. Qed. Lemma msetDA A B C : A `+` (B `+` C) = A `+` B `+` C. Proof. by apply/msetP=> x; rewrite !msetE addnA. Qed. Lemma msetDCA A B C : A `+` (B `+` C) = B `+` (A `+` C). Proof. by rewrite !msetDA (msetDC B). Qed. Lemma msetDAC A B C : A `+` B `+` C = A `+` C `+` B. Proof. by rewrite -!msetDA (msetDC B). Qed. Lemma msetDACA A B C D : (A `+` B) `+` (C `+` D) = (A `+` C) `+` (B `+` D). Proof. by rewrite -!msetDA (msetDCA B). Qed. (* adjunction, union and difference with one element *) Lemma msetU1l x A B : x \in A -> x \in A `|` B. Proof. by move=> Ax /=; rewrite inE Ax. Qed. Lemma msetU1r A b : b \in A `|` [mset b]. Proof. by rewrite !inE eqxx orbT. Qed. Lemma msetB1P x A b : reflect ((x = b -> A x > 1) /\ x \in A) (x \in A `\ b). Proof. (* Goal: @eq (list (Choice.sort K)) (@EnumMset.f K (@msetn K (S n) a)) (@nseq (Choice.sort K) (S n) a) *) rewrite !inE. apply: (iffP andP); first by move=> [/implyP Ax ->]; split => // /eqP. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> [Ax ->]; split => //; apply/implyP => /eqP. Qed. Lemma msetB11 b A : (b \in A `\ b) = (A b > 1). Proof. by rewrite inE eqxx /= in_mset -geq_max. Qed. Lemma msetB1K a A : a \in A -> a +` (A `\ a) = A. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> aA; apply/msetP=> x; rewrite !msetE subnKC //=. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by have [->|//] := altP eqP; rewrite mset_gt0. Qed. Lemma msetD1K a B : (a +` B) `\ a = B. Proof. by apply/msetP => x; rewrite !msetE addKn. Qed. Lemma msetU1K a B : a \notin B -> (a |` B) `\ a = B. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> aB; apply/msetP=> x; rewrite !msetE. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) have [->|] := altP eqP; first by rewrite (mset_eq0P _). (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite max0n subn0. Qed. Lemma mset1U1 x B : x \in x |` B. Proof. by rewrite !inE eqxx. Qed. Lemma mset1D1 x B : x \in x +` B. Proof. by rewrite !inE eqxx. Qed. Lemma mset1Ur x a B : x \in B -> x \in a |` B. Proof. by move=> Bx; rewrite !inE predU1r. Qed. Lemma mset1Dr x a B : x \in B -> x \in a +` B. Proof. by move=> Bx; rewrite !inE predU1r. Qed. Lemma mset2P x a b : reflect (x = a \/ x = b) (x \in [mset a; b]). Proof. by rewrite !inE; apply: (iffP orP) => [] [] /eqP; intuition. Qed. Lemma in_mset2 x a b : (x \in [mset a; b]) = (x == a) || (x == b). Proof. by rewrite !inE. Qed. Lemma mset21 a b : a \in [mset a; b]. Proof. by rewrite mset1D1. Qed. Lemma mset22 a b : b \in [mset a; b]. Proof. by rewrite in_mset2 eqxx orbT. Qed. Lemma msetUP x A B : reflect (x \in A \/ x \in B) (x \in A `|` B). Proof. by rewrite !inE; exact: orP. Qed. Lemma msetDP x A B : reflect (x \in A \/ x \in B) (x \in A `+` B). Proof. by rewrite !inE; exact: orP. Qed. Lemma msetULVR x A B : x \in A `|` B -> (x \in A) + (x \in B). Proof. by rewrite inE; case: (x \in A); [left|right]. Qed. Lemma msetDLVR x A B : x \in A `+` B -> (x \in A) + (x \in B). Proof. by rewrite inE; case: (x \in A); [left|right]. Qed. (* distribute /cancel *) Lemma msetIUr A B C : A `&` (B `|` C) = (A `&` B) `|` (A `&` C). Proof. by apply/msetP=> x; rewrite !msetE minn_maxr. Qed. Lemma msetIUl A B C : (A `|` B) `&` C = (A `&` C) `|` (B `&` C). Proof. by apply/msetP=> x; rewrite !msetE minn_maxl. Qed. Lemma msetUIr A B C : A `|` (B `&` C) = (A `|` B) `&` (A `|` C). Proof. by apply/msetP=> x; rewrite !msetE maxn_minr. Qed. Lemma msetUIl A B C : (A `&` B) `|` C = (A `|` C) `&` (B `|` C). Proof. by apply/msetP=> x; rewrite !msetE maxn_minl. Qed. Lemma msetUKC A B : (A `|` B) `&` A = A. Proof. by apply/msetP=> x; rewrite !msetE maxnK. Qed. Lemma msetUK A B : (B `|` A) `&` A = A. Proof. by rewrite msetUC msetUKC. Qed. Lemma msetKUC A B : A `&` (B `|` A) = A. Proof. by rewrite msetIC msetUK. Qed. Lemma msetKU A B : A `&` (A `|` B) = A. Proof. by rewrite msetIC msetUKC. Qed. Lemma msetIKC A B : (A `&` B) `|` A = A. Proof. by apply/msetP=> x; rewrite !msetE minnK. Qed. Lemma msetIK A B : (B `&` A) `|` A = A. Proof. by rewrite msetIC msetIKC. Qed. Lemma msetKIC A B : A `|` (B `&` A) = A. Proof. by rewrite msetUC msetIK. Qed. Lemma msetKI A B : A `|` (A `&` B) = A. Proof. by rewrite msetIC msetKIC. Qed. Lemma msetUKid A B : B `|` A `|` A = B `|` A. Proof. by rewrite -msetUA msetUid. Qed. Lemma msetUKidC A B : A `|` B `|` A = A `|` B. Proof. by rewrite msetUAC msetUid. Qed. Lemma msetKUid A B : A `|` (A `|` B) = A `|` B. Proof. by rewrite msetUA msetUid. Qed. Lemma msetKUidC A B : A `|` (B `|` A) = B `|` A. Proof. by rewrite msetUCA msetUid. Qed. Lemma msetIKid A B : B `&` A `&` A = B `&` A. Proof. by rewrite -msetIA msetIid. Qed. Lemma msetIKidC A B : A `&` B `&` A = A `&` B. Proof. by rewrite msetIAC msetIid. Qed. Lemma msetKIid A B : A `&` (A `&` B) = A `&` B. Proof. by rewrite msetIA msetIid. Qed. Lemma msetKIidC A B : A `&` (B `&` A) = B `&` A. Proof. by rewrite msetICA msetIid. Qed. Lemma msetDIr A B C : A `+` (B `&` C) = (A `+` B) `&` (A `+` C). Proof. by apply/msetP=> x; rewrite !msetE addn_minr. Qed. Lemma msetDIl A B C : (A `&` B) `+` C = (A `+` C) `&` (B `+` C). Proof. by apply/msetP=> x; rewrite !msetE addn_minl. Qed. Lemma msetDKIC A B : (A `+` B) `&` A = A. Proof. by apply/msetP=> x; rewrite !msetE (minn_idPr _) // leq_addr. Qed. Lemma msetDKI A B : (B `+` A) `&` A = A. Proof. by rewrite msetDC msetDKIC. Qed. Lemma msetKDIC A B : A `&` (B `+` A) = A. Proof. by rewrite msetIC msetDKI. Qed. Lemma msetKDI A B : A `&` (A `+` B) = A. Proof. by rewrite msetDC msetKDIC. Qed. (* adjunction / subtraction *) Lemma msetDKB A : cancel (msetD A) (msetB^~ A). Proof. by move=> B; apply/msetP => a; rewrite !msetE addKn. Qed. Lemma msetDKBC A : cancel (msetD^~ A) (msetB^~ A). Proof. by move=> B; rewrite msetDC msetDKB. Qed. Lemma msetBSKl A B a : ((a +` A) `\` B) `\ a = A `\` B. Proof. (* Goal: @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K (@msetB K (@msetD K (@msetn K (S O) a) A) B) (@msetn K (S O) a)) (@msetB K A B) *) apply/msetP=> b; rewrite !msetE; case: ifPn; rewrite ?add0n ?subn0 //. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite add1n subn1 subSKn. Qed. Lemma msetBDl C A B : (C `+` A) `\` (C `+` B) = A `\` B. Proof. by apply/msetP=> a; rewrite !msetE subnDl. Qed. Lemma msetBDr C A B : (A `+` C) `\` (B `+` C) = A `\` B. Proof. by apply/msetP=> a; rewrite !msetE subnDr. Qed. Lemma msetBDA A B C : B `\` (A `+` C) = B `\` A `\` C. Proof. by apply/msetP=> a; rewrite !msetE subnDA. Qed. Lemma msetUE A B C : msetU A B = A `+` (B `\` A). Proof. by apply/msetP=> a; rewrite !msetE maxnE. Qed. (* subset *) Lemma msubsetP {A B} : reflect (forall x, A x <= B x) (A `<=` B). Proof. (* Goal: Bool.reflect (forall x : Choice.sort K, is_true (leq (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) A x) (@fun_of_fsfun K nat_eqType (fun _ : Choice.sort K => O) B x))) (@msubset K A B) *) apply: (iffP forallP)=> // ? x; case: (in_fsetP (finsupp A) x) => //. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite msuppE => /mset_eq0P->. Qed. Lemma msubset_subset {A B} : A `<=` B -> {subset A <= B}. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /msubsetP AB x; rewrite !in_mset => ?; exact: (leq_trans _ (AB _)). Qed. Lemma msetB_eq0 (A B : {mset K}) : (A `\` B == mset0) = (A `<=` B). Proof. apply/mset_eqP/msubsetP => AB a; by have := AB a; rewrite !msetE -subn_eq0 => /eqP. Qed. Lemma msubset_refl A : A `<=` A. Proof. exact/msubsetP. Qed. Hint Resolve msubset_refl. Lemma msubset_trans : transitive (@msubset K). Proof. (* Goal: @transitive (@multiset_of K (Phant (Choice.sort K))) (@msubset K) *) move=> y x z /msubsetP xy /msubsetP yz ; apply/msubsetP => a. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply: (leq_trans (xy _)). Qed. Arguments msubset_trans {C A B} _ _ : rename. Lemma msetUS C A B : A `<=` B -> C `|` A `<=` C `|` B. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> sAB; apply/msubsetP=> x; rewrite !msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite geq_max !leq_max leqnn (msubsetP sAB) orbT. Qed. Lemma msetDS C A B : A `<=` B -> C `+` A `<=` C `+` B. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /msubsetP sAB; apply/msubsetP=> x; rewrite !msetE leq_add2l. Qed. Lemma msetSU C A B : A `<=` B -> A `|` C `<=` B `|` C. Proof. by move=> sAB; rewrite -!(msetUC C) msetUS. Qed. Lemma msetSD C A B : A `<=` B -> A `+` C `<=` B `+` C. Proof. by move=> sAB; rewrite -!(msetDC C) msetDS. Qed. Lemma msetUSS A B C D : A `<=` C -> B `<=` D -> A `|` B `<=` C `|` D. Proof. by move=> /(msetSU B) /msubset_trans sAC /(msetUS C)/sAC. Qed. Lemma msetDSS A B C D : A `<=` C -> B `<=` D -> A `+` B `<=` C `+` D. Proof. by move=> /(msetSD B) /msubset_trans sAC /(msetDS C)/sAC. Qed. Lemma msetIidPl {A B} : reflect (A `&` B = A) (A `<=` B). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply: (iffP msubsetP) => [?|<- a]; last by rewrite !msetE geq_min leqnn orbT. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/msetP => a; rewrite !msetE (minn_idPl _). Qed. Lemma msetIidPr {A B} : reflect (A `&` B = B) (B `<=` A). Proof. by rewrite msetIC; apply: msetIidPl. Qed. Lemma msubsetIidl A B : (A `<=` A `&` B) = (A `<=` B). Proof. (* Goal: @eq bool (@msubset K A (@msetI K A B)) (@msubset K A B) *) apply/msubsetP/msubsetP=> sAB a; have := sAB a; rewrite !msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite leq_min leqnn. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move/minn_idPl->. Qed. Lemma msubsetIidr A B : (B `<=` A `&` B) = (B `<=` A). Proof. by rewrite msetIC msubsetIidl. Qed. Lemma msetUidPr A B : reflect (A `|` B = B) (A `<=` B). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply: (iffP msubsetP) => [AB|<- a]; last by rewrite !msetE leq_max leqnn. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/msetP=> a; rewrite !msetE (maxn_idPr _). Qed. Lemma msetUidPl A B : reflect (A `|` B = A) (B `<=` A). Proof. by rewrite msetUC; apply/msetUidPr. Qed. Lemma msubsetUl A B : A `<=` A `|` B. Proof. by apply/msubsetP=> a; rewrite !msetE leq_maxl. Qed. Hint Resolve msubsetUl. Lemma msubsetUr A B : B `<=` (A `|` B). Proof. by rewrite msetUC. Qed. Hint Resolve msubsetUr. Lemma msubsetU1 x A : A `<=` (x |` A). Proof. by rewrite msubsetUr. Qed. Hint Resolve msubsetU1. Lemma msubsetU A B C : (A `<=` B) || (A `<=` C) -> A `<=` (B `|` C). Proof. by move=> /orP [] /msubset_trans ->. Qed. Lemma eqEmsubset A B : (A == B) = (A `<=` B) && (B `<=` A). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply/eqP/andP => [<-|[/msubsetP AB /msubsetP BA]]; first by split. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/msetP=> a; apply/eqP; rewrite eqn_leq AB BA. Qed. Lemma msubEproper A B : A `<=` B = (A == B) || (A `<` B). Proof. by rewrite eqEmsubset -andb_orr orbN andbT. Qed. Lemma mproper_sub A B : A `<` B -> A `<=` B. Proof. by rewrite msubEproper orbC => ->. Qed. Lemma eqVmproper A B : A `<=` B -> A = B \/ A `<` B. Proof. by rewrite msubEproper => /predU1P. Qed. Lemma mproperEneq A B : A `<` B = (A != B) && (A `<=` B). Proof. by rewrite andbC eqEmsubset negb_and andb_orr andbN. Qed. Lemma mproper_neq A B : A `<` B -> A != B. Proof. by rewrite mproperEneq; case/andP. Qed. Lemma eqEmproper A B : (A == B) = (A `<=` B) && ~~ (A `<` B). Proof. by rewrite negb_and negbK andb_orr andbN eqEmsubset. Qed. Lemma msub0set A : msubset mset0 A. Proof. by apply/msubsetP=> x; rewrite msetE. Qed. Hint Resolve msub0set. Lemma msubset0 A : (A `<=` mset0) = (A == mset0). Proof. by rewrite eqEmsubset msub0set andbT. Qed. Lemma mproper0 A : (mproper mset0 A) = (A != mset0). Proof. by rewrite /mproper msub0set msubset0. Qed. Lemma mproperE A B : (A `<` B) = (A `<=` B) && ~~ (msubset B A). Proof. by []. Qed. Lemma mproper_sub_trans B A C : A `<` B -> B `<=` C -> A `<` C. Proof. (* Goal: forall (_ : is_true (@msubset K A B)) (_ : is_true (@mproper K B C)), is_true (@mproper K A C) *) move=> /andP [AB NBA] BC; rewrite /mproper (msubset_trans AB) //=. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply: contra NBA=> /(msubset_trans _)->. Qed. Lemma msub_proper_trans B A C : A `<=` B -> B `<` C -> A `<` C. Proof. (* Goal: forall (_ : is_true (@msubset K A B)) (_ : is_true (@mproper K B C)), is_true (@mproper K A C) *) move=> AB /andP [CB NCB]; rewrite /mproper (msubset_trans AB) //=. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply: contra NCB=> /msubset_trans->. Qed. Lemma msubset_neq0 A B : A `<=` B -> A != mset0 -> B != mset0. Proof. by rewrite -!mproper0 => sAB /mproper_sub_trans->. Qed. (* msub is a morphism *) Lemma msetBDKC A B : A `<=` B -> A `+` (B `\` A) = B. Proof. by move=> /msubsetP AB; apply/msetP=> a; rewrite !msetE subnKC. Qed. Lemma msetBDK A B : A `<=` B -> B `\` A `+` A = B. Proof. by move=> /msubsetP AB; apply/msetP => a; rewrite !msetE subnK. Qed. Lemma msetBBK A B : A `<=` B -> B `\` (B `\` A) = A. Proof. by move=> /msubsetP AB; apply/msetP => a; rewrite !msetE subKn. Qed. Lemma msetBD1K A B a : A `<=` B -> A a < B a -> a +` (B `\` (a +` A)) = B `\` A. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> /msubsetP AB ABa; apply/msetP => b; rewrite !msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by case: ifP => //= /eqP->; rewrite !add1n subnSK. Qed. Lemma subset_msetBLR A B C : (msubset (A `\` B) C) = (A `<=` B `+` C). Proof. apply/msubsetP/msubsetP => [] sABC a; by have := sABC a; rewrite !msetE ?leq_subLR. Qed. Lemma msetnP n x a : reflect (0 < n /\ x = a) (x \in msetn n a). Proof. by do [apply: (iffP idP); rewrite !inE] => [/andP[]|[]] -> /eqP. Qed. Lemma gt0_msetnP n x a : 0 < n -> reflect (x = a) (x \in msetn n a). Proof. by move=> n_gt0; rewrite inE n_gt0 /=; exact: eqP. Qed. Lemma msetn1 n a : a \in msetn n a = (n > 0). Proof. by rewrite inE eqxx andbT. Qed. Lemma mset1P x a : reflect (x = a) (x \in [mset a]). Proof. by rewrite inE; exact: eqP. Qed. Lemma mset11 a : a \in [mset a]. Proof. by rewrite inE /=. Qed. Lemma msetn_inj n : n > 0 -> injective (@msetn K n). Proof. (* Goal: @transitive (@multiset_of K (Phant (Choice.sort K))) (@msubset K) *) move=> n_gt0 a b eqsab; apply/(gt0_msetnP _ _ n_gt0). (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite -eqsab inE n_gt0 eqxx. Qed. Lemma mset1UP x a B : reflect (x = a \/ x \in B) (x \in a |` B). Proof. by rewrite !inE; exact: predU1P. Qed. Lemma mset_cons a s : seq_mset (a :: s) = a +` (seq_mset s). Proof. by apply/msetP=> x; rewrite !msetE /= eq_sym. Qed. (* intersection *) Lemma msetIP x A B : reflect (x \in A /\ x \in B) (x \in A `&` B). Proof. by rewrite inE; apply: andP. Qed. Lemma msetIS C A B : A `<=` B -> C `&` A `<=` C `&` B. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> sAB; apply/msubsetP=> x; rewrite !msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite leq_min !geq_min leqnn (msubsetP sAB) orbT. Qed. Lemma msetSI C A B : A `<=` B -> A `&` C `<=` B `&` C. Proof. by move=> sAB; rewrite -!(msetIC C) msetIS. Qed. Lemma msetISS A B C D : A `<=` C -> B `<=` D -> A `&` B `<=` C `&` D. Proof. by move=> /(msetSI B) /msubset_trans sAC /(msetIS C) /sAC. Qed. (* difference *) Lemma msetSB C A B : A `<=` B -> A `\` C `<=` B `\` C. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /msubsetP sAB; apply/msubsetP=> x; rewrite !msetE leq_sub2r. Qed. Lemma msetBS C A B : A `<=` B -> C `\` B `<=` C `\` A. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /msubsetP sAB; apply/msubsetP=> x; rewrite !msetE leq_sub2l. Qed. Lemma msetBSS A B C D : A `<=` C -> D `<=` B -> A `\` B `<=` C `\` D. Proof. by move=> /(msetSB B) /msubset_trans sAC /(msetBS C) /sAC. Qed. Lemma msetB0 A : A `\` mset0 = A. Proof. by apply/msetP=> x; rewrite !msetE subn0. Qed. Lemma mset0B A : mset0 `\` A = mset0. Proof. by apply/msetP=> x; rewrite !msetE sub0n. Qed. Lemma msetBxx A : A `\` A = mset0. Proof. by apply/msetP=> x; rewrite !msetE subnn. Qed. (* other inclusions *) Lemma msubsetIl A B : A `&` B `<=` A. Proof. by apply/msubsetP=> x; rewrite msetE geq_minl. Qed. Lemma msubsetIr A B : A `&` B `<=` B. Proof. by apply/msubsetP=> x; rewrite msetE geq_minr. Qed. Lemma msubsetDl A B : A `\` B `<=` A. Proof. by apply/msubsetP=> x; rewrite msetE leq_subLR leq_addl. Qed. Lemma msubD1set A x : A `\ x `<=` A. Proof. by rewrite msubsetDl. Qed. Hint Resolve msubsetIl msubsetIr msubsetDl msubD1set. (* cardinal lemmas for msets *) Lemma mem_mset1U a A : a \in A -> a |` A = A. Proof. (* Goal: forall _ : is_true (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A)), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetU K (@msetn K (S O) a) A) A *) rewrite in_mset => aA; apply/msetP => x; rewrite !msetE (maxn_idPr _) //. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by have [->|//] := altP eqP; rewrite (leq_trans _ aA). Qed. Lemma mem_msetD1 a A : a \notin A -> A `\ a = A. Proof. (* Goal: forall _ : is_true (negb (@in_mem (Choice.sort K) a (@mem (Equality.sort (Choice.eqType K)) (multiset_predType K) A))), @eq (@multiset_of K (Phant (Choice.sort K))) (@msetB K A (@msetn K (S O) a)) A *) move=> /mset_eq0P aA; apply/msetP => x; rewrite !msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by have [->|] := altP eqP; rewrite ?aA ?subn0. Qed. Lemma msetIn a A n : A `&` msetn n a = msetn (minn (A a) n) a. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply/msetP => x; rewrite !msetE; have [->|] := altP eqP; rewrite ?minn0. Qed. Lemma msubIset A B C : (B `<=` A) || (C `<=` A) -> (B `&` C `<=` A). Proof. by case/orP; apply: msubset_trans; rewrite (msubsetIl, msubsetIr). Qed. Lemma msubsetI A B C : (A `<=` B `&` C) = (A `<=` B) && (A `<=` C). Proof. (* Goal: @eq bool (@msubset K A (@msetI K B C)) (andb (@msubset K A B) (@msubset K A C)) *) rewrite !(sameP msetIidPl eqP) msetIA; have [-> //| ] := altP (A `&` B =P A). (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply: contraNF => /eqP <-; rewrite -msetIA -msetIIl msetIAC. Qed. Lemma msubsetIP A B C : reflect (A `<=` B /\ A `<=` C) (A `<=` B `&` C). Proof. by rewrite msubsetI; exact: andP. Qed. Lemma msubUset A B C : (B `|` C `<=` A) = (B `<=` A) && (C `<=` A). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply/idP/idP => [subA|/andP [AB CA]]; last by rewrite -[A]msetUid msetUSS. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite !(msubset_trans _ subA). Qed. Lemma msubUsetP A B C : reflect (A `<=` C /\ B `<=` C) (A `|` B `<=` C). Proof. by rewrite msubUset; exact: andP. Qed. Lemma msetU_eq0 A B : (A `|` B == mset0) = (A == mset0) && (B == mset0). Proof. by rewrite -!msubset0 msubUset. Qed. Lemma setD_eq0 A B : (A `\` B == mset0) = (A `<=` B). Proof. by rewrite -msubset0 subset_msetBLR msetD0. Qed. Lemma msub1set A a : ([mset a] `<=` A) = (a \in A). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply/msubsetP/idP; first by move/(_ a); rewrite msetnxx in_mset. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> ainA b; rewrite msetnE; case: eqP => // ->; rewrite -in_mset. Qed. Lemma msetDBA A B C : C `<=` B -> A `+` B `\` C = (A `+` B) `\` C. Proof. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /msubsetP CB; apply/msetP=> a; rewrite !msetE2 addnBA. Qed. Lemma mset_0Vmem A : (A = mset0) + {x : K | x \in A}. Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) have [/fsetP Aisfset0 | [a ainA]] := fset_0Vmem (finsupp A); last first. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by right; exists a; rewrite -msuppE. left; apply/msetP => a; rewrite mset0E; apply/mset_eq0P. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by rewrite -msuppE Aisfset0 inE. Qed. Definition size_mset A : size A = \sum_(a <- finsupp A) A a. Proof. by rewrite -sum1_size sum_mset; apply: eq_bigr => i; rewrite muln1. Qed. Lemma size_mset0 : size (mset0 : {mset K}) = 0. Proof. by rewrite -sum1_size big_mset0. Qed. From mathcomp Require Import tuple. Lemma sum_nat_seq_eq0 (I : eqType) r (P : pred I) (E : I -> nat) : (\sum_(i <- r | P i) E i == 0) = all [pred i | P i ==> (E i == 0)] r. Proof. (* Goal: @eq bool (@eq_op nat_eqType (@BigOp.bigop nat (Equality.sort I) O r (fun i : Equality.sort I => @BigBody nat (Equality.sort I) i addn (P i) (E i))) O) (@all (Equality.sort I) (@pred_of_simpl (Equality.sort I) (@SimplPred (Equality.sort I) (fun i : Equality.sort I => implb (P i) (@eq_op nat_eqType (E i) O)))) r) *) rewrite big_tnth sum_nat_eq0; apply/forallP/allP => /= HE x. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by move=> /seq_tnthP[i ->]; apply: HE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by apply: HE; rewrite mem_tnth. Qed. Lemma size_mset_eq0 A : (size A == 0) = (A == mset0). Proof. (* Goal: @eq bool (@msubset K (@msetU K B C) A) (andb (@msubset K B A) (@msubset K C A)) *) apply/idP/eqP => [|->]; last by rewrite size_mset0. rewrite size_mset sum_nat_seq_eq0 => /allP AP. apply/msetP => a /=; rewrite msetE. (* Goal: is_true (implb (P (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) (@eq_op nat_eqType (E (@tnth (@size (Equality.sort I) r) (Equality.sort I) (@in_tuple (Equality.sort I) r) x)) O)) *) by have /= := AP a; case: finsuppP => // _ /(_ _)/eqP->. Qed. End MSetTheory.

From mathcomp Require Import ssreflect ssrbool eqtype ssrfun ssrnat choice seq. From mathcomp Require Import fintype tuple bigop path. (***********************************************************************) (* Experimental library of generic sets *) (* ==================================== *) (* Contains two structures: *) (* semisetType == families of sets, without total set (e.g. {fset T}) *) (* setType == families of sets, with total set *) (* (e.g. {set T} or {SAset R^n}) *) (***********************************************************************) From mathcomp Require Import order. Set Implicit Arguments. Unset Strict Implicit. Unset Printing Implicit Defensive. Reserved Notation "x \subset y" (at level 70, y at next level). Reserved Notation "x \contains y" (at level 70, y at next level, only parsing). Reserved Notation "x \proper y" (at level 70, y at next level). Reserved Notation "x \containsproper y" (at level 70, y at next level, only parsing). Reserved Notation "x \subset y :> T" (at level 70, y at next level). Reserved Notation "x \contains y :> T" (at level 70, y at next level, only parsing). Reserved Notation "x \proper y :> T" (at level 70, y at next level). Reserved Notation "x \containsproper y :> T" (at level 70, y at next level, only parsing). Reserved Notation "\subsets y" (at level 35). Reserved Notation "\supersets y" (at level 35). Reserved Notation "\propersets y" (at level 35). Reserved Notation "\superpropersets y" (at level 35). Reserved Notation "\subsets y :> T" (at level 35, y at next level). Reserved Notation "\supersets y :> T" (at level 35, y at next level). Reserved Notation "\propersets y :> T" (at level 35, y at next level). Reserved Notation "\superpropersets y :> T" (at level 35, y at next level). Reserved Notation "x \subset y \subset z" (at level 70, y, z at next level). Reserved Notation "x \proper y \subset z" (at level 70, y, z at next level). Reserved Notation "x \subset y \proper z" (at level 70, y, z at next level). Reserved Notation "x \proper y \proper z" (at level 70, y, z at next level). Reserved Notation "x \subset y ?= 'iff' c" (at level 70, y, c at next level, format "x '[hv' \subset y '/' ?= 'iff' c ']'"). Reserved Notation "x \subset y ?= 'iff' c :> T" (at level 70, y, c at next level, format "x '[hv' \subset y '/' ?= 'iff' c :> T ']'"). Reserved Notation "~: A" (at level 35, right associativity). Reserved Notation "[ 'set' ~ a ]" (at level 0, format "[ 'set' ~ a ]"). Reserved Notation "[ 'set' a1 ; a2 ; .. ; an ]" (at level 0, a1 at level 99, format "[ 'set' a1 ; a2 ; .. ; an ]"). Delimit Scope abstract_set_scope with set. Local Open Scope abstract_set_scope. Module SET. Import Order.Theory Order.Syntax Order.Def. Fact display_set : unit -> unit. Proof. exact. Qed. Module Import SetSyntax. Notation "\sub%set" := (@le (display_set _) _) : abstract_set_scope. Notation "\super%set" := (@ge (display_set _) _) : abstract_set_scope. Notation "\proper%set" := (@lt (display_set _) _) : abstract_set_scope. Notation "\superproper%set" := (@gt (display_set _) _) : abstract_set_scope. Notation "\sub?%set" := (@leif (display_set _) _) : abstract_set_scope. Notation "\subsets y" := (\super%set y) : abstract_set_scope. Notation "\subsets y :> T" := (\subsets (y : T)) : abstract_set_scope. Notation "\supersets y" := (\sub%set y) : abstract_set_scope. Notation "\supersets y :> T" := (\supersets (y : T)) : abstract_set_scope. Notation "\propersets y" := (\superproper%set y) : abstract_set_scope. Notation "\propersets y :> T" := (\propersets (y : T)) : abstract_set_scope. Notation "\superpropersets y" := (\proper%set y) : abstract_set_scope. Notation "\superpropersets y :> T" := (\superpropersets (y : T)) : abstract_set_scope. Notation "x \subset y" := (\sub%set x y) : abstract_set_scope. Notation "x \subset y :> T" := ((x : T) \subset (y : T)) : abstract_set_scope. Notation "x \proper y" := (\proper%set x y) : abstract_set_scope. Notation "x \proper y :> T" := ((x : T) \proper (y : T)) : abstract_set_scope. Notation "x \subset y \subset z" := ((x \subset y)%set && (y \subset z)%set) : abstract_set_scope. Notation "x \proper y \subset z" := ((x \proper y)%set && (y \subset z)%set) : abstract_set_scope. Notation "x \subset y \proper z" := ((x \subset y)%set && (y \proper z)%set) : abstract_set_scope. Notation "x \proper y \proper z" := ((x \proper y)%set && (y \proper z)%set) : abstract_set_scope. Notation "x \subset y ?= 'iff' C" := (\sub?%set x y C) : abstract_set_scope. Notation "x \subset y ?= 'iff' C :> R" := ((x : R) \subset (y : R) ?= iff C) (only parsing) : abstract_set_scope. Notation set0 := (@bottom (display_set _) _). Notation setT := (@top (display_set _) _). Notation setU := (@join (display_set _) _). Notation setI := (@meet (display_set _) _). Notation setD := (@sub (display_set _) _). Notation setC := (@compl (display_set _) _). Notation "x :&: y" := (setI x y). Notation "x :|: y" := (setU x y). Notation "x :\: y" := (setD x y). Notation "~: x" := (setC x). Notation "x \subset y" := (\sub%set x y) : bool_scope. Notation "x \proper y" := (\proper%set x y) : bool_scope. End SetSyntax. Ltac EqualityPack cT xclass xT := match type of Equality.Pack with | forall sort : Type, Equality.mixin_of sort -> eqType => (* mathcomp.dev *) exact (@Equality.Pack cT xclass) | _ => (* mathcomp <= 1.7 *) exact (@Equality.Pack cT xclass xT) end. Ltac ChoicePack cT xclass xT := match type of Choice.Pack with | forall sort : Type, Choice.class_of sort -> choiceType => (* mathcomp.dev *) exact (@Choice.Pack cT xclass) | _ => (* mathcomp <= 1.7 *) exact (@Choice.Pack cT xclass xT) end. Module Semiset. Section ClassDef. Variable elementType : Type. (* Universe type *) Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Implicit Types (X Y : elementType). Structure mixin_of d (set : elementType -> (cblatticeType (display_set d))) := Mixin { memset : forall X, set X -> X -> bool; set1 : forall X, X -> set X; _ : forall X (x : X), ~~ memset set0 x; (* set0 is empty instead *) _ : forall X (x y : X), memset (set1 y) x = (x == y); _ : forall X (x : X) A, (set1 x \subset A) = (memset A x); _ : forall X (A : set X), (set0 \proper A) -> {x | memset A x} ; (* exists or sig ?? *) _ : forall X (A B : set X), {subset memset A <= memset B} -> A \subset B; _ : forall X (x : X) A B, (memset (A :|: B) x) = (memset A x) || (memset B x); (* there is no closure in a set *) funsort : elementType -> elementType -> Type; fun_of_funsort : forall X Y, funsort X Y -> X -> Y; imset : forall X Y, funsort X Y -> set X -> set Y; _ : forall X Y (f : funsort X Y) (A : set X) (y : Y), reflect (exists2 x : X, memset A x & y = fun_of_funsort f x) (memset (imset f A) y) }. Record class_of d (set : elementType -> Type) := Class { base : forall X, @Order.CBLattice.class_of (display_set d) (set X); mixin : mixin_of (fun X => Order.CBLattice.Pack (base X) (set X)) }. Local Coercion base : class_of >-> Funclass. Structure type d := Pack { sort ; _ : class_of d sort; _ : elementType -> Type }. Local Coercion sort : type >-> Funclass. Variables (set : elementType -> Type) (disp : unit) (cT : type disp). Definition class := let: Pack _ c _ as cT' := cT return class_of _ cT' in c. Definition clone disp' c of (disp = disp') & phant_id class c := @Pack disp' set c set. Let xset := let: Pack set _ _ := cT in set. Notation xclass := (class : class_of _ xset). Definition pack b0 (m0 : mixin_of (fun X=> @Order.CBLattice.Pack (display_set disp) (set X) (b0 X) (set X))) := fun bT b & (forall X, phant_id (@Order.CBLattice.class (display_set disp) (bT X)) (b X)) => fun m & phant_id m0 m => Pack (@Class disp set b m) set. End ClassDef. Section CanonicalDef. Variable elementType : Type. Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Notation type := (type eqType_of_elementType). Local Coercion base : class_of >-> Funclass. Local Coercion sort : type >-> Funclass. Variables (set : elementType -> Type) (X : elementType). Variables (disp : unit) (cT : type disp). Local Notation ddisp := (display_set disp). Let xset := let: Pack set _ _ := cT in set. Notation xclass := (@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset). Definition eqType := ltac:(EqualityPack (cT X) ((@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset) X) (xset X)). Definition choiceType := ltac:(ChoicePack (cT X) ((@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset) X) (xset X)). Definition porderType := @Order.POrder.Pack ddisp (cT X) (xclass X) (xset X). Definition latticeType := @Order.Lattice.Pack ddisp (cT X) (xclass X) (xset X). Definition blatticeType := @Order.BLattice.Pack ddisp (cT X) (xclass X) (xset X). Definition cblatticeType := @Order.CBLattice.Pack ddisp (cT X) (xclass X) (xset X). End CanonicalDef. Module Import Exports. Coercion mixin : class_of >-> mixin_of. Coercion base : class_of >-> Funclass. Coercion sort : type >-> Funclass. Coercion eqType : type >-> Equality.type. Coercion choiceType : type >-> Choice.type. Coercion porderType : type >-> Order.POrder.type. Coercion latticeType : type >-> Order.Lattice.type. Coercion blatticeType : type >-> Order.BLattice.type. Coercion cblatticeType : type >-> Order.CBLattice.type. Canonical eqType. Canonical choiceType. Canonical porderType. Canonical latticeType. Canonical blatticeType. Canonical cblatticeType. Notation semisetType := type. Notation semisetMixin := mixin_of. Notation SemisetMixin := Mixin. Notation SemisetType set m := (@pack _ _ set _ _ m _ _ (fun=> id) _ id). Notation "[ 'semisetType' 'of' set 'for' cset ]" := (@clone _ _ set _ cset _ _ erefl id) (at level 0, format "[ 'semisetType' 'of' set 'for' cset ]") : form_scope. Notation "[ 'semisetType' 'of' set 'for' cset 'with' disp ]" := (@clone _ _ set _ cset disp _ (unit_irrelevance _ _) id) (at level 0, format "[ 'semisetType' 'of' set 'for' cset 'with' disp ]") : form_scope. Notation "[ 'semisetType' 'of' set ]" := [semisetType of set for _] (at level 0, format "[ 'semisetType' 'of' set ]") : form_scope. Notation "[ 'semisetType' 'of' set 'with' disp ]" := [semisetType of set for _ with disp] (at level 0, format "[ 'semisetType' 'of' set 'with' disp ]") : form_scope. End Exports. End Semiset. Import Semiset.Exports. Section SemisetOperations. Context {elementType : Type} {eqType_of_elementType : elementType -> eqType}. Coercion eqType_of_elementType : elementType >-> eqType. Context {disp : unit}. Section setfun. Variable (set : semisetType eqType_of_elementType disp). Definition setfun := Semiset.funsort (Semiset.class set). Definition fun_of_setfun X Y (f : setfun X Y) : X -> Y := @Semiset.fun_of_funsort _ _ _ _ (Semiset.class set) _ _ f. Coercion fun_of_setfun : setfun >-> Funclass. End setfun. Context {set : semisetType eqType_of_elementType disp}. Variable X Y : elementType. Definition memset : set X -> X -> bool := @Semiset.memset _ _ _ _ (Semiset.class set) _. Definition set1 : X -> set X := @Semiset.set1 _ _ _ _ (Semiset.class set) _. Definition imset : setfun set X Y -> set X -> set Y:= @Semiset.imset _ _ _ _ (Semiset.class set) _ _. Canonical set_predType := Eval hnf in mkPredType memset. Structure setpredType := SetPredType { setpred_sort :> Type; tosetpred : setpred_sort -> pred X; _ : {mem : setpred_sort -> mem_pred X | isMem tosetpred mem}; _ : {pred_fset : setpred_sort -> set X | forall p x, x \in pred_fset p = tosetpred p x} }. Canonical setpredType_predType (fpX : setpredType) := @PredType X (setpred_sort fpX) (@tosetpred fpX) (let: SetPredType _ _ mem _ := fpX in mem). Definition predset (fpX : setpredType) : fpX -> set X := let: SetPredType _ _ _ (exist pred_fset _) := fpX in pred_fset. End SemisetOperations. Module Import SemisetSyntax. Notation "[ 'set' x : T | P ]" := (predset (fun x : T => P%B)) (at level 0, x at level 99, only parsing) : abstract_set_scope. Notation "[ 'set' x | P ]" := [set x : _ | P] (at level 0, x, P at level 99, format "[ 'set' x | P ]") : abstract_set_scope. Notation "[ 'set' x 'in' A ]" := [set x | x \in A] (at level 0, x at level 99, format "[ 'set' x 'in' A ]") : abstract_set_scope. Notation "[ 'set' x : T 'in' A ]" := [set x : T | x \in A] (at level 0, x at level 99, only parsing) : abstract_set_scope. Notation "[ 'set' x : T | P & Q ]" := [set x : T | P && Q] (at level 0, x at level 99, only parsing) : abstract_set_scope. Notation "[ 'set' x | P & Q ]" := [set x | P && Q ] (at level 0, x, P at level 99, format "[ 'set' x | P & Q ]") : abstract_set_scope. Notation "[ 'set' x : T 'in' A | P ]" := [set x : T | x \in A & P] (at level 0, x at level 99, only parsing) : abstract_set_scope. Notation "[ 'set' x 'in' A | P ]" := [set x | x \in A & P] (at level 0, x at level 99, format "[ 'set' x 'in' A | P ]") : abstract_set_scope. Notation "[ 'set' x 'in' A | P & Q ]" := [set x in A | P && Q] (at level 0, x at level 99, format "[ 'set' x 'in' A | P & Q ]") : abstract_set_scope. Notation "[ 'set' x : T 'in' A | P & Q ]" := [set x : T in A | P && Q] (at level 0, x at level 99, only parsing) : abstract_set_scope. Notation "[ 'set' a ]" := (set1 a) (at level 0, a at level 99, format "[ 'set' a ]") : abstract_set_scope. Notation "[ 'set' a : T ]" := [set (a : T)] (at level 0, a at level 99, format "[ 'set' a : T ]") : abstract_set_scope. Notation "a |: y" := ([set a] :|: y) : abstract_set_scope. Notation "x :\ a" := (x :\: [set a]) : abstract_set_scope. Notation "[ 'set' a1 ; a2 ; .. ; an ]" := (setU .. (a1 |: [set a2]) .. [set an]). Notation "f @: A" := (imset f A) (at level 24) : abstract_set_scope. End SemisetSyntax. Module Import SemisetTheory. Section SemisetTheory. Variable elementType : Type. Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Variable disp : unit. Variable set : semisetType eqType_of_elementType disp. Section setX. Variables X : elementType. Implicit Types (x y : X) (A B C : set X). Lemma notin_set0 (x : X) : x \notin (set0 : set X). Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set => [S [base [memset set1 /= H ? ? ? ? ? ? ? ? ?]] ?] /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma in_set1 x y : x \in ([set y] : set X) = (x == y). Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set => [S [base [memset set1 /= ? H ? ? ? ? ? ? ? ?]] ?] /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma sub1set x A : ([set x] \subset A) = (x \in A). Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set A => [S [base [memset set1 /= ? ? H ? ? ? ? ? ? ?]] ?] A /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma set_gt0_ex A : set0 \proper A -> {x | x \in A}. Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set A => [S [base [memset set1 /= ? ? ? H ? ? ? ? ? ?]] ?] A /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma subsetP_subproof A B : {subset A <= B} -> A \subset B. Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set A B => [S [base [memset set1 /= ? ? ? ? H ? ? ? ? ?]] ?] /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma in_setU (x : X) A B : (x \in A :|: B) = (x \in A) || (x \in B). Proof. (* Goal: @eq bool (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) (@join (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) A B))) (orb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) *) rewrite /set1 /in_mem /= /memset. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set A B => [S [base [memset set1 /= ? ? ? ? ? H ? ? ? ?]] ?] /=. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma in_set0 x : x \in (set0 : set X) = false. Proof. by rewrite (negPf (notin_set0 _)). Qed. Lemma subsetP {A B} : reflect {subset A <= B} (A <= B)%O. Proof. (* Goal: is_true (negb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A') (@imset elementType eqType_of_elementType disp set X Y f A))) *) apply: (iffP idP) => [sAB x xA|/subsetP_subproof//]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite -sub1set (le_trans _ sAB) // sub1set. Qed. Lemma setP A B : A =i B <-> A = B. Proof. (* Goal: iff (@eq_mem (Equality.sort (eqType_of_elementType X)) (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A) (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B)) (@eq (@Semiset.sort elementType eqType_of_elementType disp set X) A B) *) split=> [eqAB|->//]; apply/eqP; rewrite eq_le. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) gen have leAB : A B eqAB / A \subset B; last by rewrite !leAB. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply/subsetP => x; rewrite eqAB. Qed. Lemma set1_neq0 (x : X) : [set x] != set0 :> set X. Proof. by apply/negP=> /eqP /setP /(_ x); rewrite in_set0 in_set1 eqxx. Qed. Lemma set1_eq0 x : ([set x] == set0 :> set X) = false. Proof. by rewrite (negPf (set1_neq0 _)). Qed. Lemma set11 x : x \in ([set x] : set X). Proof. by rewrite -sub1set. Qed. Hint Resolve set11. Lemma set1_inj : injective (@set1 _ _ _ set X). Proof. (* Goal: @injective (@Semiset.sort elementType eqType_of_elementType disp set X) (Equality.sort (eqType_of_elementType X)) (@set1 elementType eqType_of_elementType disp set X) *) move=> x y /eqP; rewrite eq_le sub1set => /andP []. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite in_set1 => /eqP. Qed. Lemma set_0Vmem A : (A = set0) + {x : X | x \in A}. Proof. (* Goal: sum (@eq (@Semiset.sort elementType eqType_of_elementType disp set X) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) (@sig (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)))) *) have [|AN0] := eqVneq A set0; [left|right] => //. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move: AN0; rewrite -lt0x => /set_gt0_ex. Qed. Lemma set0Pn A : reflect (exists x, x \in A) (A != set0). Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A (@set1 elementType eqType_of_elementType disp set X x)), @eq bool (orb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) (@set1 elementType eqType_of_elementType disp set X x) A) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set)))) true *) have [->|[x xA]] := set_0Vmem A; rewrite ?eqxx -?lt0x. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by constructor=> [[x]]; rewrite in_set0. (* Goal: Bool.reflect (@ex (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)))) (@lt (display_set disp) (@Order.BLattice.porderType (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set)) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set)) A) *) suff -> : set0 \proper A by constructor; exists x. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move: xA; rewrite -sub1set => /(lt_le_trans _)->; rewrite ?lt0x ?set1_eq0. Qed. Lemma subset1 A x : (A \subset [set x]) = (A == [set x]) || (A == set0). Proof. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) symmetry; rewrite eq_le; have [] /= := boolP (A \subset [set x]); last first. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply: contraNF => /eqP ->; rewrite ?le0x. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A (@set1 elementType eqType_of_elementType disp set X x)), @eq bool (orb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) (@set1 elementType eqType_of_elementType disp set X x) A) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set)))) true *) have [/eqP->|[y yA]] := set_0Vmem A; rewrite ?orbT // ?sub1set. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move=> /subsetP /(_ _ yA); rewrite in_set1 => /eqP<-; rewrite yA. Qed. Lemma eq_set1 (x : X) A : (A == [set x]) = (set0 \proper A \subset [set x]). Proof. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite subset1; have [->|?] := posxP A; rewrite 1?eq_sym ?set1_eq0 ?orbF. Qed. Lemma in_setI A B (x : X) : (x \in A :&: B) = (x \in A) && (x \in B). Proof. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) apply/idP/idP => [xAB|?]; last by rewrite -sub1set lexI !sub1set. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite (subsetP (leIr _ _) _ xAB) (subsetP (leIl _ _) _ xAB). Qed. Lemma set1U A x : [set x] :&: A = if x \in A then [set x] else set0. Proof. (* Goal: @eq (@Semiset.sort elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set)) *) apply/setP => y; rewrite (fun_if (fun E => y \in E)) in_setI in_set1 in_set0. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by have [->|] := altP (y =P x); rewrite ?if_same //; case: (_ \in A). Qed. Lemma set1U_eq0 A x : ([set x] :&: A == set0) = (x \notin A). Proof. by rewrite set1U; case: (x \in A); rewrite ?set1_eq0 ?eqxx. Qed. Lemma in_setD A B x : (x \in A :\: B) = (x \notin B) && (x \in A). Proof. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) apply/idP/idP => [|/andP[xNB xA]]; last first. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite -sub1set leBRL sub1set xA set1U_eq0. (* Goal: sum (@eq (@Semiset.sort elementType eqType_of_elementType disp set X) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) (@sig (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)))) *) rewrite -sub1set leBRL sub1set => /andP [-> dxB]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite -sub1set disj_le ?set1_eq0. Qed. Definition inE := ((in_set0, in_set1, in_setU, in_setI, in_setD), inE). Definition subset_trans B A C := (@le_trans _ _ B A C). Definition proper_trans B A C := (@lt_trans _ _ B A C). Definition sub_proper_trans B A C := (@le_lt_trans _ _ B A C). Definition proper_sub_trans B A C := (@lt_le_trans _ _ B A C). Definition proper_sub A B := (@ltW _ _ A B). Lemma properP A B : reflect (A \subset B /\ (exists2 x, x \in B & x \notin A)) (A \proper B). Proof. (* Goal: is_true (negb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A') (@imset elementType eqType_of_elementType disp set X Y f A))) *) apply: (iffP idP)=> [ltAB|[leAB [x xB xNA]]]. (* Goal: and (is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B)) (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) B))) (fun x : Equality.sort (eqType_of_elementType X) => is_true (negb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A))))) *) (* Goal: is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B) *) rewrite ltW //; split => //; have := lt0B ltAB; rewrite lt0x. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move => /set0Pn [x]; rewrite in_setD => /andP [xNA xB]; exists x. (* Goal: is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B) *) rewrite lt_neqAle leAB andbT; apply: contraTneq xNA. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move=> /setP /(_ x) ->; rewrite xB. Qed. Lemma set1P x y : reflect (x = y) (x \in ([set y] : set X)). Proof. by rewrite in_set1; apply/eqP. Qed. Lemma subset_eqP A B : reflect (A =i B) (A \subset B \subset A)%set. Proof. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) apply: (iffP andP) => [[AB BA] x|eqAB]; first by apply/idP/idP; apply: subsetP. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by split; apply/subsetP=> x; rewrite !eqAB. Qed. Lemma eqEsubset A B : (A == B) = (A \subset B) && (B \subset A). Proof. exact: eq_le. Qed. Lemma properE A B : A \proper B = (A \subset B) && ~~ (B \subset A). Proof. by case: comparableP. Qed. Lemma subEproper A B : A \subset B = (A == B) || (A \proper B). Proof. exact: le_eqVlt. Qed. Lemma eqVproper A B : A \subset B -> A = B \/ A \proper B. Proof. by rewrite subEproper => /predU1P. Qed. Lemma properEneq A B : A \proper B = (A != B) && (A \subset B). Proof. exact: lt_neqAle. Qed. Lemma proper_neq A B : A \proper B -> A != B. Proof. by rewrite properEneq; case/andP. Qed. Lemma eqEproper A B : (A == B) = (A \subset B) && ~~ (A \proper B). Proof. by case: comparableP. Qed. Lemma sub0set A : set0 \subset A. Proof. by apply/subsetP=> x; rewrite inE. Qed. Lemma subset0 A : (A \subset set0) = (A == set0). Proof. by rewrite eqEsubset sub0set andbT. Qed. Lemma proper0 A : (set0 \proper A) = (A != set0). Proof. by rewrite properE sub0set subset0. Qed. Lemma subset_neq0 A B : A \subset B -> A != set0 -> B != set0. Proof. by rewrite -!proper0 => sAB /proper_sub_trans->. Qed. Lemma setU1r x a B : x \in B -> x \in a |: B. Proof. by move=> Bx; rewrite !inE predU1r. Qed. Lemma setU1P x a B : reflect (x = a \/ x \in B) (x \in a |: B). Proof. by rewrite !inE; apply: predU1P. Qed. (* We need separate lemmas for the explicit enumerations since they *) (* associate on the left. *) Lemma set1Ul x A b : x \in A -> x \in A :|: [set b]. Proof. by move=> Ax; rewrite !inE Ax. Qed. Lemma set1Ur A b : b \in A :|: [set b]. Proof. by rewrite !inE eqxx orbT. Qed. Lemma setD1P x A b : reflect (x != b /\ x \in A) (x \in A :\ b). Proof. by rewrite !inE; apply: andP. Qed. Lemma in_setD1 x A b : (x \in A :\ b) = (x != b) && (x \in A) . Proof. by rewrite !inE. Qed. Lemma setD11 b A : (b \in A :\ b) = false. Proof. by rewrite !inE eqxx. Qed. Lemma setD1K a A : a \in A -> a |: (A :\ a) = A. Proof. by move=> Aa; apply/setP=> x; rewrite !inE; case: eqP => // ->. Qed. Lemma setU1K a B : a \notin B -> (a |: B) :\ a = B. Proof. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move/negPf=> nBa; apply/setP=> x; rewrite !inE; case: eqP => // ->. Qed. Lemma set2P x a b : reflect (x = a \/ x = b) (x \in ([set a; b] : set X)). Proof. by rewrite !inE; apply: pred2P. Qed. Lemma in_set2 x a b : (x \in ([set a; b] : set X)) = (x == a) || (x == b). Proof. by rewrite !inE. Qed. Lemma set21 a b : a \in ([set a; b] : set X). Proof. by rewrite !inE eqxx. Qed. Lemma set22 a b : b \in ([set a; b] : set X). Proof. by rewrite !inE eqxx orbT. Qed. Lemma setUP x A B : reflect (x \in A \/ x \in B) (x \in A :|: B). Proof. by rewrite !inE; apply: orP. Qed. Lemma setUC A B : A :|: B = B :|: A. Proof. by apply/setP => x; rewrite !inE orbC. Qed. Lemma setUS A B C : A \subset B -> C :|: A \subset C :|: B. Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B), is_true (@le (display_set disp) (@Order.Lattice.porderType (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set)) (@meet (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) C A) (@meet (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) C B)) *) move=> sAB; apply/subsetP=> x; rewrite !inE. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by case: (x \in C) => //; apply: (subsetP sAB). Qed. Lemma setSU A B C : A \subset B -> A :|: C \subset B :|: C. Proof. by move=> sAB; rewrite -!(setUC C) setUS. Qed. Lemma setUSS A B C D : A \subset C -> B \subset D -> A :|: B \subset C :|: D. Proof. by move=> /(setSU B) /subset_trans sAC /(setUS C)/sAC. Qed. Lemma set0U A : set0 :|: A = A. Proof. by apply/setP => x; rewrite !inE orFb. Qed. Lemma setU0 A : A :|: set0 = A. Proof. by rewrite setUC set0U. Qed. Lemma setUA A B C : A :|: (B :|: C) = A :|: B :|: C. Proof. by apply/setP => x; rewrite !inE orbA. Qed. Lemma setUCA A B C : A :|: (B :|: C) = B :|: (A :|: C). Proof. by rewrite !setUA (setUC B). Qed. Lemma setUAC A B C : A :|: B :|: C = A :|: C :|: B. Proof. by rewrite -!setUA (setUC B). Qed. Lemma setUACA A B C D : (A :|: B) :|: (C :|: D) = (A :|: C) :|: (B :|: D). Proof. by rewrite -!setUA (setUCA B). Qed. Lemma setUid A : A :|: A = A. Proof. by apply/setP=> x; rewrite inE orbb. Qed. Lemma setUUl A B C : A :|: B :|: C = (A :|: C) :|: (B :|: C). Proof. by rewrite setUA !(setUAC _ C) -(setUA _ C) setUid. Qed. Lemma setUUr A B C : A :|: (B :|: C) = (A :|: B) :|: (A :|: C). Proof. by rewrite !(setUC A) setUUl. Qed. (* intersection *) Lemma setIP x A B : reflect (x \in A /\ x \in B) (x \in A :&: B). Proof. by rewrite !inE; apply: andP. Qed. Lemma setIC A B : A :&: B = B :&: A. Proof. by apply/setP => x; rewrite !inE andbC. Qed. Lemma setIS A B C : A \subset B -> C :&: A \subset C :&: B. Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B), is_true (@le (display_set disp) (@Order.Lattice.porderType (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set)) (@meet (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) C A) (@meet (display_set disp) (@Semiset.latticeType elementType eqType_of_elementType X disp set) C B)) *) move=> sAB; apply/subsetP=> x; rewrite !inE. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by case: (x \in C) => //; apply: (subsetP sAB). Qed. Lemma setSI A B C : A \subset B -> A :&: C \subset B :&: C. Proof. by move=> sAB; rewrite -!(setIC C) setIS. Qed. Lemma setISS A B C D : A \subset C -> B \subset D -> A :&: B \subset C :&: D. Proof. by move=> /(setSI B) /subset_trans sAC /(setIS C) /sAC. Qed. Lemma set0I A : set0 :&: A = set0. Proof. by apply/setP => x; rewrite !inE andFb. Qed. Lemma setI0 A : A :&: set0 = set0. Proof. by rewrite setIC set0I. Qed. Lemma setIA A B C : A :&: (B :&: C) = A :&: B :&: C. Proof. by apply/setP=> x; rewrite !inE andbA. Qed. Lemma setICA A B C : A :&: (B :&: C) = B :&: (A :&: C). Proof. by rewrite !setIA (setIC A). Qed. Lemma setIAC A B C : A :&: B :&: C = A :&: C :&: B. Proof. by rewrite -!setIA (setIC B). Qed. Lemma setIACA A B C D : (A :&: B) :&: (C :&: D) = (A :&: C) :&: (B :&: D). Proof. by rewrite -!setIA (setICA B). Qed. Lemma setIid A : A :&: A = A. Proof. by apply/setP=> x; rewrite inE andbb. Qed. Lemma setIIl A B C : A :&: B :&: C = (A :&: C) :&: (B :&: C). Proof. by rewrite setIA !(setIAC _ C) -(setIA _ C) setIid. Qed. Lemma setIIr A B C : A :&: (B :&: C) = (A :&: B) :&: (A :&: C). Proof. by rewrite !(setIC A) setIIl. Qed. (* distribute /cancel *) Lemma setIUr A B C : A :&: (B :|: C) = (A :&: B) :|: (A :&: C). Proof. by apply/setP=> x; rewrite !inE andb_orr. Qed. Lemma setIUl A B C : (A :|: B) :&: C = (A :&: C) :|: (B :&: C). Proof. by apply/setP=> x; rewrite !inE andb_orl. Qed. Lemma setUIr A B C : A :|: (B :&: C) = (A :|: B) :&: (A :|: C). Proof. by apply/setP=> x; rewrite !inE orb_andr. Qed. Lemma setUIl A B C : (A :&: B) :|: C = (A :|: C) :&: (B :|: C). Proof. by apply/setP=> x; rewrite !inE orb_andl. Qed. Lemma setUK A B : (A :|: B) :&: A = A. Proof. by apply/setP=> x; rewrite !inE orbK. Qed. Lemma setKU A B : A :&: (B :|: A) = A. Proof. by apply/setP=> x; rewrite !inE orKb. Qed. Lemma setIK A B : (A :&: B) :|: A = A. Proof. by apply/setP=> x; rewrite !inE andbK. Qed. Lemma setKI A B : A :|: (B :&: A) = A. Proof. by apply/setP=> x; rewrite !inE andKb. Qed. (* difference *) Lemma setDP A B x : reflect (x \in A /\ x \notin B) (x \in A :\: B). Proof. by rewrite inE andbC; apply: andP. Qed. Lemma setSD A B C : A \subset B -> A :\: C \subset B :\: C. Proof. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move=> /subsetP AB; apply/subsetP => x; rewrite !inE => /andP[-> /AB]. Qed. Lemma setDS A B C : A \subset B -> C :\: B \subset C :\: A. Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B), is_true (@le (display_set disp) (@Order.CBLattice.porderType (display_set disp) (@Semiset.cblatticeType elementType eqType_of_elementType X disp set)) (@sub (display_set disp) (@Semiset.cblatticeType elementType eqType_of_elementType X disp set) C B) (@sub (display_set disp) (@Semiset.cblatticeType elementType eqType_of_elementType X disp set) C A)) *) move=> /subsetP AB; apply/subsetP => x; rewrite !inE => /andP[]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by move=> /(contra (AB _)) ->. Qed. Lemma setDSS A B C D : A \subset C -> D \subset B -> A :\: B \subset C :\: D. Proof. by move=> /(setSD B) /subset_trans sAC /(setDS C) /sAC. Qed. Lemma setD0 A : A :\: set0 = A. Proof. exact: subx0. Qed. Lemma set0D A : set0 :\: A = set0. Proof. exact: sub0x. Qed. Lemma setDv A : A :\: A = set0. Proof. exact: subxx. Qed. Lemma setID A B : A :&: B :|: A :\: B = A. Proof. exact: joinIB. Qed. Lemma setDUl A B C : (A :|: B) :\: C = (A :\: C) :|: (B :\: C). Proof. exact: subUx. Qed. Lemma setDUr A B C : A :\: (B :|: C) = (A :\: B) :&: (A :\: C). Proof. exact: subxU. Qed. Lemma setDIl A B C : (A :&: B) :\: C = (A :\: C) :&: (B :\: C). Proof. exact: subIx. Qed. Lemma setIDA A B C : A :&: (B :\: C) = (A :&: B) :\: C. Proof. exact: meetxB. Qed. Lemma setIDAC A B C : (A :\: B) :&: C = (A :&: C) :\: B. Proof. exact: meetBx. Qed. Lemma setDIr A B C : A :\: (B :&: C) = (A :\: B) :|: (A :\: C). Proof. exact: subxI. Qed. Lemma setDDl A B C : (A :\: B) :\: C = A :\: (B :|: C). Proof. exact: subBx. Qed. Lemma setDDr A B C : A :\: (B :\: C) = (A :\: B) :|: (A :&: C). Proof. exact: subxB. Qed. (* other inclusions *) Lemma subsetIl A B : A :&: B \subset A. Proof. by apply/subsetP=> x; rewrite inE; case/andP. Qed. Lemma subsetIr A B : A :&: B \subset B. Proof. by apply/subsetP=> x; rewrite inE; case/andP. Qed. Lemma subsetUl A B : A \subset A :|: B. Proof. by apply/subsetP=> x; rewrite inE => ->. Qed. Lemma subsetUr A B : B \subset A :|: B. Proof. by apply/subsetP=> x; rewrite inE orbC => ->. Qed. Lemma subsetU1 x A : A \subset x |: A. Proof. exact: subsetUr. Qed. Lemma subsetDl A B : A :\: B \subset A. Proof. exact: leBx. Qed. Lemma subD1set A x : A :\ x \subset A. Proof. by rewrite subsetDl. Qed. Lemma setIidPl A B : reflect (A :&: B = A) (A \subset B). Proof. (* Goal: is_true (negb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A') (@imset elementType eqType_of_elementType disp set X Y f A))) *) apply: (iffP subsetP) => [sAB | <- x /setIP[] //]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply/setP=> x; rewrite inE; apply/andb_idr/sAB. Qed. Arguments setIidPl {A B}. Lemma setIidPr A B : reflect (A :&: B = B) (B \subset A). Proof. by rewrite setIC; apply: setIidPl. Qed. Lemma setUidPl A B : reflect (A :|: B = A) (B \subset A). Proof. exact: join_idPr. Qed. Lemma setUidPr A B : reflect (A :|: B = B) (A \subset B). Proof. by rewrite setUC; apply: setUidPl. Qed. Lemma subIset A B C : (B \subset A) || (C \subset A) -> (B :&: C \subset A). Proof. by case/orP; apply: subset_trans; rewrite (subsetIl, subsetIr). Qed. Lemma subsetI A B C : (A \subset B :&: C) = (A \subset B) && (A \subset C). Proof. (* Goal: @eq bool (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A (@sub (display_set disp) (@Semiset.cblatticeType elementType eqType_of_elementType X disp set) B (@set1 elementType eqType_of_elementType disp set X x))) (andb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B) (negb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)))) *) rewrite !(sameP setIidPl eqP) setIA; have [-> //| ] := altP (A :&: B =P A). (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply: contraNF => /eqP <-; rewrite -setIA -setIIl setIAC. Qed. Lemma subsetIP A B C : reflect (A \subset B /\ A \subset C) (A \subset B :&: C). Proof. by rewrite subsetI; apply: andP. Qed. Lemma subsetIidl A B : (A \subset A :&: B) = (A \subset B). Proof. by rewrite subsetI lexx. Qed. Lemma subsetIidr A B : (B \subset A :&: B) = (B \subset A). Proof. by rewrite setIC subsetIidl. Qed. Lemma subUset A B C : (B :|: C \subset A) = (B \subset A) && (C \subset A). Proof. exact: leUx. Qed. Lemma subsetU A B C : (A \subset B) || (A \subset C) -> A \subset B :|: C. Proof. exact: lexU. Qed. Lemma subUsetP A B C : reflect (A \subset C /\ B \subset C) (A :|: B \subset C). Proof. by rewrite subUset; apply: andP. Qed. Lemma subDset A B C : (A :\: B \subset C) = (A \subset B :|: C). Proof. exact: leBLR. Qed. Lemma setU_eq0 A B : (A :|: B == set0) = (A == set0) && (B == set0). Proof. by rewrite -!subset0 subUset. Qed. Lemma setD_eq0 A B : (A :\: B == set0) = (A \subset B). Proof. by rewrite -subset0 subDset setU0. Qed. Lemma subsetD1 A B x : (A \subset B :\ x) = (A \subset B) && (x \notin A). Proof. (* Goal: @eq bool (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A (@sub (display_set disp) (@Semiset.cblatticeType elementType eqType_of_elementType X disp set) B (@set1 elementType eqType_of_elementType disp set X x))) (andb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A B) (negb (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)))) *) rewrite andbC; have [xA|] //= := boolP (x \in A). (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply: contraTF isT => /subsetP /(_ x xA); rewrite !inE eqxx. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A'), is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move=> xNA; apply/subsetP/subsetP => sAB y yA. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by have:= sAB y yA; rewrite !inE => /andP[]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite !inE sAB // andbT; apply: contraNneq xNA => <-. Qed. Lemma subsetD1P A B x : reflect (A \subset B /\ x \notin A) (A \subset B :\ x). Proof. by rewrite subsetD1; apply: andP. Qed. Lemma properD1 A x : x \in A -> A :\ x \proper A. Proof. by move=> Ax; rewrite properE subsetDl /= subsetD1 Ax andbF. Qed. Lemma properIr A B : ~~ (B \subset A) -> A :&: B \proper B. Proof. by move=> nsAB; rewrite properE subsetIr subsetI negb_and nsAB. Qed. Lemma properIl A B : ~~ (A \subset B) -> A :&: B \proper A. Proof. by move=> nsBA; rewrite properE subsetIl subsetI negb_and nsBA orbT. Qed. Lemma properUr A B : ~~ (A \subset B) -> B \proper A :|: B. Proof. by rewrite properE subsetUr subUset lexx /= andbT. Qed. Lemma properUl A B : ~~ (B \subset A) -> A \proper A :|: B. Proof. by move=> not_sBA; rewrite setUC properUr. Qed. Lemma proper1set A x : ([set x] \proper A) -> (x \in A). Proof. by move/proper_sub; rewrite sub1set. Qed. Lemma properIset A B C : (B \proper A) || (C \proper A) -> (B :&: C \proper A). Proof. by case/orP; apply: sub_proper_trans; rewrite (subsetIl, subsetIr). Qed. Lemma properI A B C : (A \proper B :&: C) -> (A \proper B) && (A \proper C). Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A'), is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move=> pAI; apply/andP. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by split; apply: (proper_sub_trans pAI); rewrite (subsetIl, subsetIr). Qed. Lemma properU A B C : (B :|: C \proper A) -> (B \proper A) && (C \proper A). Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A'), is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move=> pUA; apply/andP. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by split; apply: sub_proper_trans pUA; rewrite (subsetUr, subsetUl). Qed. End setX. Section setXY. Variables X Y : elementType. Implicit Types (x : X) (y : Y) (A : set X) (B : set Y) (f : setfun set X Y). Lemma imsetP (f : setfun set X Y) A y : reflect (exists2 x : X, x \in A & y = f x) (y \in imset f A). Proof. (* Goal: forall (_ : @prop_in2 (Equality.sort (eqType_of_elementType X)) (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A') (fun x1 x2 : Equality.sort (eqType_of_elementType X) => forall _ : @eq (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x1) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x2), @eq (Equality.sort (eqType_of_elementType X)) x1 x2) (inPhantom (@injective (Equality.sort (eqType_of_elementType Y)) (Equality.sort (eqType_of_elementType X)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f)))) (_ : is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A')), is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move: A f; rewrite /set1 /in_mem /= /memset /imset /setfun. (* Goal: forall (A : @Semiset.sort elementType eqType_of_elementType disp set X) (f : @Semiset.funsort elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y), Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x))) (@Semiset.memset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) Y (@Semiset.imset elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (@Semiset.sort elementType eqType_of_elementType disp set X) (@Semiset.base elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set) X) (@Semiset.sort elementType eqType_of_elementType disp set X)) (@Semiset.mixin elementType eqType_of_elementType disp (@Semiset.sort elementType eqType_of_elementType disp set) (@Semiset.class elementType eqType_of_elementType disp set)) X Y f A) y) *) case: set => [S [base [memset set1 /= ? ? ? ? ? ? ? ? ? H]]] ? /= A f. (* Goal: Bool.reflect (@ex2 (Equality.sort (eqType_of_elementType X)) (fun x : Equality.sort (eqType_of_elementType X) => is_true (memset X A x)) (fun x : Equality.sort (eqType_of_elementType X) => @eq (Equality.sort (eqType_of_elementType Y)) y (@fun_of_setfun elementType eqType_of_elementType disp (@Semiset.Pack elementType eqType_of_elementType disp S (@Semiset.Class elementType eqType_of_elementType disp S base (@Semiset.Mixin elementType eqType_of_elementType disp (fun X : elementType => @Order.CBLattice.Pack (display_set disp) (S X) (base X) (S X)) memset set1 _i_ _e_ _e1_ _s_ _i1_ _e2_ _funsort_ _fun_of_funsort_ _imset_ H)) _T_) X Y f x))) (memset Y (_imset_ X Y f A) y) *) exact: H. Qed. Lemma mem_imset f A x : x \in A -> f x \in imset f A. Proof. by move=> Dx; apply/imsetP; exists x. Qed. Lemma imset0 f : imset f set0 = set0. Proof. (* Goal: @eq (@Semiset.sort elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set)) *) apply/setP => y; rewrite in_set0. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply/imsetP => [[x]]; rewrite in_set0. Qed. Lemma imset_eq0 f A : (imset f A == set0) = (A == set0). Proof. (* Goal: @eq bool (@eq_op (@Semiset.eqType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType Y disp set))) (@eq_op (@Semiset.eqType elementType eqType_of_elementType X disp set) A (@bottom (display_set disp) (@Semiset.blatticeType elementType eqType_of_elementType X disp set))) *) have [->|/set_gt0_ex [x xA]] := posxP A; first by rewrite imset0 eqxx. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply/set0Pn; exists (f x); rewrite mem_imset. Qed. Lemma imset_set1 f x : imset f [set x] = [set f x]. Proof. (* Goal: is_true (negb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A') (@imset elementType eqType_of_elementType disp set X Y f A))) *) apply/setP => y. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by apply/imsetP/set1P=> [[x' /set1P-> //]| ->]; exists x; rewrite ?set11. Qed. Lemma imsetS f A A' : A \subset A' -> imset f A \subset imset f A'. Proof. (* Goal: forall _ : is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A'), is_true (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move=> leAB; apply/subsetP => y /imsetP [x xA ->]. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by rewrite mem_imset // (subsetP leAB). Qed. Lemma imset_proper f A A' : {in A' &, injective f} -> A \proper A' -> imset f A \proper imset f A'. Proof. (* Goal: forall (_ : @prop_in2 (Equality.sort (eqType_of_elementType X)) (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A') (fun x1 x2 : Equality.sort (eqType_of_elementType X) => forall _ : @eq (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x1) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x2), @eq (Equality.sort (eqType_of_elementType X)) x1 x2) (inPhantom (@injective (Equality.sort (eqType_of_elementType Y)) (Equality.sort (eqType_of_elementType X)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f)))) (_ : is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType X disp set) A A')), is_true (@lt (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A) (@imset elementType eqType_of_elementType disp set X Y f A')) *) move=> injf /properP[sAB [x Bx nAx]]; rewrite lt_leAnge imsetS //=. (* Goal: is_true (negb (@le (display_set disp) (@Semiset.porderType elementType eqType_of_elementType Y disp set) (@imset elementType eqType_of_elementType disp set X Y f A') (@imset elementType eqType_of_elementType disp set X Y f A))) *) apply: contra nAx => sfBA. (* Goal: is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) have: f x \in imset f A by rewrite (subsetP sfBA) ?mem_imset. (* Goal: forall _ : is_true (@in_mem (Equality.sort (eqType_of_elementType Y)) (@fun_of_setfun elementType eqType_of_elementType disp set X Y f x) (@mem (Equality.sort (eqType_of_elementType Y)) (@set_predType elementType eqType_of_elementType disp set Y) (@imset elementType eqType_of_elementType disp set X Y f A))), is_true (@in_mem (Equality.sort (eqType_of_elementType X)) x (@mem (Equality.sort (eqType_of_elementType X)) (@set_predType elementType eqType_of_elementType disp set X) A)) *) by case/imsetP=> y Ay /injf-> //; apply: subsetP sAB y Ay. Qed. End setXY. End SemisetTheory. End SemisetTheory. Module set. Section ClassDef. Variable elementType : Type. Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Implicit Types (X Y : elementType). Record class_of d (set : elementType -> Type) := Class { base : forall X, Order.CTBLattice.class_of (display_set d) (set X); mixin : Semiset.mixin_of eqType_of_elementType (fun X => Order.CBLattice.Pack (base X) (set X)) }. Local Coercion base : class_of >-> Funclass. Definition base2 d (set : elementType -> Type) (c : class_of d set) := Semiset.Class (@mixin _ set c). Local Coercion base2 : class_of >-> Semiset.class_of. Structure type d := Pack { sort ; _ : class_of d sort; _ : elementType -> Type }. Local Coercion sort : type >-> Funclass. Variables (set : elementType -> Type) (disp : unit) (cT : type disp). Definition class := let: Pack _ c _ as cT' := cT return class_of _ cT' in c. (* Definition clone c of phant_id class c := @Pack set c set. *) Let xset := let: Pack set _ _ := cT in set. Notation xclass := (class : class_of xset). Definition pack := fun bT (b : forall X, Order.CTBLattice.class_of _ _) & (forall X, phant_id (@Order.CTBLattice.class disp (bT X)) (b X)) => fun mT m & phant_id (@Semiset.class _ eqType_of_elementType mT) (@Semiset.Class _ _ disp set b m) => Pack (@Class _ set (fun x => b x) m) set. End ClassDef. Section CanonicalDef. Variable elementType : Type. Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Notation type := (type eqType_of_elementType). Local Coercion sort : type >-> Funclass. Local Coercion base : class_of >-> Funclass. Local Coercion base2 : class_of >-> Semiset.class_of. Variables (set : elementType -> Type) (X : elementType). Variable (disp : unit) (cT : type disp). Local Notation ddisp := (display_set disp). Let xset := let: Pack set _ _ := cT in set. Notation xclass := (@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset). Definition eqType := ltac:(EqualityPack (cT X) ((@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset) X) (xset X)). Definition choiceType := ltac:(ChoicePack (cT X) ((@class _ eqType_of_elementType _ cT : class_of eqType_of_elementType _ xset) X) (xset X)). Definition porderType := @Order.POrder.Pack ddisp (cT X) (xclass X) (xset X). Definition latticeType := @Order.Lattice.Pack ddisp (cT X) (xclass X) (xset X). Definition blatticeType := @Order.BLattice.Pack ddisp (cT X) (xclass X) (xset X). Definition cblatticeType := @Order.CBLattice.Pack ddisp (cT X) (xclass X) (xset X). Definition ctblatticeType := @Order.CTBLattice.Pack ddisp (cT X) (xclass X) (xset X). Definition semisetType := @Semiset.Pack _ _ disp cT xclass xset. Definition semiset_ctblatticeType := @Order.CTBLattice.Pack ddisp (semisetType X) (xclass X) (xset X). End CanonicalDef. Module Import Exports. Coercion base : class_of >-> Funclass. Coercion base2 : class_of >-> Semiset.class_of. Coercion sort : type >-> Funclass. Coercion eqType : type >-> Equality.type. Coercion choiceType : type >-> Choice.type. Coercion porderType : type >-> Order.POrder.type. Coercion latticeType : type >-> Order.Lattice.type. Coercion blatticeType : type >-> Order.BLattice.type. Coercion cblatticeType : type >-> Order.CBLattice.type. Coercion ctblatticeType : type >-> Order.CTBLattice.type. Coercion semisetType : type >-> Semiset.type. Canonical eqType. Canonical choiceType. Canonical porderType. Canonical latticeType. Canonical blatticeType. Canonical cblatticeType. Canonical ctblatticeType. Canonical semisetType. Notation setType := type. Notation "[ 'setType' 'of' set ]" := (@pack _ _ set _ _ _ (fun=> id) _ _ id) (at level 0, format "[ 'setType' 'of' set ]") : form_scope. End Exports. End set. Import set.Exports. Module Import setTheory. Section setTheory. Variable elementType : Type. Variable eqType_of_elementType : elementType -> eqType. Coercion eqType_of_elementType : elementType >-> eqType. Variable disp : unit. Variable set : setType eqType_of_elementType disp. Section setX. Variables X : elementType. Implicit Types (x y : X) (A B : set X). End setX. End setTheory. End setTheory. Module Theory. Export Semiset.Exports. Export set.Exports. Export SetSyntax. Export SemisetSyntax. Export SemisetTheory. Export setTheory. End Theory. End SET.

"(*************************************************************************)\n(* Goal: forall _ : @e(...TRUNCATED)