Welcome guest
You're not logged in.
308 users online, thereof 0 logged in

Proof: (related to "Justification of Set Union")

  • Let $A$ and $B$ be sets.

  • By the axiom of pairing there is a set $Z$ containing $A$ and $B$ as elements:

  • By the axiom of union there is a set $Z^*$ containing the elements of $A$ or1 the elements of $B.$

  • By the axiom of separation there is a subset $Z^\dagger \subseteq Z^*$ containing exactly the elements of $A$ or1 the elements of $B.$, i.e. $Z^\dagger =\{z\mid z\in A\vee z\in B\}.$

1 We mean the logical or operation, in the natural English language “and/or”.


| | | | created: 2019-01-12 22:41:54 | modified: 2019-01-12 22:44:47 | by: bookofproofs | references: [983]

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:


Bibliography (further reading)

[983] Ebbinghaus, H.-D.: “Einf├╝hrung in die Mengenlehre”, BI Wisschenschaftsverlag, 1994, 3

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.