aboutsummaryrefslogtreecommitdiffhomepage
path: root/theories/MSets
diff options
context:
space:
mode:
authorGravatar glondu <glondu@85f007b7-540e-0410-9357-904b9bb8a0f7>2011-01-06 13:53:43 +0000
committerGravatar glondu <glondu@85f007b7-540e-0410-9357-904b9bb8a0f7>2011-01-06 13:53:43 +0000
commitba92af4800afd90c03d5f6e277085cd690023415 (patch)
tree93f9850c505907922ac7a1913e5a48fd19b161a0 /theories/MSets
parentc515d65d6ee81f532cb227419bbef36701593aa0 (diff)
s/appartness/membership/g (Closes: #2470)
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13767 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/MSets')
-rw-r--r--theories/MSets/MSetAVL.v6
1 files changed, 3 insertions, 3 deletions
diff --git a/theories/MSets/MSetAVL.v b/theories/MSets/MSetAVL.v
index 349cdedf7..253267fc8 100644
--- a/theories/MSets/MSetAVL.v
+++ b/theories/MSets/MSetAVL.v
@@ -80,9 +80,9 @@ Definition empty := Leaf.
Definition is_empty s :=
match s with Leaf => true | _ => false end.
-(** ** Appartness *)
+(** ** Membership *)
-(** The [mem] function is deciding appartness. It exploits the
+(** The [mem] function is deciding membership. It exploits the
binary search tree invariant to achieve logarithmic complexity. *)
Fixpoint mem x s :=
@@ -790,7 +790,7 @@ Proof.
split; auto. try discriminate. intro H; elim (H x); auto.
Qed.
-(** * Appartness *)
+(** * Membership *)
Lemma mem_spec : forall s x `{Ok s}, mem x s = true <-> InT x s.
Proof.