Akli Mohand Oulhadj University- Bouira Academic year : 2024/2025

Faculty of Sciences and Applied Sciences

Computer Science Departement Course : Algebra 1
First year Informatics Teacher : Dr. L.BOUCHAL

Correction of Exercises Sheet N◦ 2 : Sets and Applications

Reminder 1.
1. CE A = {x ∈ E : x ∈
/ A}.
2. A ∪ B = {x : x ∈ A or x ∈ B}.
3. A ∩ B = {x : x ∈ A and x ∈ B}.
4. A \ B = {x : x ∈ A and x ∈
/ B}.
5. A∆B = (A \ B) ∪ (B \ A).

Reminder 2.
Power set : The power set of E denoted by P (E) is the collection of all subsets of E.

P (E) = {A, A ⊂ E}.

Cartesian product : A × B = {(x, y) : x ∈ A and y ∈ B}.

Solution of exercise 1.
1. Write explicitly the set of odd numbers between e and π 2 .
We have : e ≈ 2, 71 and π 2 ≈ 9, 86 then A = {3, 5, 7, 9}
Write implicitly the set B = {2, 4, 8, 16, 32} the set B can be written in the form :

B = {2n : n ∈ {1, 2, 3, 4, 5}}.

2. Let E = {1, 2, 3, 4, 5, 6, 7, 8} and let A, B and C be three subsets of E

A = {1, 4, 5, 6}, B = {3, 4, 5, 7}, C = {5, 6, 7, 8}

(i) Are the following statements true ?

— C \ A = {7, 8}, then 6 ∈ C \ A is false.
— A ∪ B = {1, 3, 4, 5, 6, 7} then {1, 6} ⊂ (A ∪ B) is true.
— CE B = {1, 2, 6, 8}
A ∩ CE B = {1, 6} then 7 ∈ (A ∩ CE B) is false.
— CE A = {2, 3, 7, 8}
CE A ∪ CE B = {1, 2, 3, 6, 7, 8} then 3 ∈ (CE A ∪ CE B) is true.
 Dr. L.BOUCHAL

(ii) Write the sets P(A) and B × C.

 
 ∅, A, {1}, {4}, {5}, {6}, 
P (A) = {1, 4}, {1, 5}, {1, 6}, {4, 5}, {4, 6}, {5, 6},
{1, 4, 5}, {1, 4, 6}, {1, 5, 6}{4, 5, 6}
 
 

 {3, 5}, {3, 6}, {3, 7}, {3, 8}, 

{4, 5}, {4, 6}, {4, 7}, {4, 8},
 
B×C =

 {5, 5}, {5, 6}, {5, 7}{5, 8},  
{7, 5}, {7, 6}, {7, 7}{7, 8}
 

Reminder 3. 
CE (A ∪ B) = (CE A) ∩ (CE B)
1. (De Morgan’s laws).
CE (A ∩ B) = (CE A) ∪ (CE B)

Solution of exercise 2. Let A, B and C be three subsets of E.

1. Simplify these two expressions :
(i)
CE (A ∪ B) ∩ CE (C ∪ CE A) = [(CE A) ∩ (CE B)] ∩ [CE C ∩ A]
= [(CE A) ∩ A)] ∩ [CE B ∩ CE C]
= ∅ ∩ [CE B ∩ CE C]
= ∅.
(ii)
CE (A ∩ B) ∪ CE (C ∩ CE C) = [(CE A) ∪ (CE B)] ∪ [CE ∅]
= (CE A) ∪ (CE B) ∪ E
= E.
2. Show that :
(i) A ∪ B = (A ∩ B) ∪ (A 4 B) ;

Let x ∈ A ∪ B ⇔ x ∈ A or x ∈ B
⇔ (x ∈ A and x ∈ B) or (x ∈ A and x ∈/ B) or (x ∈
/ A and x ∈ B)
⇔ x ∈ (A ∩ B) or [(x ∈ A \ B) or (x ∈ B \ A)]
⇔ x ∈ (A ∩ B) or x ∈ (A \ B) ∪ (B \ A)
⇔ x ∈ (A ∩ B) ∪ (A 4 B).

(ii) (A ∩ B) = (A ∪ B) ⇒ A = B ;
Suppose that (A ∩ B) = (A ∪ B) and lets show that A = B, showing that A = B
comes back to show the double inclusion A ⊂ B and B ⊂ A.
(a) Lets show that A ⊂ B

