Tricky proof in Natural Deduction [¬∀x∃y¬Rxy ⊢ ∃x∀yRxy]-help appreciated












0












$begingroup$


As it says in the title, I'm trying to prove the statement ¬∀x∃y¬Rxy ⊢ ∃x∀yRxy in the system of Natural Deduction, with basic rules for negation intro and elimination, and existential or universal quantifier intro and elim.



I can use the premiss to create a contradiction, so the penultimate line might be:



¬∀x∃y¬Rxy ∀x∃y¬Rxy



     ∃x∀yRxy


But how do I derive the assumption ∀x∃y¬Rxy? It might be:



               ¬Rab 
∃y¬Ray
∀x∃y¬Rxy


So ¬Rab must be derived from some assumption Rab that leads to contradiction-that's where I'm stuck! Any help appreciated-this is not my homework or anything, it just bugs me!










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    As it says in the title, I'm trying to prove the statement ¬∀x∃y¬Rxy ⊢ ∃x∀yRxy in the system of Natural Deduction, with basic rules for negation intro and elimination, and existential or universal quantifier intro and elim.



    I can use the premiss to create a contradiction, so the penultimate line might be:



    ¬∀x∃y¬Rxy ∀x∃y¬Rxy



         ∃x∀yRxy


    But how do I derive the assumption ∀x∃y¬Rxy? It might be:



                   ¬Rab 
    ∃y¬Ray
    ∀x∃y¬Rxy


    So ¬Rab must be derived from some assumption Rab that leads to contradiction-that's where I'm stuck! Any help appreciated-this is not my homework or anything, it just bugs me!










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      As it says in the title, I'm trying to prove the statement ¬∀x∃y¬Rxy ⊢ ∃x∀yRxy in the system of Natural Deduction, with basic rules for negation intro and elimination, and existential or universal quantifier intro and elim.



      I can use the premiss to create a contradiction, so the penultimate line might be:



      ¬∀x∃y¬Rxy ∀x∃y¬Rxy



           ∃x∀yRxy


      But how do I derive the assumption ∀x∃y¬Rxy? It might be:



                     ¬Rab 
      ∃y¬Ray
      ∀x∃y¬Rxy


      So ¬Rab must be derived from some assumption Rab that leads to contradiction-that's where I'm stuck! Any help appreciated-this is not my homework or anything, it just bugs me!










      share|cite|improve this question









      $endgroup$




      As it says in the title, I'm trying to prove the statement ¬∀x∃y¬Rxy ⊢ ∃x∀yRxy in the system of Natural Deduction, with basic rules for negation intro and elimination, and existential or universal quantifier intro and elim.



      I can use the premiss to create a contradiction, so the penultimate line might be:



      ¬∀x∃y¬Rxy ∀x∃y¬Rxy



           ∃x∀yRxy


      But how do I derive the assumption ∀x∃y¬Rxy? It might be:



                     ¬Rab 
      ∃y¬Ray
      ∀x∃y¬Rxy


      So ¬Rab must be derived from some assumption Rab that leads to contradiction-that's where I'm stuck! Any help appreciated-this is not my homework or anything, it just bugs me!







      predicate-logic first-order-logic natural-deduction






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 18 '15 at 20:35









      user211309user211309

      414




      414






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          We need :



          1) $¬∀x∃y¬Rxy$ --- premise



          2) $¬∃x∀yRxy$ --- assumption [a] : the assumption to be contradicted, deriving (by Double Negation) the sought conclusion : $∃x∀yRxy$



          3) $∀yRxy$ --- assumption [b] : in order to derive a contradiction with 2) to conclude, by $¬$-intro, with : $¬∀yRxy$, discharging [b].



          Now we need a "detour", in order to derive from $¬∀yRxy$ the classically equivalent : $∃y¬Rxy$.



          Having derived $∃y¬Rxy$, we can "generalize" it to $∀x∃y¬Rxy$. We can do it, because neither in the premise nor into assumption [a] $x$ is free.



          Thus, $∀x∃y¬Rxy$ contradicts the premise 1) and we can conclude by Double Negation again with :




          $∃x∀yRxy$,




          discharging [a].






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
            $endgroup$
            – user211309
            Nov 19 '15 at 10:43











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


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1535779%2ftricky-proof-in-natural-deduction-%25c2%25ac%25e2%2588%2580x%25e2%2588%2583y%25c2%25acrxy-%25e2%258a%25a2-%25e2%2588%2583x%25e2%2588%2580yrxy-help-appreciated%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









          2












          $begingroup$

          We need :



          1) $¬∀x∃y¬Rxy$ --- premise



          2) $¬∃x∀yRxy$ --- assumption [a] : the assumption to be contradicted, deriving (by Double Negation) the sought conclusion : $∃x∀yRxy$



          3) $∀yRxy$ --- assumption [b] : in order to derive a contradiction with 2) to conclude, by $¬$-intro, with : $¬∀yRxy$, discharging [b].



          Now we need a "detour", in order to derive from $¬∀yRxy$ the classically equivalent : $∃y¬Rxy$.



          Having derived $∃y¬Rxy$, we can "generalize" it to $∀x∃y¬Rxy$. We can do it, because neither in the premise nor into assumption [a] $x$ is free.



          Thus, $∀x∃y¬Rxy$ contradicts the premise 1) and we can conclude by Double Negation again with :




          $∃x∀yRxy$,




          discharging [a].






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
            $endgroup$
            – user211309
            Nov 19 '15 at 10:43
















          2












          $begingroup$

          We need :



          1) $¬∀x∃y¬Rxy$ --- premise



          2) $¬∃x∀yRxy$ --- assumption [a] : the assumption to be contradicted, deriving (by Double Negation) the sought conclusion : $∃x∀yRxy$



          3) $∀yRxy$ --- assumption [b] : in order to derive a contradiction with 2) to conclude, by $¬$-intro, with : $¬∀yRxy$, discharging [b].



          Now we need a "detour", in order to derive from $¬∀yRxy$ the classically equivalent : $∃y¬Rxy$.



          Having derived $∃y¬Rxy$, we can "generalize" it to $∀x∃y¬Rxy$. We can do it, because neither in the premise nor into assumption [a] $x$ is free.



          Thus, $∀x∃y¬Rxy$ contradicts the premise 1) and we can conclude by Double Negation again with :




          $∃x∀yRxy$,




          discharging [a].






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
            $endgroup$
            – user211309
            Nov 19 '15 at 10:43














          2












          2








          2





          $begingroup$

          We need :



          1) $¬∀x∃y¬Rxy$ --- premise



          2) $¬∃x∀yRxy$ --- assumption [a] : the assumption to be contradicted, deriving (by Double Negation) the sought conclusion : $∃x∀yRxy$



          3) $∀yRxy$ --- assumption [b] : in order to derive a contradiction with 2) to conclude, by $¬$-intro, with : $¬∀yRxy$, discharging [b].



          Now we need a "detour", in order to derive from $¬∀yRxy$ the classically equivalent : $∃y¬Rxy$.



          Having derived $∃y¬Rxy$, we can "generalize" it to $∀x∃y¬Rxy$. We can do it, because neither in the premise nor into assumption [a] $x$ is free.



          Thus, $∀x∃y¬Rxy$ contradicts the premise 1) and we can conclude by Double Negation again with :




          $∃x∀yRxy$,




          discharging [a].






          share|cite|improve this answer









          $endgroup$



          We need :



          1) $¬∀x∃y¬Rxy$ --- premise



          2) $¬∃x∀yRxy$ --- assumption [a] : the assumption to be contradicted, deriving (by Double Negation) the sought conclusion : $∃x∀yRxy$



          3) $∀yRxy$ --- assumption [b] : in order to derive a contradiction with 2) to conclude, by $¬$-intro, with : $¬∀yRxy$, discharging [b].



          Now we need a "detour", in order to derive from $¬∀yRxy$ the classically equivalent : $∃y¬Rxy$.



          Having derived $∃y¬Rxy$, we can "generalize" it to $∀x∃y¬Rxy$. We can do it, because neither in the premise nor into assumption [a] $x$ is free.



          Thus, $∀x∃y¬Rxy$ contradicts the premise 1) and we can conclude by Double Negation again with :




          $∃x∀yRxy$,




          discharging [a].







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 19 '15 at 8:00









          Mauro ALLEGRANZAMauro ALLEGRANZA

          67.2k449115




          67.2k449115












          • $begingroup$
            Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
            $endgroup$
            – user211309
            Nov 19 '15 at 10:43


















          • $begingroup$
            Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
            $endgroup$
            – user211309
            Nov 19 '15 at 10:43
















          $begingroup$
          Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
          $endgroup$
          – user211309
          Nov 19 '15 at 10:43




          $begingroup$
          Thanks Mauro, I've got it now! I didn't use the right assumption, that got me into trouble.
          $endgroup$
          – user211309
          Nov 19 '15 at 10:43


















          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%2f1535779%2ftricky-proof-in-natural-deduction-%25c2%25ac%25e2%2588%2580x%25e2%2588%2583y%25c2%25acrxy-%25e2%258a%25a2-%25e2%2588%2583x%25e2%2588%2580yrxy-help-appreciated%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

          Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

          Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

          A Topological Invariant for $pi_3(U(n))$