Prove, that for all sets A, B, C and D, in which $A subseteq B$ and $C subseteq D$, given formula: $A...












0














Knowing
$$A subseteq B Leftrightarrow (xin A Longrightarrow xin B)$$
$$C subseteq D Leftrightarrow (xin C Longrightarrow xin D)\$$
I tried to prove, that for any $yin A$ and $zin D$, given formula
$$A setminus D subseteq Bsetminus C$$
is true, but I got stuck almost at the beginning, when I tried to show $$(y,z)in Asetminus Dequiv {yin A}wedge {znotin D}$$ and I am not really sure what should I do now. Although I know, that if $xnotin D$, then $xnotin C$, but it really leads me to nowhere. I would like to see a formal proof of this. Thanks in advance.










share|cite|improve this question


















  • 1




    It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
    – Arthur
    Nov 25 at 14:47












  • Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
    – whiskeyo
    Nov 25 at 15:01
















0














Knowing
$$A subseteq B Leftrightarrow (xin A Longrightarrow xin B)$$
$$C subseteq D Leftrightarrow (xin C Longrightarrow xin D)\$$
I tried to prove, that for any $yin A$ and $zin D$, given formula
$$A setminus D subseteq Bsetminus C$$
is true, but I got stuck almost at the beginning, when I tried to show $$(y,z)in Asetminus Dequiv {yin A}wedge {znotin D}$$ and I am not really sure what should I do now. Although I know, that if $xnotin D$, then $xnotin C$, but it really leads me to nowhere. I would like to see a formal proof of this. Thanks in advance.










share|cite|improve this question


















  • 1




    It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
    – Arthur
    Nov 25 at 14:47












  • Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
    – whiskeyo
    Nov 25 at 15:01














0












0








0







Knowing
$$A subseteq B Leftrightarrow (xin A Longrightarrow xin B)$$
$$C subseteq D Leftrightarrow (xin C Longrightarrow xin D)\$$
I tried to prove, that for any $yin A$ and $zin D$, given formula
$$A setminus D subseteq Bsetminus C$$
is true, but I got stuck almost at the beginning, when I tried to show $$(y,z)in Asetminus Dequiv {yin A}wedge {znotin D}$$ and I am not really sure what should I do now. Although I know, that if $xnotin D$, then $xnotin C$, but it really leads me to nowhere. I would like to see a formal proof of this. Thanks in advance.










share|cite|improve this question













Knowing
$$A subseteq B Leftrightarrow (xin A Longrightarrow xin B)$$
$$C subseteq D Leftrightarrow (xin C Longrightarrow xin D)\$$
I tried to prove, that for any $yin A$ and $zin D$, given formula
$$A setminus D subseteq Bsetminus C$$
is true, but I got stuck almost at the beginning, when I tried to show $$(y,z)in Asetminus Dequiv {yin A}wedge {znotin D}$$ and I am not really sure what should I do now. Although I know, that if $xnotin D$, then $xnotin C$, but it really leads me to nowhere. I would like to see a formal proof of this. Thanks in advance.







elementary-set-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 25 at 14:41









whiskeyo

435




435








  • 1




    It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
    – Arthur
    Nov 25 at 14:47












  • Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
    – whiskeyo
    Nov 25 at 15:01














  • 1




    It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
    – Arthur
    Nov 25 at 14:47












  • Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
    – whiskeyo
    Nov 25 at 15:01








1




1




It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
– Arthur
Nov 25 at 14:47






It's supposed to be $yin Asetminus Diff {yin A}wedge {ynotin D}$. No $z$ anywhere.
– Arthur
Nov 25 at 14:47














Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
– whiskeyo
Nov 25 at 15:01




Thank you, I was trying to prove it the same way as I did for $Acup C subseteq Bcup D$, that's why I used two elements.
– whiskeyo
Nov 25 at 15:01










2 Answers
2






active

oldest

votes


















0














The problem is in your assumption: $$(y,z) in A setminus D$$



When showing membership for a non-relational set we suppose a single element in the set, not an ordered pair. This is how it should go:
$$xin (Asetminus D)implies xin A land x notin D$$



Notice, $Csubseteq D implies (forall x)[(x in C)rightarrow (x in D)]$, consequently, by modus tollens $xnotin D implies xnotin C$



Since $A subseteq B land C subseteq D$, then:
$$(xin A implies xin B) land (xnotin D implies xnotin C)$$



Therefore, $$x in A setminus D implies xin B setminus C$$
$$Asetminus D subseteq Bsetminus C$$






share|cite|improve this answer































    0














    $C subseteq D Leftrightarrow D^{complement} subseteq C^{complement}$



    So $A setminus D = A cap D^{complement} subseteq B cap C^{complement} = B setminus C$ as $A subseteq B$ as well, and if we replace two sets in the intersection by posibly larger sets, we get a possibly larger set.






    share|cite|improve this answer





















      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%2f3012918%2fprove-that-for-all-sets-a-b-c-and-d-in-which-a-subseteq-b-and-c-subsete%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









      0














      The problem is in your assumption: $$(y,z) in A setminus D$$



      When showing membership for a non-relational set we suppose a single element in the set, not an ordered pair. This is how it should go:
      $$xin (Asetminus D)implies xin A land x notin D$$



      Notice, $Csubseteq D implies (forall x)[(x in C)rightarrow (x in D)]$, consequently, by modus tollens $xnotin D implies xnotin C$



      Since $A subseteq B land C subseteq D$, then:
      $$(xin A implies xin B) land (xnotin D implies xnotin C)$$



      Therefore, $$x in A setminus D implies xin B setminus C$$
      $$Asetminus D subseteq Bsetminus C$$






      share|cite|improve this answer




























        0














        The problem is in your assumption: $$(y,z) in A setminus D$$



        When showing membership for a non-relational set we suppose a single element in the set, not an ordered pair. This is how it should go:
        $$xin (Asetminus D)implies xin A land x notin D$$



        Notice, $Csubseteq D implies (forall x)[(x in C)rightarrow (x in D)]$, consequently, by modus tollens $xnotin D implies xnotin C$



        Since $A subseteq B land C subseteq D$, then:
        $$(xin A implies xin B) land (xnotin D implies xnotin C)$$



        Therefore, $$x in A setminus D implies xin B setminus C$$
        $$Asetminus D subseteq Bsetminus C$$






        share|cite|improve this answer


























          0












          0








          0






          The problem is in your assumption: $$(y,z) in A setminus D$$



          When showing membership for a non-relational set we suppose a single element in the set, not an ordered pair. This is how it should go:
          $$xin (Asetminus D)implies xin A land x notin D$$



          Notice, $Csubseteq D implies (forall x)[(x in C)rightarrow (x in D)]$, consequently, by modus tollens $xnotin D implies xnotin C$



          Since $A subseteq B land C subseteq D$, then:
          $$(xin A implies xin B) land (xnotin D implies xnotin C)$$



          Therefore, $$x in A setminus D implies xin B setminus C$$
          $$Asetminus D subseteq Bsetminus C$$






          share|cite|improve this answer














          The problem is in your assumption: $$(y,z) in A setminus D$$



          When showing membership for a non-relational set we suppose a single element in the set, not an ordered pair. This is how it should go:
          $$xin (Asetminus D)implies xin A land x notin D$$



          Notice, $Csubseteq D implies (forall x)[(x in C)rightarrow (x in D)]$, consequently, by modus tollens $xnotin D implies xnotin C$



          Since $A subseteq B land C subseteq D$, then:
          $$(xin A implies xin B) land (xnotin D implies xnotin C)$$



          Therefore, $$x in A setminus D implies xin B setminus C$$
          $$Asetminus D subseteq Bsetminus C$$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 25 at 15:01

























          answered Nov 25 at 14:56









          Bertrand Wittgenstein's Ghost

          352114




          352114























              0














              $C subseteq D Leftrightarrow D^{complement} subseteq C^{complement}$



              So $A setminus D = A cap D^{complement} subseteq B cap C^{complement} = B setminus C$ as $A subseteq B$ as well, and if we replace two sets in the intersection by posibly larger sets, we get a possibly larger set.






              share|cite|improve this answer


























                0














                $C subseteq D Leftrightarrow D^{complement} subseteq C^{complement}$



                So $A setminus D = A cap D^{complement} subseteq B cap C^{complement} = B setminus C$ as $A subseteq B$ as well, and if we replace two sets in the intersection by posibly larger sets, we get a possibly larger set.






                share|cite|improve this answer
























                  0












                  0








                  0






                  $C subseteq D Leftrightarrow D^{complement} subseteq C^{complement}$



                  So $A setminus D = A cap D^{complement} subseteq B cap C^{complement} = B setminus C$ as $A subseteq B$ as well, and if we replace two sets in the intersection by posibly larger sets, we get a possibly larger set.






                  share|cite|improve this answer












                  $C subseteq D Leftrightarrow D^{complement} subseteq C^{complement}$



                  So $A setminus D = A cap D^{complement} subseteq B cap C^{complement} = B setminus C$ as $A subseteq B$ as well, and if we replace two sets in the intersection by posibly larger sets, we get a possibly larger set.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 25 at 15:12









                  Henno Brandsma

                  104k346113




                  104k346113






























                      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.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • 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.


                      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%2f3012918%2fprove-that-for-all-sets-a-b-c-and-d-in-which-a-subseteq-b-and-c-subsete%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

                      Le Mesnil-Réaume

                      Ida-Boy-Ed-Garten

                      Bundesstraße 106