vrble
- 15
- 0
1. Suppose A \ B\subseteqC\capD and x\inA. Prove that if x \notinD then x\inB
2. None
3. Proof: Suppose A \ B\subseteqC\capD, x\inA, and x\notinD. It follows that our first assumption is equivalent to A due to our third assumption. Thus, B\subseteqC\capD is disjoint and either x\notinB\subseteqC or x\notinD. Let us temporarily assume that it is the case that x\notinB\subseteqC, then this may be expressed equivalently as x\inB and x\notinC, a contradiction with the definition of subsets, thus x must be an element of B and C provided x\notinDI'm not entirely sure if all of my reasoning is correct.
2. None
3. Proof: Suppose A \ B\subseteqC\capD, x\inA, and x\notinD. It follows that our first assumption is equivalent to A due to our third assumption. Thus, B\subseteqC\capD is disjoint and either x\notinB\subseteqC or x\notinD. Let us temporarily assume that it is the case that x\notinB\subseteqC, then this may be expressed equivalently as x\inB and x\notinC, a contradiction with the definition of subsets, thus x must be an element of B and C provided x\notinDI'm not entirely sure if all of my reasoning is correct.
Last edited by a moderator: