Question

Show that the following four conditions are equivalent:
(i) A ⊂ B (ii) A – B = Φ
(iii) A ∪ B = B (iv) A ∩ B = A
​

Answer 1

$\huge\underline\mathfrak\pink{♡Answer♡}$

According to the question,

To prove, (i) ⬌ (ii)

Here, (i) = A ⊂ B and (ii) = A – B ≠ ϕ

Let us assume that A ⊂ B

To prove, A – B ≠ ϕ

Let A – B ≠ ϕ

Hence, there exists X ∈ A, X ≠ B, but since

A⊂ B, it is not possible

∴ A – B = ϕ

And A⊂ B ⇒ A – B ≠ ϕ

Let us assume that A – B ≠ ϕ

To prove: A ⊂ B

Let X∈ A

So, X ∈ B (if X ∉ B, then A – B ≠ ϕ)

Hence, A – B = ϕ => A ⊂ B

∴(i) ⬌ (ii)

Let us assume that A ⊂ B

To prove, A ∪ B = B

⇒ B ⊂ A ∪ B

Let us assume that, x ∈ A∪ B

⇒ X ∈ A or X ∈ B

Taking Case I: X ∈ B

A ∪ B = B

Taking Case II: X ∈ A

⇒ X ∈ B (A ⊂ B)

⇒ A ∪ B ⊂ B

Let A ∪ B = B

Let us assume that X ∈ A

⇒ X ∈ A ∪ B (A ⊂ A ∪ B)

⇒ X ∈ B (A ∪ B = B)

∴A⊂ B

Hence, (i) ⬌ (iii)

To prove (i) ⬌ (iv)

Let us assume that A ⊂ B

A ∩ B ⊂ A

Let X ∈ A

To prove, X ∈ A∩ B

Since, A ⊂ B and X ∈ B

Hence, X ∈ A ∩ B

⇒ A ⊂ A ∩ B

⇒ A = A ∩ B

Let us assume that A ∩ B = A

Let X ∈ A

⇒ X ∈ A ∩ B

⇒ X ∈ B and X ∈ A

⇒ A ⊂ B

∴ (i) ⬌ (iv)

∴ (i) ⬌ (ii) ⬌ (iii) ⬌ (iv)

Hence, proved

Answer 2

Answer:

According to the question,

To prove, (i) ⬌ (ii)

Here, (i) = A ⊂ B and (ii) = A – B ≠ ϕ

Let us assume that A ⊂ B

To prove, A – B ≠ ϕ

Let A – B ≠ ϕ

Hence, there exists X ∈ A, X ≠ B, but since

A⊂ B, it is not possible

∴ A – B = ϕ

And A⊂ B ⇒ A – B ≠ ϕ

Let us assume that A – B ≠ ϕ

To prove: A ⊂ B

Let X∈ A

So, X ∈ B (if X ∉ B, then A – B ≠ ϕ)

Hence, A – B = ϕ => A ⊂ B

∴(i) ⬌ (ii)

Let us assume that A ⊂ B

To prove, A ∪ B = B

⇒ B ⊂ A ∪ B

Let us assume that, x ∈ A∪ B

⇒ X ∈ A or X ∈ B

Taking Case I: X ∈ B

A ∪ B = B

Taking Case II: X ∈ A

⇒ X ∈ B (A ⊂ B)

⇒ A ∪ B ⊂ B

Let A ∪ B = B

Let us assume that X ∈ A

⇒ X ∈ A ∪ B (A ⊂ A ∪ B)

⇒ X ∈ B (A ∪ B = B)

∴A⊂ B

Hence, (i) ⬌ (iii)

To prove (i) ⬌ (iv)

Let us assume that A ⊂ B

A ∩ B ⊂ A

Let X ∈ A

To prove, X ∈ A∩ B

Since, A ⊂ B and X ∈ B

Hence, X ∈ A ∩ B

⇒ A ⊂ A ∩ B

⇒ A = A ∩ B

Let us assume that A ∩ B = A

Let X ∈ A

⇒ X ∈ A ∩ B

⇒ X ∈ B and X ∈ A

⇒ A ⊂ B

∴ (i) ⬌ (iv)

∴ (i) ⬌ (ii) ⬌ (iii) ⬌ (iv)

Hence, proved