adambard/learnxinyminutes-docs
1
1
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-11-26 09:21:00 +03:00
Code Issues Projects Releases Wiki Activity

Merge pull request #4003 from Vap0r1ze/patch-1

Browse Source 
[set-theory/en] correct equality statement
This commit is contained in:
Adam Bard 2020-10-01 08:19:29 -07:00 committed by GitHub
commit f0be07d4b6
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
set-theory.html.markdown
View File

@ -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`. * 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 }`. * 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 }`. * 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 ## Special Sets