summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorAdam Bard <github@adambard.com>2020-10-01 08:19:29 -0700
committerGitHub <noreply@github.com>2020-10-01 08:19:29 -0700
commitf0be07d4b66ba9a58985e3cf2422cd1260de7831 (patch)
treecad31bf3c46a21ac20089e34206bcac4aec77a28
parent348f5eef5cd5d337f19a602502eac68861c3ca98 (diff)
parent26d2733ab775e1138bfd83fe14253035275671b9 (diff)
Merge pull request #4003 from Vap0r1ze/patch-1
[set-theory/en] correct equality statement
-rw-r--r--set-theory.html.markdown2
1 files changed, 1 insertions, 1 deletions
diff --git a/set-theory.html.markdown b/set-theory.html.markdown
index 1894c306..6be7aa00 100644
--- a/set-theory.html.markdown
+++ b/set-theory.html.markdown
@@ -82,7 +82,7 @@ D = { 2x : x ∈ N } = { 0, 2, 4, 6, 8, ... }
* If two sets contain the same items then we say the sets are equal, e.g. `A = B`.
* Order does not matter when determining set equality, e.g. `{ 1, 2, 3, 4 } = { 2, 3, 1, 4 }`.
* Sets are disjoint, meaning elements cannot be repeated, e.g. `{ 1, 2, 2, 3, 4, 3, 4, 2 } = { 1, 2, 3, 4 }`.
-* Two sets `A` and `B` are equal if and only if `A ⊂ B` and `B ⊂ A`.
+* Two sets `A` and `B` are equal if and only if `A ⊆ B` and `B ⊆ A`.
## Special Sets