$(P land neg Q) lor P equiv P$ How is this proved using theorems?
I have tried my best by using all possible ways but failed!
Commutative laws: $p land q equiv q land p$ and $p lor q equiv q lor p$
Associative laws: $(p land q) land r equiv p land (q land r)$ and $(p lor q) lor r equiv p lor (q lor r)$
Distributive laws: $p land (q lor r) equiv (p land q) lor (p land r)$ and $p lor (q land r) equiv (p lor q) land (p lor r)$
Identity laws: $p land top equiv p$ and $p lor bot equiv p$
Negation laws: $p lor neg p equiv top$ and $p land neg p equiv bot$
Double negative law: $neg (neg p) equiv p$
Idempotent laws: $p land p equiv p$ and $p lor p equiv p$
Universal bound laws: $p lor top equiv top$ and $p land bot equiv bot$
De Morgan’s laws: $neg (p land q) equiv neg p lor neg q$ and $neg (p lor q) equiv neg p land neg q$
Absorption laws: $p lor (p land q) equiv p$ and $p land (p lor q) equiv p$
Negations of $top$ and $bot$: $neg top equiv bot$ and $neg bot equiv top$
discrete-mathematics
add a comment |
I have tried my best by using all possible ways but failed!
Commutative laws: $p land q equiv q land p$ and $p lor q equiv q lor p$
Associative laws: $(p land q) land r equiv p land (q land r)$ and $(p lor q) lor r equiv p lor (q lor r)$
Distributive laws: $p land (q lor r) equiv (p land q) lor (p land r)$ and $p lor (q land r) equiv (p lor q) land (p lor r)$
Identity laws: $p land top equiv p$ and $p lor bot equiv p$
Negation laws: $p lor neg p equiv top$ and $p land neg p equiv bot$
Double negative law: $neg (neg p) equiv p$
Idempotent laws: $p land p equiv p$ and $p lor p equiv p$
Universal bound laws: $p lor top equiv top$ and $p land bot equiv bot$
De Morgan’s laws: $neg (p land q) equiv neg p lor neg q$ and $neg (p lor q) equiv neg p land neg q$
Absorption laws: $p lor (p land q) equiv p$ and $p land (p lor q) equiv p$
Negations of $top$ and $bot$: $neg top equiv bot$ and $neg bot equiv top$
discrete-mathematics
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19
add a comment |
I have tried my best by using all possible ways but failed!
Commutative laws: $p land q equiv q land p$ and $p lor q equiv q lor p$
Associative laws: $(p land q) land r equiv p land (q land r)$ and $(p lor q) lor r equiv p lor (q lor r)$
Distributive laws: $p land (q lor r) equiv (p land q) lor (p land r)$ and $p lor (q land r) equiv (p lor q) land (p lor r)$
Identity laws: $p land top equiv p$ and $p lor bot equiv p$
Negation laws: $p lor neg p equiv top$ and $p land neg p equiv bot$
Double negative law: $neg (neg p) equiv p$
Idempotent laws: $p land p equiv p$ and $p lor p equiv p$
Universal bound laws: $p lor top equiv top$ and $p land bot equiv bot$
De Morgan’s laws: $neg (p land q) equiv neg p lor neg q$ and $neg (p lor q) equiv neg p land neg q$
Absorption laws: $p lor (p land q) equiv p$ and $p land (p lor q) equiv p$
Negations of $top$ and $bot$: $neg top equiv bot$ and $neg bot equiv top$
discrete-mathematics
I have tried my best by using all possible ways but failed!
Commutative laws: $p land q equiv q land p$ and $p lor q equiv q lor p$
Associative laws: $(p land q) land r equiv p land (q land r)$ and $(p lor q) lor r equiv p lor (q lor r)$
Distributive laws: $p land (q lor r) equiv (p land q) lor (p land r)$ and $p lor (q land r) equiv (p lor q) land (p lor r)$
Identity laws: $p land top equiv p$ and $p lor bot equiv p$
Negation laws: $p lor neg p equiv top$ and $p land neg p equiv bot$
Double negative law: $neg (neg p) equiv p$
Idempotent laws: $p land p equiv p$ and $p lor p equiv p$
Universal bound laws: $p lor top equiv top$ and $p land bot equiv bot$
De Morgan’s laws: $neg (p land q) equiv neg p lor neg q$ and $neg (p lor q) equiv neg p land neg q$
Absorption laws: $p lor (p land q) equiv p$ and $p land (p lor q) equiv p$
Negations of $top$ and $bot$: $neg top equiv bot$ and $neg bot equiv top$
discrete-mathematics
discrete-mathematics
edited Dec 31 '18 at 20:00


amWhy
192k28225439
192k28225439
asked Dec 31 '18 at 18:28


Waqad ArshadWaqad Arshad
31
31
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19
add a comment |
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19
add a comment |
1 Answer
1
active
oldest
votes
It can be proved from the absorption law that you list with a variable substitution. Let $Q'=neg Q$. Then by the absorption law, $(P wedge Q') vee P equiv P$.
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
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%2f3057936%2fp-land-neg-q-lor-p-equiv-p-how-is-this-proved-using-theorems%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
It can be proved from the absorption law that you list with a variable substitution. Let $Q'=neg Q$. Then by the absorption law, $(P wedge Q') vee P equiv P$.
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
add a comment |
It can be proved from the absorption law that you list with a variable substitution. Let $Q'=neg Q$. Then by the absorption law, $(P wedge Q') vee P equiv P$.
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
add a comment |
It can be proved from the absorption law that you list with a variable substitution. Let $Q'=neg Q$. Then by the absorption law, $(P wedge Q') vee P equiv P$.
It can be proved from the absorption law that you list with a variable substitution. Let $Q'=neg Q$. Then by the absorption law, $(P wedge Q') vee P equiv P$.
answered Dec 31 '18 at 18:41
CyborgOctopusCyborgOctopus
685
685
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
add a comment |
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
would it be correct?
– Waqad Arshad
Dec 31 '18 at 19:15
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
@WaqadArshad yes. It follows pretty directly from the law that you listed and like someone else mentioned, you can check it with a truth table.
– CyborgOctopus
Dec 31 '18 at 19:18
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
I know that this statement is true. all I am asking is that is it alright to write it this way?
– Waqad Arshad
Dec 31 '18 at 19:41
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
You might want to substitute ~Q back in to rewrite it in its original form.
– CyborgOctopus
Dec 31 '18 at 19:45
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
Thanks a lot @CyborgOctopus
– Waqad Arshad
Dec 31 '18 at 19:47
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%2f3057936%2fp-land-neg-q-lor-p-equiv-p-how-is-this-proved-using-theorems%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
Whoops, misread it. Thanks @MauroALLEGRANZA.
– mweiss
Dec 31 '18 at 18:59
but I asked how can we prove it using theorems?@MauroALLEGRANZA
– Waqad Arshad
Dec 31 '18 at 19:19