Let x ∈ A ⇒ x ∈ A ∪ B ⇒ x ∈ A ∩ B ( since (A ∩ B) = (A ∪ B))

⇒ x ∈ A and x ∈ B
⇒ x ∈ B,

then A ⊂ B.

2
 Dr. L.BOUCHAL

(b) Lets show that B ⊂ A

Let x ∈ B ⇒ x ∈ A ∪ B ⇒ x ∈ A ∩ B ( since (A ∩ B) = (A ∪ B))

⇒ x ∈ A and x ∈ B
⇒ x ∈ A,
then B ⊂ A.
(iii) A ⊂ B ⇔ A ∪ B = B ⇔ CE B ⊂ CE A ;
To show that X ⇔ Y ⇔ Z we show that X ⇔ Y and X ⇔ Z.

• A⊂B ⇔A∪B =B
(a) A ⊂ B ⇒ A ∪ B = B :
Suppose that A ⊂ B and show that A ∪ B = B (we have to show the double
inclusion A ∪ B ⊂ B and B ⊂ A ∪ B )

if x ∈ A ⇒ x ∈ B( because A ⊂ B)
Let x ∈ A ∪ B ⇒ x ∈ A or x ∈ B ⇒
if x ∈ B end
then (A ∪ B) ⊂ B.
On the other side,

Let x ∈ B ⇒ x ∈ A ∪ B, then B ⊂ (A ∪ B).

Then
A ⊂ B ⇒ A ∪ B = B. (1)
(b) A ∪ B = B ⇒ A ⊂ B :
Suppose that A ∪ B = B and show that A ⊂ B.
Let x ∈ A ⇒ x ∈ A ∪ B ⇒ x ∈ B (because A ∪ B = B), then A ⊂ B.
Then
A ∪ B = B ⇒ A ⊂ B. (2)
Conclusion : From (1) and (2), we conclude that A ⊂ B ⇔ A ∪ B = B.
• A ⊂ B ⇔ CE B ⊂ CE A :
(a) A ⊂ B ⇒ CE B ⊂ CE A :
Suppose that A ⊂ B and show that CE B ⊂ CE A.

Let x ∈ CE B ⇒ x ∈
/B⇒ x∈/ A(because A ⊂ B)
⇒ x ∈ CE A.
Then
A ⊂ B ⇒ CE B ⊂ CE A. (3)
(b) CE B ⊂ CE A ⇒ A ⊂ B :
Suppose that CE B ⊂ CE A and show that A ⊂ B.

Let x ∈ A ⇒ x ∈
/ CE A ⇒ x ∈
/ CE B(because CE B ⊂ CE A)
⇒ x ∈ B.
Then
CE B ⊂ CE A ⇔ A ⊂ B. (4)

3
 Dr. L.BOUCHAL

Conclusion : From (3) and (4), we conclude that A ⊂ B ⇔ CE B ⊂ CE A.

Conclusion : We have

A⊂B ⇔A∪B =B
and Then A ⊂ B ⇔ A ∪ B = B ⇔ CE B ⊂ CE A.
A ⊂ B ⇔ CE B ⊂ CE A

Reminder 4. Let f : E → F be a mapping, A ⊂ E and B ⊂ F .

Direct image : f (A) = {f (x) : x ∈ A}.
Preimage : f −1 (B) = {x ∈ E : f (x) ∈ B} ⊂ E.
1
Solution of exercise 3. Let the mapping f : R → R defined by f (x) = 1+x 2 . Let

   
1 1
A = [1, 2], B = 0, −1, − , C = [0, 1[, D = , 1, −2 .
2 2

We draw the table of variation of f : We have f 0 (x) = −2x

(1+x2 )2
≤ 0, ∀x ∈ R.

x −∞ 0 +∞

f 0 (x) + 0 −

f(0)=1
f (x)
0 0

1. Determine f (A), f (B), f (A ∪ B), f (A ∩ B). Compare to f (A) ∪ f (B) and f (A) ∩ f (B).

We have :

f (A) = f ([1, 2]) = [f (2), f (1)] = [ 15 , 12 ]

f (B) = f ({0, −1, − 21 }) = {f (0), f (−1), f (− 21 )} = {1, 12 , 54 }

f (A ∪ B) = f ([1, 2] ∪ {0, −1, − 12 }) = {[ 15 , 21 ] ∪ {1, 21 , 45 }} = {[ 15 , 21 ], 1, 45 }

f (A ∩ B) = f ([1, 2] ∩ {0, −1, − 12 }) = f (∅) = ∅

f (A) ∩ f (B) = [ 15 , 12 ] ∩ {1, 21 , 45 } = { 21 }

Then we have
f (A ∩ B) ⊂ (f (A) ∩ f (B))
and
f (A ∪ B) = (f (A) ∪ f (B)).
2. Determine f −1 (C), f −1 (D), f −1 (C ∪ D), f −1 (C ∩ D). Compare to f −1 (C) ∪ f −1 (D) and
f −1 (C) ∩ f −1 (D).

4
 Dr. L.BOUCHAL

f −1 (C) = f −1 ([0, 1[) = {x ∈ R : f (x) ∈ [0, 1[} =] − ∞, 0[∪]0, +∞[= R∗

f −1 (D) = f −1 ( 21 , 1, −2 )


1
x ∈ R : f (x) ∈

= 2
, 1, −2

1 1 1 1
x∈R:

= 1+x2
= 2
or 1+x2
= 1 or 1+x2
= −2

= {x ∈ R : 2 = 1 + x2 or 1 = 1 + x2 or 1 = −2 − 2x2 }

x ∈ R : (x2 = 1 ⇒ (x = 1 or x = −1)) or (x2 = 0 ⇒ x = 0) or (x2 = − 32 )( rejected )


=

= {−1, 1, 0}

f −1 (C ∪ D) = {x ∈ R : f (x) ∈ (C ∪ D)}
1
x ∈ R : f (x) ∈ ([0, 1[∪

= 2
, 1, −2 )
1
x ∈ R : f (x) ∈ [0, 1[ or f (x) ∈

= 2
, 1, −2

x ∈ R : x ∈ R∗ or (x = 1 or x = −1) or (x = 0) or (x2 = − 23 )( rejected )


=

= R.

f −1 (C ∩ D) = {x ∈ R : f (x) ∈ (C ∩ D)}
1
x ∈ R : f (x) ∈ ([0, 1[∩

= 2
, 1, −2 )
1
x ∈ R : f (x) ∈

= 2

1
x ∈ R : f (x) =

= 2

1 1
x∈R:

= 1+x2
= 2

= {x ∈ R : 2 = 1 + x2 }

= {x ∈ R : x2 = 1 ⇒ (x = 1 or x = −1)}

= {−1, 1} .
We have,

f −1 (C) ∪ f −1 (D) = R∗ ∪ {−1, 0, 1} = R = f −1 (C ∪ D)

f −1 (C) ∩ f −1 (D) = R∗ ∩ {−1, 0, 1} = {−1, 1} = f −1 (C ∩ D).
Then
f −1 (C) ∪ f −1 (D) = f −1 (C ∪ D) and f −1 (C) ∩ f −1 (D) = f −1 (C ∩ D).

5
 Dr. L.BOUCHAL

Solution of exercise 4. Let the following mappings :

f :N×N→ N g:N→ N h:N→ N

(x, y) 7→ x2 + xy − x.

x 7→ x + 1. 0 if x = 0
x 7→
x−1 if x ≥ 1.

1. Determine f ({(0, 2); (0, 4)}) and f ({(1, y); y ∈ N)}).

We have

f (0, 2) = 0
f ({(0, 2); (0, 4)}) = 0.
f (0, 4) = 0
and

f ({(1, y); y ∈ N)}) = 12 + (1)(y) − 1 = y.

Reminder 5. Let f : E → F be a mapping

1. f is injective ⇔ ∀x1 , x2 ∈ E, f (x1 ) = f (x2 ) ⇒ x1 = x2 .

or
f is injective ⇔ ∀x1 , x2 ∈ E, x1 =
6 x2 ⇒ f (x1 ) 6= f (x2 ).
2. f is not injective ⇔ ∃x1 , x2 ∈ E, f (x1 ) = f (x2 ) and x1 6= x2 .
3. f is surjective ⇔ ∀y ∈ F, ∃x ∈ E : f (x) = y.
4. f is not surjective ⇔ ∃y ∈ F, ∀x ∈ E : f (x) 6= y.

2. Are these mappings injective ? surjective ?

Study of injectivity :
1. f is injective ⇔ ∀(x1 , y1 ) ∈ N × N and (x2 , y2 ) ∈ N × N,

f (x1 , y1 ) = f (x2 , y2 ) ⇒ (x1 , y1 ) = (x2 , y2 ).

But ∃(x1 , y1 ) = (0, 2) ∈ N × N, ∃(x2 , y2 ) = (0, 4) ∈ N × N such that

f (0, 2) = (0, 4) and (0, 2) 6= (0, 4).

Then f is not injective.

2. g is injective ⇔ ∀x1 , x2 ∈ N, g(x1 ) = g(x2 ) ⇒ x1 = x2 .
Let x1 , x2 ∈ N, we have :

g(x1 ) = g(x2 ) ⇒ x1 + 1 = x2 + 1 ⇒ x1 = x2 .
Then g is injective.
3. h is injective ⇔ ∀x1 , x2 ∈ N, h(x1 ) = h(x2 ) ⇒ x1 = x2 .
But ∃x1 = 0 ∈ N, ∃x2 = 1 ∈ N such that

h(0) = h(1) = 0 and x1 = 0 6= x2 = 1.

Then h is not injective.

6
 Dr. L.BOUCHAL

Study of surjectivity :
1. f is surjective ⇔ ∀z ∈ N, ∃(x, y) ∈ N × N : z = f (x, y).
Let z ∈ N, does there exist (x, y) ∈ N × N such that z = x2 + xy − x ?
If we take x = 1 and y = z then

f (x, y) = f (1, z) = 12 + (1)z − 1 = z.

Then f is surjective.
2. g is surjective ⇔ ∀y ∈ N, ∃x ∈ N : g(x) = y.
Let y ∈ N,
g(x) = y ⇒ x + 1 = y ⇒ x = y − 1.
/ N.
If we take y = 0 then x = 0 − 1 = −1 ∈
Then ∃y = 0 ∈ N such that it does not exist an x ∈ N such that y = f (x).
Then g is not surjective.
3. h is surjective ⇔ ∀y ∈ N, ∃x ∈ N : h(x) = y.
Let y ∈ N,

if y = 0 then ∃x = 0 ∈ N such that h(0) = 0.

6 0
if y = then h(x) = y ⇒ x − 1 = y ⇒ x = 1 + y ∈ N.
Then h is surjective.
3. Calculate (f ◦ h), (g ◦ h) and (h ◦ g) if they are defined.
• For (f ◦ h) : we have
h f
N→ − N, N × N → − N
(f ◦ h) is not defined because the codomain of h is different from the domain of f.

• For (g ◦ h) :
h g
N→− N→ − N
(g ◦ h) is well defined.
Then 
1, if x = 0
(g ◦ h)(x) = g(h(x)) = h(x) + 1 =
x, if x ≥ 1
• For (h ◦ g) :
g h
N→− N→ − N
(h ◦ g) is well defined.
Then 
0, if g(x) = 0
(h ◦ g)(x) = h(g(x)) =
g(x) − 1, if g(x) ≥ 1

/ N.
• g(x) = 0 ⇒ x + 1 = 0 ⇒ (x = −1) rejected because −1 ∈
• g(x) ≥ 1 ⇒ x + 1 ≥ 1 ⇒ x ≥ 0, then ∀x ∈ N, g(x) ≥ 1.

7
 Dr. L.BOUCHAL

Then
(h ◦ g)(x) = h(g(x)) = g(x) − 1 = x + 1 − 1 = x.

Solution of exercise 5. Let

f : R \ {−1} → R
2x+3
x 7−→ f (x) = 1+x

1. Is f injective ?
f is injective ⇔ ∀x1 , x2 ∈ R \ {−1}, f (x1 ) = f (x2 ) ⇒ x1 = x2 .
Let x1 , x2 ∈ R \ {−1}

f (x1 ) = f (x2 ) ⇔ 2x 1 +3
1+x1
= 2x 2 +3
1+x2
⇒ (2x1 + 3)(1 + x2 ) = (2x2 + 3)(1 + x1 )
⇒ 2x1 + 2x1 x2 + 3 + 3x2 = 2x2 + 2x1 x2 + 3 + 3x1
⇒ x1 = x2 .

Then f is injective.
2. Determine, according to the values of α ∈ R, the set f −1 ({α}), and deduce whether f is
surjective.
f −1 ({α}) = {x ∈ R \ {−1} : f (x) ∈ {α}}
f (x) ∈ {α} ⇒ f (x) = α
2x+3
⇒ 1+x
=α
⇒ 2x + 3 = αx + α
⇒ (2 − α)x = α − 3
α−3
⇒ x = 2−α with α 6= 2.
Deduce whether f is surjective.

If α = 2 : @x ∈ R \ {−1} such that f (x) = 2. Then f is not surjective for α = 2.

If α 6= 2 : x = α−3
2−α
∈ R \ {−1} ?
/ R \ {−1}, i.e.
By reasoning by contradiction, we suppose that x ∈
α−3
x = −1 ⇔ = −1 ⇒ α − 3 = α − 2 ⇒ −3 = −2 (contradiction),
2−α
α−3
then x = 2−α
∈ R \ {−1}.

Conclusion : 
For α = 2, f −1 ({α}) = ∅
α−3
6 2, f −1 ({α}) = {x =
For α = 2−α
∈ R \ {−1}}
The mapping f is surjective for α ∈ R \ {2}.
3. Calculate f (] − 1, +∞[) and f (] − ∞, −1[).

8
 Dr. L.BOUCHAL

f (] − 1, +∞[) = {y ∈ R, ∃x ∈] − 1, +∞[: f (x) = y}

f (] − ∞, −1[) = {y ∈ R, ∃x ∈] − ∞, −1[: f (x) = y}
The variation table of f :
1
f 0 (x) = − < 0, ∀x ∈ R \ {−1}.
(1 + x)2

x −∞ −1 +∞

f 0 (x) − −

2 +∞
f (x)
−∞ 2

From the variation table of f we obtain :

f (] − 1, +∞[) =] − ∞, 2[ and f (] − ∞, −1[) =]2, +∞[.
4. Show that the following restriction g is bijective, and give the expression of g −1 .
g :] − 1, +∞[ →]2, +∞[
x 7−→ g(x) = f (x).

Reminder 6. g is bijective ⇔ g is injective and surjective.

g injective :
g is injective ⇔ ∀x1 , x2 ∈] − 1, +∞[, g(x1 ) = g(x2 ) ⇒ x1 = x2 .
From the first question since f is injective on R \ {−1} then the restriction g is injective on the
interval ] − 1, +∞[.
g surjective :
g is surjective ⇔ ∀y ∈]2, +∞[, ∃x ∈] − 1, +∞[: g(x) = y.
We have :
g(] − 1, +∞[) = f (] − 1, +∞[) =]2, +∞[,
then g is surjective.
Conclusion : Since g is injective and surjective then g is bijective.
The expression of g −1 :
We have that the mapping g is bijective then its inverse mapping g −1 exists. To determine the
expression of g −1 we write x in function of y.
We have :
g(x) = y ⇔ 2x+3
x+1
= y ⇔ 2x + 3 = y(x + 1)
⇒ 2x + 3 = xy + y
⇒ 2x − xy = y − 3
⇒ x(2 − y) = y − 3
y−3
⇒ x = 2−y .
Then
g −1 :]2, +∞[ −→] − 1, +∞[
y 7−→ g −1 (y) = y−3
2−y

9
 Dr. L.BOUCHAL

5. Let
h : R → R
2x if x > − 21
x 7−→
x2 if x ≤ − 12
Are the mappings f ◦ h and h ◦ f defined ? calculate them if they are defined.
We have :
h f
R→− R, R \ {−1} → − R
(f ◦ h) is not defined because the codomain of h is different from the domain of f.

We have
f h
R \ {−1} → − R→ − R
(h ◦ f ) is well defined.
The calculation of (h ◦ f ) :

f (x) > − 21

 2f (x)
(h ◦ f )(x) = h(f (x)) =
(f (x))2 f (x) ≤ − 21


4x+6
f (x) > − 21

 x+1
=
( 2x+3 )2 f (x) ≤ − 21

x+1

x −∞ − 75 −1 +∞

5x + 7 − 0 + +

2(x + 1) − − 0 +

5x+7
2(x+1) + 0 − +

We have
f (x) > − 12 ⇒ f (x) + 1
2
>0

2x+3 1
⇒ x+1
+ 2
>0

4x+6+x+1
⇒ 2x+2
>0

5x+7
⇒ 2(x+1)
>0
Then
f (x) > − 12 for x ∈] − ∞, − 57 [∪] − 1, +∞[

f (x) ≤ − 12 for x ∈ [− 57 , −1[

10
 Dr. L.BOUCHAL

Conclusion (h ◦ f ) is defined by :
4x+6
for x ∈] − ∞, − 75 [∪] − 1, +∞[

 x+1
(h ◦ f )(x) = h(f (x)) =
( 2x+3 )2 for x ∈ [− 57 , −1[.

x+1

Reminder 7.
1. y ∈ f (A) ⇔ ∃x ∈ A : y = f (x).
2. x ∈ f −1 (B) ⇔ f (x) ∈ B.

Solution of exercise 6. (Supplementary exercise)

Let f : E → F be a mapping. Show that :
1. f injective ⇔ ∀A ∈ P(E), A = f −1 (f (A)).
(a) f injective ⇒ ∀A ∈ P(E), A = f −1 (f (A)).
Suppose that f injective and we show that ∀A ∈ P(E), A = f −1 (f (A)), (we have
to show the double inclusion A ⊂ f −1 (f (A)) and f −1 (f (A)) ⊂ A).

i. A ⊂ f −1 (f (A)) : Let x ∈ A ⇒ f (x) ∈ f (A) ⇒ x ∈ f −1 (f (A)),

then A ⊂ f −1 (f (A)).
ii. f −1 (f (A)) ⊂ A :

Let x ∈ f −1 (f (A)) ⇒ f (x) ∈ f (A)

⇒ ∃x0 ∈ A such that f (x) = f (x0 )
⇒ x = x0 ( because f is injective )
⇒ x∈A

then f −1 (f (A)) ⊂ A.
Then, we have if f injective then ∀A ∈ P(E), A = f −1 (f (A)).
(b) ∀A ∈ P(E), A = f −1 (f (A)) ⇒ f injective.
Let x1 , x2 ∈ E such that f (x1 ) = f (x2 ). We want to show that x1 = x2 .
We apply A = f −1 (f (A)) for A = {x1 } and for A = {x2 }.
We have
f −1 (f ({x1 })) = {x1 } = and f −1 (f ({x2 })) = {x2 },
but,
f ({x1 }) = f ({x2 }) ⇒ f −1 (f ({x1 })) = f −1 (f ({x2 }))
⇒ {x1 } = {x2 } ( because A = f −1 (f (A)))
⇒ x1 = x2
Then f is injective.
Conclusion : From (a) and (b) we obtain :

f injective ⇔ ∀A ∈ P(E), A = f −1 (f (A)).

2. f surjective ⇔ ∀A ∈ P(E), CF f (A) ⊂ f (CE A).

11
 Dr. L.BOUCHAL

(a) f surjective ⇒ ∀A ∈ P(E), CF f (A) ⊂ f (CE A).

Suppose that f surjective and we show that ∀A ∈ P(E), CF f (A) ⊂ f (CE A).
Let y ∈ CF f (A) ⇒ y ∈
/ f (A),
we have then y ∈ F and f is surjective ⇒ ∃x ∈ E : y = f (x).

y = f (x) ∈ CF f (A) ⇒ y = f (x) ∈

/ f (A)
⇒ x∈/ A, y = f (x)
⇒ x ∈ CE A, y = f (x)
⇒ y ∈ f (CE A)

then CF f (A) ⊂ f (CE A).

(b) ∀A ∈ P(E), CF f (A) ⊂ f (CE A) ⇒ f is surjective.
Suppose that ∀A ∈ P(E), CF f (A) ⊂ f (CE A) and we show that f is surjective.
For A = E we have
CF f (E) ⊂ f (CE E)
we have
CE E = ∅ ⇒ f (CE E) = ∅
CF f (E) = ∅ ⇒ CF (CF f (E)) = CF ∅ ⇒ f (E) = F.
∀y ∈ F, y ∈ f (E), ∃x ∈ E : y = f (x) then f is surjective.
Conclusion : From (a) and (b) we obtain :

f surjective ⇔ ∀A ∈ P(E), CF f (A) ⊂ f (CE A).

12