Theorem 1:- Idempotent Law

A)X+X=X

L.H.S.

X+X

=(X+X).1 identity property

̂
=(X+X).(𝑋 + 𝑋) inverse property A+B.C=(A+B).(A+C) ; A=X, B=X, C=𝑋̂

=X+X.𝑋̂ distributive law

=X+0 inverse law

=X

B) X.X=X

L.H.S.

X.X=

=X.X+0 identity property

=X.X+X. 𝑋̂ inverse law

=X.(X+𝑋̂ )

=X.1

=X

Theorem-3

X+X.Y=X Absorption law

LHS

X+X.Y

=X.( 1+Y)

=X.1 Theorem-2

=X= RHS
X.(X+Y)=X

X.(X+Y)=X

Proof-

LHS

X.(X+Y)

=X.X+X.Y

=X+X.Y INDEPOTENT THEOM

=X(1+Y)

=X.1 THEOM-2

=X=RHS

Theorem 4- involution law

𝑋̿ =X

LHS

𝑋̿= 𝑋̿+0 IDENTITY

=𝑋̿+X.𝑋̅ INVERSE A+B.C=(A+B).(A+C)

=(𝑋̿+X).( 𝑋̿+𝑋̅) DISTRIBUTIVE

=(X+𝑋̿).(𝑋̅+𝑋̿) COMMUTATIVE

=(X+𝑋̿).1 INVERSE LAW 𝑋̅=A, 𝑋̿ =𝐴̅ --→ A+𝐴̅=1

=(X+𝑋̿).(X+𝑋̅) INVERSE LAW

=X+𝑋̿.𝑋̅

=X+𝑋̅. 𝑋̿ 𝑋̅ =A

=X+A.𝐴̅ inverse law

=X+0

=X
Theorem-5

X+𝑋̅.Y=X+Y

LHS

X+𝑋̅.Y

=(X+𝑋̅).(X+Y) DISTRIBUTIVE

=1.(X+Y)

=X+Y=RHS

X.( 𝑋̅+Y)=X.Y

b) X.(𝑋̅+Y)=X.Y

Proof-

LHS

X.( 𝑋̅+Y)

=X. 𝑋̅+ X.Y

=0+X.Y INVERSE LAW

=X.Y=RHS

DEMORGAN’S LAW

̅̅̅̅̅̅̅̅
𝑋 + 𝑌=𝑋̅. 𝑌̅

̅̅̅̅̅
𝑋. 𝑌=𝑋̅+𝑌̅

A+𝐴̅ =1 INVERSE LAW

(X+Y)+ 𝑋̅. 𝑌̅=1

LHS

(X+Y)+ 𝑋̅. 𝑌̅ A+BC=(A+B).(A+C)

=(X+Y+𝑋̅).(X+Y+𝑌̅ ) DISTRIBUTIVE LAW

=(Y+1).(X+1) INVERSE LAW

=1.1 THEOREM2

=1

b) ̅̅̅̅̅
𝑋. 𝑌=𝑋̅+𝑌̅

PROOF

(X.Y).( 𝑋̅+𝑌̅ )=0

LHS

(X.Y).( 𝑋̅+𝑌̅ )

X.Y. 𝑋̅+X.Y. 𝑌̅

=Y.X. 𝑋̅+ X.Y. 𝑌̅ COMMUTATIVE LAW

=Y.0+X.0 INVERSE LAW

=0+0=0

Q) find out the Boolean expression for following truth tables

A)

X Y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0
F=𝑋̅. 𝑌̅.Z+𝑋̅.Y.Z+X.Y. 𝑍̅

F=1→ X=0,Y=0,Z=1

F=1-→ X=0,Y=1,Z=1

F=1→ X=1,Y=1,Z=0
B)

A B C D F
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

F=𝐴̅. 𝐵̅. 𝐶̅.D+𝐴̅. 𝐵̅.C.D+𝐴̅.B.C. 𝐷

̅+A. 𝐵̅. 𝐶̅.D+A.B.C. 𝐷
̅+A.B.C.D

MINIMIZATION

X.(𝑋̅+Y)

=X. 𝑋̅+X.Y

=0+X.Y

=X.Y

C) 𝑋̅. 𝑌̅.Z+𝑋̅.Y.Z+X. 𝑌̅

=𝑋̅.Z(𝑌̅ +Y)+X. 𝑌̅

=𝑋̅.Z+X. 𝑌̅ INVERSE LAW

MINIMIZATION

4)A𝐵̅+AB𝐶̅+A𝐵̅𝐶̅D

= A𝐵̅+ A𝐵̅𝐶̅D+ AB𝐶̅

= A𝐵̅(1+𝐶̅D)+ AB𝐶̅

= A𝐵̅.1+ AB𝐶̅ THEOREM-2

=A(𝐵̅+ B𝐶̅ )

=A(𝐵̅ +B)( 𝐵̅ +𝐶̅ ) DISTRIBUTIVE LAW

=A.1. ( 𝐵̅ +𝐶̅ )

=A. ( 𝐵̅ +𝐶̅ )

5) AB𝐶̅ 𝐷
̅ +AB𝐶̅ D+A𝐵̅𝐶̅ D+ABCD+ A𝐵̅CD+ABC𝐷 ̅ , literals=A,B,C,D, 𝐶̅, 𝐷
̅ +A𝐵̅C𝐷 ̅, 𝐵̅

= AB𝐶̅ 𝐷
̅ +AB𝐶̅ D+ A𝐵̅𝐶̅ D+ A𝐵̅CD+ ABCD+ ABC𝐷
̅ + A𝐵̅C𝐷
̅

= AB𝐶̅(𝐷
̅ +D)+ A𝐵̅D(𝐶̅+C)+ABC(D+𝐷
̅ )+ A𝐵̅C𝐷
̅

= AB𝐶̅+ A𝐵̅D+ABC+ A𝐵̅C𝐷

̅ inverse law

= AB𝐶̅+ ABC+ A𝐵̅D+ A𝐵̅C𝐷

̅

=AB(𝐶̅+C)+ A𝐵̅(D+ C𝐷
̅)

=AB+ A𝐵̅(D+C)(D+𝐷
̅) inverse law, distributive law

=AB+ A𝐵̅D+ A𝐵̅C inverse law

=A(B+𝐵̅D)+ A𝐵̅C

=A(B+𝐵̅)(B+D)+ A𝐵̅C distributive law

=AB+AD+ A𝐵̅C inverse law

=A(B+𝐵̅C)+AD

=A(B+𝐵̅)(B+C)+AD distributive law

=AB+AC+AD inverse law