Set theory operations proof
$begingroup$
Demonstrate that $A cap (B cup C) = (A cap B) cup (A cap C)$
How can I proof that?
Well, if I pick up an $ x in A$ and the same $ x in B cup C$, then $x in (A cap (B cup C))$.
If $ x in A $, and if $x in B$ and $x notin C$, then the equality is true. Or, $ x in A $, and if $x notin B$ and $x in C$, then the equality is true. For last, $ x in A $, and if $x in B$ and $x in C$, then the equality is true again.
Is this enough to proof the equality?
elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Demonstrate that $A cap (B cup C) = (A cap B) cup (A cap C)$
How can I proof that?
Well, if I pick up an $ x in A$ and the same $ x in B cup C$, then $x in (A cap (B cup C))$.
If $ x in A $, and if $x in B$ and $x notin C$, then the equality is true. Or, $ x in A $, and if $x notin B$ and $x in C$, then the equality is true. For last, $ x in A $, and if $x in B$ and $x in C$, then the equality is true again.
Is this enough to proof the equality?
elementary-set-theory
$endgroup$
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26
add a comment |
$begingroup$
Demonstrate that $A cap (B cup C) = (A cap B) cup (A cap C)$
How can I proof that?
Well, if I pick up an $ x in A$ and the same $ x in B cup C$, then $x in (A cap (B cup C))$.
If $ x in A $, and if $x in B$ and $x notin C$, then the equality is true. Or, $ x in A $, and if $x notin B$ and $x in C$, then the equality is true. For last, $ x in A $, and if $x in B$ and $x in C$, then the equality is true again.
Is this enough to proof the equality?
elementary-set-theory
$endgroup$
Demonstrate that $A cap (B cup C) = (A cap B) cup (A cap C)$
How can I proof that?
Well, if I pick up an $ x in A$ and the same $ x in B cup C$, then $x in (A cap (B cup C))$.
If $ x in A $, and if $x in B$ and $x notin C$, then the equality is true. Or, $ x in A $, and if $x notin B$ and $x in C$, then the equality is true. For last, $ x in A $, and if $x in B$ and $x in C$, then the equality is true again.
Is this enough to proof the equality?
elementary-set-theory
elementary-set-theory
edited Jan 21 at 1:15
Andrés E. Caicedo
65.5k8158249
65.5k8158249
asked Jan 21 at 0:12
ArduinArduin
307
307
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26
add a comment |
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
That's basically correct, but it can be slightly simplified and clarified.
For the clarification, you should note that if $x in B cup C$ then it must be true that either $x in B$ or $x in C$. You haven't explicitly stated that, but you have used that fact.
For the simplification, you don't have to consider the three cases: (1) $x in B$ and $x notin C$, (2) $x in C$ and $x notin B$, and (3) $x in B$ and $x in C$. It is enough to just consider two cases: (1) $x in B$ (and we don't care whether $x$ is in $C$ or not), and (2) $x in C$ (and we don't care whether $x$ is in $B$ or not).
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3081309%2fset-theory-operations-proof%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
That's basically correct, but it can be slightly simplified and clarified.
For the clarification, you should note that if $x in B cup C$ then it must be true that either $x in B$ or $x in C$. You haven't explicitly stated that, but you have used that fact.
For the simplification, you don't have to consider the three cases: (1) $x in B$ and $x notin C$, (2) $x in C$ and $x notin B$, and (3) $x in B$ and $x in C$. It is enough to just consider two cases: (1) $x in B$ (and we don't care whether $x$ is in $C$ or not), and (2) $x in C$ (and we don't care whether $x$ is in $B$ or not).
$endgroup$
add a comment |
$begingroup$
That's basically correct, but it can be slightly simplified and clarified.
For the clarification, you should note that if $x in B cup C$ then it must be true that either $x in B$ or $x in C$. You haven't explicitly stated that, but you have used that fact.
For the simplification, you don't have to consider the three cases: (1) $x in B$ and $x notin C$, (2) $x in C$ and $x notin B$, and (3) $x in B$ and $x in C$. It is enough to just consider two cases: (1) $x in B$ (and we don't care whether $x$ is in $C$ or not), and (2) $x in C$ (and we don't care whether $x$ is in $B$ or not).
$endgroup$
add a comment |
$begingroup$
That's basically correct, but it can be slightly simplified and clarified.
For the clarification, you should note that if $x in B cup C$ then it must be true that either $x in B$ or $x in C$. You haven't explicitly stated that, but you have used that fact.
For the simplification, you don't have to consider the three cases: (1) $x in B$ and $x notin C$, (2) $x in C$ and $x notin B$, and (3) $x in B$ and $x in C$. It is enough to just consider two cases: (1) $x in B$ (and we don't care whether $x$ is in $C$ or not), and (2) $x in C$ (and we don't care whether $x$ is in $B$ or not).
$endgroup$
That's basically correct, but it can be slightly simplified and clarified.
For the clarification, you should note that if $x in B cup C$ then it must be true that either $x in B$ or $x in C$. You haven't explicitly stated that, but you have used that fact.
For the simplification, you don't have to consider the three cases: (1) $x in B$ and $x notin C$, (2) $x in C$ and $x notin B$, and (3) $x in B$ and $x in C$. It is enough to just consider two cases: (1) $x in B$ (and we don't care whether $x$ is in $C$ or not), and (2) $x in C$ (and we don't care whether $x$ is in $B$ or not).
answered Jan 21 at 0:24
kccukccu
10.5k11228
10.5k11228
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3081309%2fset-theory-operations-proof%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
It's not really accurate to say that the "equality is true" when dealing with cases of individual members $x$ of the sets.
$endgroup$
– nathan.j.mcdougall
Jan 21 at 0:26