OurBigBook About$ Donate
 Sign in Sign up

Set identity

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Set theory Set
2026-10-31  0 By others on same topic  0 Discussions Create my own version
An equality between sets expressed in terms of arbitrary input sets that holds for every allowed choice of those inputs. A double inclusion proof proves a set identity by proving both set inclusions. Membership equivalences give another proof: the expressions are equal if and only if each element belongs to either both or neither.

 Ancestors (6)

  1. Set
  2. Set theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 1 / c / i / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 1 / a / ii / Solution
  • Set identity

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook