Writing a proof
$begingroup$
I am stuck at showing how if:
$P rightarrow Q$ then this implies ($Q rightarrow R) rightarrow (P rightarrow R)$
I know that if we assume $P$ is true then $Q$ also must be true.
Therefore if $Q$ is true then $R$ must be true. And because $Q$ is true because $P$ is true so therefore $R$ must also be true.
However it would be appreciated if someone could help me understand this why is the case and what proof technique it is.
proof-writing proof-explanation
$endgroup$
add a comment |
$begingroup$
I am stuck at showing how if:
$P rightarrow Q$ then this implies ($Q rightarrow R) rightarrow (P rightarrow R)$
I know that if we assume $P$ is true then $Q$ also must be true.
Therefore if $Q$ is true then $R$ must be true. And because $Q$ is true because $P$ is true so therefore $R$ must also be true.
However it would be appreciated if someone could help me understand this why is the case and what proof technique it is.
proof-writing proof-explanation
$endgroup$
$begingroup$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55
add a comment |
$begingroup$
I am stuck at showing how if:
$P rightarrow Q$ then this implies ($Q rightarrow R) rightarrow (P rightarrow R)$
I know that if we assume $P$ is true then $Q$ also must be true.
Therefore if $Q$ is true then $R$ must be true. And because $Q$ is true because $P$ is true so therefore $R$ must also be true.
However it would be appreciated if someone could help me understand this why is the case and what proof technique it is.
proof-writing proof-explanation
$endgroup$
I am stuck at showing how if:
$P rightarrow Q$ then this implies ($Q rightarrow R) rightarrow (P rightarrow R)$
I know that if we assume $P$ is true then $Q$ also must be true.
Therefore if $Q$ is true then $R$ must be true. And because $Q$ is true because $P$ is true so therefore $R$ must also be true.
However it would be appreciated if someone could help me understand this why is the case and what proof technique it is.
proof-writing proof-explanation
proof-writing proof-explanation
edited Jan 23 at 16:23
bjcolby15
1,26111016
1,26111016
asked Jan 23 at 16:16
Molly Molly
704
704
$begingroup$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55
add a comment |
$begingroup$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55
$begingroup$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
This property is called transitivity of implication.
You pretty much gave a proof in your question, but here's a proof written out in slightly more precise terms.
Suppose $P Rightarrow Q$ is true. To prove $(Q Rightarrow R) Rightarrow (P Rightarrow R)$, you need to assume $Q Rightarrow R$ and derive $P Rightarrow R$. So assume that $Q Rightarrow R$ is true. To prove $P Rightarrow R$ is true, you need to assume $P$ is true and derive $R$. So assume $P$ is true. All we have to do now is prove that $R$ is true.
At this point, we're assuming that $P Rightarrow Q$, $Q Rightarrow R$ and $P$ are all true. So:
- Since $P$ and $P Rightarrow Q$ are true, we have that $Q$ is true; and
- Since $Q$ and $Q Rightarrow R$ are true, we have that $R$ is true.
So we're done.
$endgroup$
add a comment |
$begingroup$
You can also prove this somewhat verbosely with a truth table... (I have named my intermediate steps just because the table was too wide to display nicely.)
$$
begin{array}{|c c c|c|c|c|c|c|}
P & Q & R & P implies Q & Q implies R & P implies R & & \
& & &A&B&C&B implies C & A implies (B implies C) \
\
T & T & T & T & T & T & T & T\
T & T & F & T & F & F & T & T\
T & F & T & F & T & T & T & T\
T & F & F & F & T & F & F & T\
F & T & T & T & T & T & T & T\
F & T & F & T & F & T & T & T\
F & F & T & T & T & T & T & T\
F & F & F & T & T & T & T & T\
end{array}
$$
$endgroup$
add a comment |
$begingroup$
It’s a sort of transitivity. $Pimplies Q$ is true. So if $Qimplies R$, then $Pimplies Qimplies R$. I don’t think there is a name for this. It’s just multiple implications that give a result.
Proving this is simple. Given $Qimplies R$, we want to demonstrate $Pimplies R$.
So let’s suppose that $P$ is true. So, $Q$ is true by $(Pimplies Q)$ (it’s called the “Modus ponens”). But $Q$ is true, so $R$ is true.
QED.
$endgroup$
add a comment |
$begingroup$
If you want a conceptual proof, you just need to know how to prove an implication. How do you prove $Arightarrow B$? Assume $A$ is true, then show that $B$ follows (hoping you have some other information laying around to do this using $A$.
Step 1 To show:
$(P rightarrow Q) rightarrow ((Q rightarrow R) rightarrow (P rightarrow R))$,
assume $(P rightarrow Q)$ and show $(Q rightarrow R) rightarrow (P rightarrow R)$.step 2 To show $(Q rightarrow R) rightarrow (P rightarrow R)$, assume $Q rightarrow R$ and then show $P rightarrow R$.
step 3 To show $P rightarrow R$, assume $P$ and then show $R$.
At each stage we're assuming something so by this last step we've assumed a whole bunch that can help us to show $R$.
Using $P$, assumed true from the last step and $Prightarrow Q$ assumed true from step 1, $Q$ follows, via modus ponens.
Using this $Q$ and $Qrightarrow R$ assumed true from step 2, $R$ follows, again via modus ponens.
And we're done. In short, a chain of implications unraveled from left to right.
$endgroup$
add a comment |
$begingroup$
$ARightarrow B$ can be written as $neg Avee B.$ Therefore,
$$
(QRightarrow R)Rightarrow(PRightarrow R) \
=neg(neg Qvee R)vee (neg Pvee R) \
= (Q wedge neg R)vee (neg Pvee R) \
= (neg P vee Qvee R)wedge (neg P vee R vee neg R) \
= (neg P vee Qvee R) \
= (neg P vee Q)vee R \
= (PRightarrow Q) vee R
$$
$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%2f3084690%2fwriting-a-proof%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This property is called transitivity of implication.
You pretty much gave a proof in your question, but here's a proof written out in slightly more precise terms.
Suppose $P Rightarrow Q$ is true. To prove $(Q Rightarrow R) Rightarrow (P Rightarrow R)$, you need to assume $Q Rightarrow R$ and derive $P Rightarrow R$. So assume that $Q Rightarrow R$ is true. To prove $P Rightarrow R$ is true, you need to assume $P$ is true and derive $R$. So assume $P$ is true. All we have to do now is prove that $R$ is true.
At this point, we're assuming that $P Rightarrow Q$, $Q Rightarrow R$ and $P$ are all true. So:
- Since $P$ and $P Rightarrow Q$ are true, we have that $Q$ is true; and
- Since $Q$ and $Q Rightarrow R$ are true, we have that $R$ is true.
So we're done.
$endgroup$
add a comment |
$begingroup$
This property is called transitivity of implication.
You pretty much gave a proof in your question, but here's a proof written out in slightly more precise terms.
Suppose $P Rightarrow Q$ is true. To prove $(Q Rightarrow R) Rightarrow (P Rightarrow R)$, you need to assume $Q Rightarrow R$ and derive $P Rightarrow R$. So assume that $Q Rightarrow R$ is true. To prove $P Rightarrow R$ is true, you need to assume $P$ is true and derive $R$. So assume $P$ is true. All we have to do now is prove that $R$ is true.
At this point, we're assuming that $P Rightarrow Q$, $Q Rightarrow R$ and $P$ are all true. So:
- Since $P$ and $P Rightarrow Q$ are true, we have that $Q$ is true; and
- Since $Q$ and $Q Rightarrow R$ are true, we have that $R$ is true.
So we're done.
$endgroup$
add a comment |
$begingroup$
This property is called transitivity of implication.
You pretty much gave a proof in your question, but here's a proof written out in slightly more precise terms.
Suppose $P Rightarrow Q$ is true. To prove $(Q Rightarrow R) Rightarrow (P Rightarrow R)$, you need to assume $Q Rightarrow R$ and derive $P Rightarrow R$. So assume that $Q Rightarrow R$ is true. To prove $P Rightarrow R$ is true, you need to assume $P$ is true and derive $R$. So assume $P$ is true. All we have to do now is prove that $R$ is true.
At this point, we're assuming that $P Rightarrow Q$, $Q Rightarrow R$ and $P$ are all true. So:
- Since $P$ and $P Rightarrow Q$ are true, we have that $Q$ is true; and
- Since $Q$ and $Q Rightarrow R$ are true, we have that $R$ is true.
So we're done.
$endgroup$
This property is called transitivity of implication.
You pretty much gave a proof in your question, but here's a proof written out in slightly more precise terms.
Suppose $P Rightarrow Q$ is true. To prove $(Q Rightarrow R) Rightarrow (P Rightarrow R)$, you need to assume $Q Rightarrow R$ and derive $P Rightarrow R$. So assume that $Q Rightarrow R$ is true. To prove $P Rightarrow R$ is true, you need to assume $P$ is true and derive $R$. So assume $P$ is true. All we have to do now is prove that $R$ is true.
At this point, we're assuming that $P Rightarrow Q$, $Q Rightarrow R$ and $P$ are all true. So:
- Since $P$ and $P Rightarrow Q$ are true, we have that $Q$ is true; and
- Since $Q$ and $Q Rightarrow R$ are true, we have that $R$ is true.
So we're done.
edited Jan 23 at 16:30
answered Jan 23 at 16:24
Clive NewsteadClive Newstead
51.5k474135
51.5k474135
add a comment |
add a comment |
$begingroup$
You can also prove this somewhat verbosely with a truth table... (I have named my intermediate steps just because the table was too wide to display nicely.)
$$
begin{array}{|c c c|c|c|c|c|c|}
P & Q & R & P implies Q & Q implies R & P implies R & & \
& & &A&B&C&B implies C & A implies (B implies C) \
\
T & T & T & T & T & T & T & T\
T & T & F & T & F & F & T & T\
T & F & T & F & T & T & T & T\
T & F & F & F & T & F & F & T\
F & T & T & T & T & T & T & T\
F & T & F & T & F & T & T & T\
F & F & T & T & T & T & T & T\
F & F & F & T & T & T & T & T\
end{array}
$$
$endgroup$
add a comment |
$begingroup$
You can also prove this somewhat verbosely with a truth table... (I have named my intermediate steps just because the table was too wide to display nicely.)
$$
begin{array}{|c c c|c|c|c|c|c|}
P & Q & R & P implies Q & Q implies R & P implies R & & \
& & &A&B&C&B implies C & A implies (B implies C) \
\
T & T & T & T & T & T & T & T\
T & T & F & T & F & F & T & T\
T & F & T & F & T & T & T & T\
T & F & F & F & T & F & F & T\
F & T & T & T & T & T & T & T\
F & T & F & T & F & T & T & T\
F & F & T & T & T & T & T & T\
F & F & F & T & T & T & T & T\
end{array}
$$
$endgroup$
add a comment |
$begingroup$
You can also prove this somewhat verbosely with a truth table... (I have named my intermediate steps just because the table was too wide to display nicely.)
$$
begin{array}{|c c c|c|c|c|c|c|}
P & Q & R & P implies Q & Q implies R & P implies R & & \
& & &A&B&C&B implies C & A implies (B implies C) \
\
T & T & T & T & T & T & T & T\
T & T & F & T & F & F & T & T\
T & F & T & F & T & T & T & T\
T & F & F & F & T & F & F & T\
F & T & T & T & T & T & T & T\
F & T & F & T & F & T & T & T\
F & F & T & T & T & T & T & T\
F & F & F & T & T & T & T & T\
end{array}
$$
$endgroup$
You can also prove this somewhat verbosely with a truth table... (I have named my intermediate steps just because the table was too wide to display nicely.)
$$
begin{array}{|c c c|c|c|c|c|c|}
P & Q & R & P implies Q & Q implies R & P implies R & & \
& & &A&B&C&B implies C & A implies (B implies C) \
\
T & T & T & T & T & T & T & T\
T & T & F & T & F & F & T & T\
T & F & T & F & T & T & T & T\
T & F & F & F & T & F & F & T\
F & T & T & T & T & T & T & T\
F & T & F & T & F & T & T & T\
F & F & T & T & T & T & T & T\
F & F & F & T & T & T & T & T\
end{array}
$$
answered Jan 23 at 20:14
user3067860user3067860
1913
1913
add a comment |
add a comment |
$begingroup$
It’s a sort of transitivity. $Pimplies Q$ is true. So if $Qimplies R$, then $Pimplies Qimplies R$. I don’t think there is a name for this. It’s just multiple implications that give a result.
Proving this is simple. Given $Qimplies R$, we want to demonstrate $Pimplies R$.
So let’s suppose that $P$ is true. So, $Q$ is true by $(Pimplies Q)$ (it’s called the “Modus ponens”). But $Q$ is true, so $R$ is true.
QED.
$endgroup$
add a comment |
$begingroup$
It’s a sort of transitivity. $Pimplies Q$ is true. So if $Qimplies R$, then $Pimplies Qimplies R$. I don’t think there is a name for this. It’s just multiple implications that give a result.
Proving this is simple. Given $Qimplies R$, we want to demonstrate $Pimplies R$.
So let’s suppose that $P$ is true. So, $Q$ is true by $(Pimplies Q)$ (it’s called the “Modus ponens”). But $Q$ is true, so $R$ is true.
QED.
$endgroup$
add a comment |
$begingroup$
It’s a sort of transitivity. $Pimplies Q$ is true. So if $Qimplies R$, then $Pimplies Qimplies R$. I don’t think there is a name for this. It’s just multiple implications that give a result.
Proving this is simple. Given $Qimplies R$, we want to demonstrate $Pimplies R$.
So let’s suppose that $P$ is true. So, $Q$ is true by $(Pimplies Q)$ (it’s called the “Modus ponens”). But $Q$ is true, so $R$ is true.
QED.
$endgroup$
It’s a sort of transitivity. $Pimplies Q$ is true. So if $Qimplies R$, then $Pimplies Qimplies R$. I don’t think there is a name for this. It’s just multiple implications that give a result.
Proving this is simple. Given $Qimplies R$, we want to demonstrate $Pimplies R$.
So let’s suppose that $P$ is true. So, $Q$ is true by $(Pimplies Q)$ (it’s called the “Modus ponens”). But $Q$ is true, so $R$ is true.
QED.
edited Jan 23 at 17:20
Sujit Bhattacharyya
1,092418
1,092418
answered Jan 23 at 16:26
FirmaprimFirmaprim
112
112
add a comment |
add a comment |
$begingroup$
If you want a conceptual proof, you just need to know how to prove an implication. How do you prove $Arightarrow B$? Assume $A$ is true, then show that $B$ follows (hoping you have some other information laying around to do this using $A$.
Step 1 To show:
$(P rightarrow Q) rightarrow ((Q rightarrow R) rightarrow (P rightarrow R))$,
assume $(P rightarrow Q)$ and show $(Q rightarrow R) rightarrow (P rightarrow R)$.step 2 To show $(Q rightarrow R) rightarrow (P rightarrow R)$, assume $Q rightarrow R$ and then show $P rightarrow R$.
step 3 To show $P rightarrow R$, assume $P$ and then show $R$.
At each stage we're assuming something so by this last step we've assumed a whole bunch that can help us to show $R$.
Using $P$, assumed true from the last step and $Prightarrow Q$ assumed true from step 1, $Q$ follows, via modus ponens.
Using this $Q$ and $Qrightarrow R$ assumed true from step 2, $R$ follows, again via modus ponens.
And we're done. In short, a chain of implications unraveled from left to right.
$endgroup$
add a comment |
$begingroup$
If you want a conceptual proof, you just need to know how to prove an implication. How do you prove $Arightarrow B$? Assume $A$ is true, then show that $B$ follows (hoping you have some other information laying around to do this using $A$.
Step 1 To show:
$(P rightarrow Q) rightarrow ((Q rightarrow R) rightarrow (P rightarrow R))$,
assume $(P rightarrow Q)$ and show $(Q rightarrow R) rightarrow (P rightarrow R)$.step 2 To show $(Q rightarrow R) rightarrow (P rightarrow R)$, assume $Q rightarrow R$ and then show $P rightarrow R$.
step 3 To show $P rightarrow R$, assume $P$ and then show $R$.
At each stage we're assuming something so by this last step we've assumed a whole bunch that can help us to show $R$.
Using $P$, assumed true from the last step and $Prightarrow Q$ assumed true from step 1, $Q$ follows, via modus ponens.
Using this $Q$ and $Qrightarrow R$ assumed true from step 2, $R$ follows, again via modus ponens.
And we're done. In short, a chain of implications unraveled from left to right.
$endgroup$
add a comment |
$begingroup$
If you want a conceptual proof, you just need to know how to prove an implication. How do you prove $Arightarrow B$? Assume $A$ is true, then show that $B$ follows (hoping you have some other information laying around to do this using $A$.
Step 1 To show:
$(P rightarrow Q) rightarrow ((Q rightarrow R) rightarrow (P rightarrow R))$,
assume $(P rightarrow Q)$ and show $(Q rightarrow R) rightarrow (P rightarrow R)$.step 2 To show $(Q rightarrow R) rightarrow (P rightarrow R)$, assume $Q rightarrow R$ and then show $P rightarrow R$.
step 3 To show $P rightarrow R$, assume $P$ and then show $R$.
At each stage we're assuming something so by this last step we've assumed a whole bunch that can help us to show $R$.
Using $P$, assumed true from the last step and $Prightarrow Q$ assumed true from step 1, $Q$ follows, via modus ponens.
Using this $Q$ and $Qrightarrow R$ assumed true from step 2, $R$ follows, again via modus ponens.
And we're done. In short, a chain of implications unraveled from left to right.
$endgroup$
If you want a conceptual proof, you just need to know how to prove an implication. How do you prove $Arightarrow B$? Assume $A$ is true, then show that $B$ follows (hoping you have some other information laying around to do this using $A$.
Step 1 To show:
$(P rightarrow Q) rightarrow ((Q rightarrow R) rightarrow (P rightarrow R))$,
assume $(P rightarrow Q)$ and show $(Q rightarrow R) rightarrow (P rightarrow R)$.step 2 To show $(Q rightarrow R) rightarrow (P rightarrow R)$, assume $Q rightarrow R$ and then show $P rightarrow R$.
step 3 To show $P rightarrow R$, assume $P$ and then show $R$.
At each stage we're assuming something so by this last step we've assumed a whole bunch that can help us to show $R$.
Using $P$, assumed true from the last step and $Prightarrow Q$ assumed true from step 1, $Q$ follows, via modus ponens.
Using this $Q$ and $Qrightarrow R$ assumed true from step 2, $R$ follows, again via modus ponens.
And we're done. In short, a chain of implications unraveled from left to right.
answered Jan 23 at 21:21
MitchMitch
6,0362560
6,0362560
add a comment |
add a comment |
$begingroup$
$ARightarrow B$ can be written as $neg Avee B.$ Therefore,
$$
(QRightarrow R)Rightarrow(PRightarrow R) \
=neg(neg Qvee R)vee (neg Pvee R) \
= (Q wedge neg R)vee (neg Pvee R) \
= (neg P vee Qvee R)wedge (neg P vee R vee neg R) \
= (neg P vee Qvee R) \
= (neg P vee Q)vee R \
= (PRightarrow Q) vee R
$$
$endgroup$
add a comment |
$begingroup$
$ARightarrow B$ can be written as $neg Avee B.$ Therefore,
$$
(QRightarrow R)Rightarrow(PRightarrow R) \
=neg(neg Qvee R)vee (neg Pvee R) \
= (Q wedge neg R)vee (neg Pvee R) \
= (neg P vee Qvee R)wedge (neg P vee R vee neg R) \
= (neg P vee Qvee R) \
= (neg P vee Q)vee R \
= (PRightarrow Q) vee R
$$
$endgroup$
add a comment |
$begingroup$
$ARightarrow B$ can be written as $neg Avee B.$ Therefore,
$$
(QRightarrow R)Rightarrow(PRightarrow R) \
=neg(neg Qvee R)vee (neg Pvee R) \
= (Q wedge neg R)vee (neg Pvee R) \
= (neg P vee Qvee R)wedge (neg P vee R vee neg R) \
= (neg P vee Qvee R) \
= (neg P vee Q)vee R \
= (PRightarrow Q) vee R
$$
$endgroup$
$ARightarrow B$ can be written as $neg Avee B.$ Therefore,
$$
(QRightarrow R)Rightarrow(PRightarrow R) \
=neg(neg Qvee R)vee (neg Pvee R) \
= (Q wedge neg R)vee (neg Pvee R) \
= (neg P vee Qvee R)wedge (neg P vee R vee neg R) \
= (neg P vee Qvee R) \
= (neg P vee Q)vee R \
= (PRightarrow Q) vee R
$$
answered Jan 23 at 23:53
Reinhard MeierReinhard Meier
2,872310
2,872310
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%2f3084690%2fwriting-a-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$
What is "R"? "P=> Q" says nothing about "R"! "P=> Q" does NOT say "if Q is true then R must be true". The conclusion says that "IF Q being true implies that some other statement R is true then P being true also implies that this "R" is true.
$endgroup$
– user247327
Jan 23 at 16:28
$begingroup$
Well because P is true Q must be true. Then we have Q => R and we know Q is true from previous assumption so therefore R is true. If R is true because of Q and Q is true because of P then R also must be true because of P
$endgroup$
– Molly
Jan 23 at 16:32
$begingroup$
This statement would have different proofs in different logical theories. In the theory you've been studying, do connectives like $rightarrow$ represent a valuation on mappings of the letters to "true" and "false"? Try a truth table, or maybe a reduction tree. Or are the connectives more abstract, and just symbols that appear in axioms? You'd need a sequence of formulae where each can be proved from previous and/or from the axioms.
$endgroup$
– aschepler
Jan 24 at 4:55