Natural deduction predicate logic for equality












1












$begingroup$


I have to use natural deduction on the following 2 sequents:
$$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
$$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$



At first I thought that the first one is pretty easy, but I am stuck.
$$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
$t_1=t_2 qquad qquad qquad qquad text{premise} \
(t+t_1)=(t+t_1)qquad qquad =_i \
(t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $



Now I am stuck at this point. I also tried to use $lor_e$ after $lor_i$, but I dont know how i can prove that.



The second one is a bit harder, but I have an idea.
$$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$
$(x=0)lor ((x+x)>0) qquad qquad text{premise} \
\ ______________________________________ \ (y=(x+x)) qquad qquad qquad qquad text{assumption}$



The next step is the $lor_e$ , where i want to show that $(x=0)to y>0$ and $((x+x)> 0)to y>0)$. But that is impossible, since the first implication never holds.



Can somebody help me with my problem?



Thank you










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    I have to use natural deduction on the following 2 sequents:
    $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
    $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$



    At first I thought that the first one is pretty easy, but I am stuck.
    $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
    $t_1=t_2 qquad qquad qquad qquad text{premise} \
    (t+t_1)=(t+t_1)qquad qquad =_i \
    (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $



    Now I am stuck at this point. I also tried to use $lor_e$ after $lor_i$, but I dont know how i can prove that.



    The second one is a bit harder, but I have an idea.
    $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$
    $(x=0)lor ((x+x)>0) qquad qquad text{premise} \
    \ ______________________________________ \ (y=(x+x)) qquad qquad qquad qquad text{assumption}$



    The next step is the $lor_e$ , where i want to show that $(x=0)to y>0$ and $((x+x)> 0)to y>0)$. But that is impossible, since the first implication never holds.



    Can somebody help me with my problem?



    Thank you










    share|cite|improve this question











    $endgroup$















      1












      1








      1


      1



      $begingroup$


      I have to use natural deduction on the following 2 sequents:
      $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
      $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$



      At first I thought that the first one is pretty easy, but I am stuck.
      $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
      $t_1=t_2 qquad qquad qquad qquad text{premise} \
      (t+t_1)=(t+t_1)qquad qquad =_i \
      (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $



      Now I am stuck at this point. I also tried to use $lor_e$ after $lor_i$, but I dont know how i can prove that.



      The second one is a bit harder, but I have an idea.
      $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$
      $(x=0)lor ((x+x)>0) qquad qquad text{premise} \
      \ ______________________________________ \ (y=(x+x)) qquad qquad qquad qquad text{assumption}$



      The next step is the $lor_e$ , where i want to show that $(x=0)to y>0$ and $((x+x)> 0)to y>0)$. But that is impossible, since the first implication never holds.



      Can somebody help me with my problem?



      Thank you










      share|cite|improve this question











      $endgroup$




      I have to use natural deduction on the following 2 sequents:
      $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
      $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$



      At first I thought that the first one is pretty easy, but I am stuck.
      $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
      $t_1=t_2 qquad qquad qquad qquad text{premise} \
      (t+t_1)=(t+t_1)qquad qquad =_i \
      (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $



      Now I am stuck at this point. I also tried to use $lor_e$ after $lor_i$, but I dont know how i can prove that.



      The second one is a bit harder, but I have an idea.
      $$(x=0)lor ((x+x)>0)vdash (y=(x+x))to ((y>0)lor (y=0+x))$$
      $(x=0)lor ((x+x)>0) qquad qquad text{premise} \
      \ ______________________________________ \ (y=(x+x)) qquad qquad qquad qquad text{assumption}$



      The next step is the $lor_e$ , where i want to show that $(x=0)to y>0$ and $((x+x)> 0)to y>0)$. But that is impossible, since the first implication never holds.



      Can somebody help me with my problem?



      Thank you







      logic first-order-logic predicate-logic natural-deduction formal-proofs






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 31 '18 at 7:34









      Taroccoesbrocco

      5,87471840




      5,87471840










      asked Dec 8 '15 at 23:44









      Patrick SweiglPatrick Sweigl

      258




      258






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          For the first one :



          1) $vdash t+t_2=t+t_2$ --- by $=$-intro



          2) $t_1=t_2 vdash t_2=t_1$ --- from 1) by $(=text{symmetric})$ : $s=t vdash t=s$, derivable with $=$-intro and $=$-elim



          3) $t_2=t_1, t+t_2=t+t_2 vdash t+t_1=t+t_2$ --- by $=$-elim : $s=t, ϕ[s/x] vdash ϕ[t/x]$, with $s,t$ terms substitutable for $x$ in $ϕ$, and $ϕ$ a formula : use $t+x=t+t_2$ as $ϕ$, $t_2$ as $s$ and $t_1$ as $t$.




          4) $t_1=t_2 vdash t+t_1=t+t_2$ --- from 1), 2) and 3).




          Note : the same derivation can be used for any term $r$; thus we can generalize it to the derived rule: $(=text{term})$ : $s=t vdash r[s/x]=r[t/x]$.





          For the 2nd one, we can split it into two sub-derivations:



          1) $x=0, y=x+x vdash y=0+x$ --- by $=$-elim, with $y=z+x$ as $ϕ$



          2) $x=0, y=x+x vdash (y >0) lor (y=0+x)$ --- from 1) by $lor$-intro




          3) $x=0 vdash (y=x+x) to ((y >0) lor (y=0+x))$ --- from 2) by $to$-intro.




          In the same way, we can derive :




          4) $(x+x)>0 ⊢ (y=x+x) → ((y>0) ∨ (y=0+x))$




          and then conclude by $lor$-elim from : $(x=0) lor (x+x)>0$.






          share|cite|improve this answer











          $endgroup$





















            1












            $begingroup$

            You write:




            At first I thought that the first one is pretty easy, but I am stuck.
            $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
            $t_1=t_2 qquad qquad qquad qquad text{premise} \
            (t+t_1)=(t+t_1)qquad qquad =_i \
            (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $




            Actually, it's very easy: when doing $=_e$ using $t_1=t_2$, you do not have to replace all instances of $t_1$ with $t_2$: you can just replace some of them. So, if you just replace the second $t_1$ in $(t+t_1)=(t+t_1)$ with $t_2$, you end up with the desired conclusion:



            $t_1=t_2 qquad qquad qquad qquad text{premise} \
            (t+t_1)=(t+t_1)qquad qquad =_i \
            (t+t_1)=(t+t_2) qquad qquad =_e 1,2 \ $






            share|cite|improve this answer









            $endgroup$














              Your Answer








              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
              });


              }
              });














              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1566742%2fnatural-deduction-predicate-logic-for-equality%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$

              For the first one :



              1) $vdash t+t_2=t+t_2$ --- by $=$-intro



              2) $t_1=t_2 vdash t_2=t_1$ --- from 1) by $(=text{symmetric})$ : $s=t vdash t=s$, derivable with $=$-intro and $=$-elim



              3) $t_2=t_1, t+t_2=t+t_2 vdash t+t_1=t+t_2$ --- by $=$-elim : $s=t, ϕ[s/x] vdash ϕ[t/x]$, with $s,t$ terms substitutable for $x$ in $ϕ$, and $ϕ$ a formula : use $t+x=t+t_2$ as $ϕ$, $t_2$ as $s$ and $t_1$ as $t$.




              4) $t_1=t_2 vdash t+t_1=t+t_2$ --- from 1), 2) and 3).




              Note : the same derivation can be used for any term $r$; thus we can generalize it to the derived rule: $(=text{term})$ : $s=t vdash r[s/x]=r[t/x]$.





              For the 2nd one, we can split it into two sub-derivations:



              1) $x=0, y=x+x vdash y=0+x$ --- by $=$-elim, with $y=z+x$ as $ϕ$



              2) $x=0, y=x+x vdash (y >0) lor (y=0+x)$ --- from 1) by $lor$-intro




              3) $x=0 vdash (y=x+x) to ((y >0) lor (y=0+x))$ --- from 2) by $to$-intro.




              In the same way, we can derive :




              4) $(x+x)>0 ⊢ (y=x+x) → ((y>0) ∨ (y=0+x))$




              and then conclude by $lor$-elim from : $(x=0) lor (x+x)>0$.






              share|cite|improve this answer











              $endgroup$


















                1












                $begingroup$

                For the first one :



                1) $vdash t+t_2=t+t_2$ --- by $=$-intro



                2) $t_1=t_2 vdash t_2=t_1$ --- from 1) by $(=text{symmetric})$ : $s=t vdash t=s$, derivable with $=$-intro and $=$-elim



                3) $t_2=t_1, t+t_2=t+t_2 vdash t+t_1=t+t_2$ --- by $=$-elim : $s=t, ϕ[s/x] vdash ϕ[t/x]$, with $s,t$ terms substitutable for $x$ in $ϕ$, and $ϕ$ a formula : use $t+x=t+t_2$ as $ϕ$, $t_2$ as $s$ and $t_1$ as $t$.




                4) $t_1=t_2 vdash t+t_1=t+t_2$ --- from 1), 2) and 3).




                Note : the same derivation can be used for any term $r$; thus we can generalize it to the derived rule: $(=text{term})$ : $s=t vdash r[s/x]=r[t/x]$.





                For the 2nd one, we can split it into two sub-derivations:



                1) $x=0, y=x+x vdash y=0+x$ --- by $=$-elim, with $y=z+x$ as $ϕ$



                2) $x=0, y=x+x vdash (y >0) lor (y=0+x)$ --- from 1) by $lor$-intro




                3) $x=0 vdash (y=x+x) to ((y >0) lor (y=0+x))$ --- from 2) by $to$-intro.




                In the same way, we can derive :




                4) $(x+x)>0 ⊢ (y=x+x) → ((y>0) ∨ (y=0+x))$




                and then conclude by $lor$-elim from : $(x=0) lor (x+x)>0$.






                share|cite|improve this answer











                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  For the first one :



                  1) $vdash t+t_2=t+t_2$ --- by $=$-intro



                  2) $t_1=t_2 vdash t_2=t_1$ --- from 1) by $(=text{symmetric})$ : $s=t vdash t=s$, derivable with $=$-intro and $=$-elim



                  3) $t_2=t_1, t+t_2=t+t_2 vdash t+t_1=t+t_2$ --- by $=$-elim : $s=t, ϕ[s/x] vdash ϕ[t/x]$, with $s,t$ terms substitutable for $x$ in $ϕ$, and $ϕ$ a formula : use $t+x=t+t_2$ as $ϕ$, $t_2$ as $s$ and $t_1$ as $t$.




                  4) $t_1=t_2 vdash t+t_1=t+t_2$ --- from 1), 2) and 3).




                  Note : the same derivation can be used for any term $r$; thus we can generalize it to the derived rule: $(=text{term})$ : $s=t vdash r[s/x]=r[t/x]$.





                  For the 2nd one, we can split it into two sub-derivations:



                  1) $x=0, y=x+x vdash y=0+x$ --- by $=$-elim, with $y=z+x$ as $ϕ$



                  2) $x=0, y=x+x vdash (y >0) lor (y=0+x)$ --- from 1) by $lor$-intro




                  3) $x=0 vdash (y=x+x) to ((y >0) lor (y=0+x))$ --- from 2) by $to$-intro.




                  In the same way, we can derive :




                  4) $(x+x)>0 ⊢ (y=x+x) → ((y>0) ∨ (y=0+x))$




                  and then conclude by $lor$-elim from : $(x=0) lor (x+x)>0$.






                  share|cite|improve this answer











                  $endgroup$



                  For the first one :



                  1) $vdash t+t_2=t+t_2$ --- by $=$-intro



                  2) $t_1=t_2 vdash t_2=t_1$ --- from 1) by $(=text{symmetric})$ : $s=t vdash t=s$, derivable with $=$-intro and $=$-elim



                  3) $t_2=t_1, t+t_2=t+t_2 vdash t+t_1=t+t_2$ --- by $=$-elim : $s=t, ϕ[s/x] vdash ϕ[t/x]$, with $s,t$ terms substitutable for $x$ in $ϕ$, and $ϕ$ a formula : use $t+x=t+t_2$ as $ϕ$, $t_2$ as $s$ and $t_1$ as $t$.




                  4) $t_1=t_2 vdash t+t_1=t+t_2$ --- from 1), 2) and 3).




                  Note : the same derivation can be used for any term $r$; thus we can generalize it to the derived rule: $(=text{term})$ : $s=t vdash r[s/x]=r[t/x]$.





                  For the 2nd one, we can split it into two sub-derivations:



                  1) $x=0, y=x+x vdash y=0+x$ --- by $=$-elim, with $y=z+x$ as $ϕ$



                  2) $x=0, y=x+x vdash (y >0) lor (y=0+x)$ --- from 1) by $lor$-intro




                  3) $x=0 vdash (y=x+x) to ((y >0) lor (y=0+x))$ --- from 2) by $to$-intro.




                  In the same way, we can derive :




                  4) $(x+x)>0 ⊢ (y=x+x) → ((y>0) ∨ (y=0+x))$




                  and then conclude by $lor$-elim from : $(x=0) lor (x+x)>0$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 10 '15 at 7:57

























                  answered Dec 9 '15 at 21:36









                  Mauro ALLEGRANZAMauro ALLEGRANZA

                  68.2k449117




                  68.2k449117























                      1












                      $begingroup$

                      You write:




                      At first I thought that the first one is pretty easy, but I am stuck.
                      $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
                      $t_1=t_2 qquad qquad qquad qquad text{premise} \
                      (t+t_1)=(t+t_1)qquad qquad =_i \
                      (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $




                      Actually, it's very easy: when doing $=_e$ using $t_1=t_2$, you do not have to replace all instances of $t_1$ with $t_2$: you can just replace some of them. So, if you just replace the second $t_1$ in $(t+t_1)=(t+t_1)$ with $t_2$, you end up with the desired conclusion:



                      $t_1=t_2 qquad qquad qquad qquad text{premise} \
                      (t+t_1)=(t+t_1)qquad qquad =_i \
                      (t+t_1)=(t+t_2) qquad qquad =_e 1,2 \ $






                      share|cite|improve this answer









                      $endgroup$


















                        1












                        $begingroup$

                        You write:




                        At first I thought that the first one is pretty easy, but I am stuck.
                        $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
                        $t_1=t_2 qquad qquad qquad qquad text{premise} \
                        (t+t_1)=(t+t_1)qquad qquad =_i \
                        (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $




                        Actually, it's very easy: when doing $=_e$ using $t_1=t_2$, you do not have to replace all instances of $t_1$ with $t_2$: you can just replace some of them. So, if you just replace the second $t_1$ in $(t+t_1)=(t+t_1)$ with $t_2$, you end up with the desired conclusion:



                        $t_1=t_2 qquad qquad qquad qquad text{premise} \
                        (t+t_1)=(t+t_1)qquad qquad =_i \
                        (t+t_1)=(t+t_2) qquad qquad =_e 1,2 \ $






                        share|cite|improve this answer









                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          You write:




                          At first I thought that the first one is pretty easy, but I am stuck.
                          $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
                          $t_1=t_2 qquad qquad qquad qquad text{premise} \
                          (t+t_1)=(t+t_1)qquad qquad =_i \
                          (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $




                          Actually, it's very easy: when doing $=_e$ using $t_1=t_2$, you do not have to replace all instances of $t_1$ with $t_2$: you can just replace some of them. So, if you just replace the second $t_1$ in $(t+t_1)=(t+t_1)$ with $t_2$, you end up with the desired conclusion:



                          $t_1=t_2 qquad qquad qquad qquad text{premise} \
                          (t+t_1)=(t+t_1)qquad qquad =_i \
                          (t+t_1)=(t+t_2) qquad qquad =_e 1,2 \ $






                          share|cite|improve this answer









                          $endgroup$



                          You write:




                          At first I thought that the first one is pretty easy, but I am stuck.
                          $$t_1=t_2 vdash (t+t_1)=(t+t_2)$$
                          $t_1=t_2 qquad qquad qquad qquad text{premise} \
                          (t+t_1)=(t+t_1)qquad qquad =_i \
                          (t+t_2)=(t+t_2) qquad qquad =_e 1,2 \ $




                          Actually, it's very easy: when doing $=_e$ using $t_1=t_2$, you do not have to replace all instances of $t_1$ with $t_2$: you can just replace some of them. So, if you just replace the second $t_1$ in $(t+t_1)=(t+t_1)$ with $t_2$, you end up with the desired conclusion:



                          $t_1=t_2 qquad qquad qquad qquad text{premise} \
                          (t+t_1)=(t+t_1)qquad qquad =_i \
                          (t+t_1)=(t+t_2) qquad qquad =_e 1,2 \ $







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Dec 31 '18 at 13:57









                          Bram28Bram28

                          64.7k44793




                          64.7k44793






























                              draft saved

                              draft discarded




















































                              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.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1566742%2fnatural-deduction-predicate-logic-for-equality%23new-answer', 'question_page');
                              }
                              );

                              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







                              Popular posts from this blog

                              Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

                              ComboBox Display Member on multiple fields

                              Is it possible to collect Nectar points via Trainline?