# De Morgan Theorem and Demorgans Laws

We have known the basic operation of binary arithmetic such as binary addition, binary subtraction, binary multiplication and binary division. Now we will look through the most important part of binary arithmetic on which a lot of Boolean algebra stands, that is

Now look at the table very carefully in each row. Firstly the value of A = 0 and the value of B = 0. Now for this values A’ = 1, B’ = 1. Again A+B = 0 and A.B = 0. Thus (A+B)’ = 1 and (A.B)’ = 1, A’ + B’ = 1 and A’.B’ = 1. From this table you can therefore see that the value of column no 7 and 8 are equal and column no 9 and 10 are also equal which proves the De-Morgan's theorem.
Again different values of A and B we see the same thing i.e. column no 7 and 8 are equal to each other and 9 and 10 are equal to each other. Thus by this truth table we can prove De-Morgan's theorem.
Some examples given below can make your idea clear.
Therefore,
With the help of De-Morgan's theorem our calculation become much easier.

Closely Related Articles
Digital ElectronicsBoolean Algebra Theorems and Laws of Boolean AlgebraTruth Tables for Digital LogicBinary Arithmetic Binary AdditionBinary SubtractionSimplifying Boolean Expression using K MapBinary DivisionExcess 3 Code Addition and SubtractionK Map or Karnaugh MapSwitching Algebra or Boolean AlgebraBinary MultiplicationParallel SubtractorMore Related Articles
Binary Adder Half and Full AdderBinary SubstractorSeven Segment DisplayBinary to Gray Code Converter and Grey to Binary Code ConverterBinary to BCD Code ConverterAnalog to Digital ConverterDigital Encoder or Binary EncoderBinary DecoderBasic Digital CounterDigital ComparatorBCD to Seven Segment DecoderParallel AdderParallel Adder or SubtractorMultiplexerDemultiplexer555 Timer and 555 Timer WorkingLook Ahead Carry AdderOR Operation | Logical OR OperationAND Operation | Logical AND OperationLogical OR GateLogical AND GateNOT GateUniversal Gate | NAND and NOR Gate as Universal GateNAND GateDiode and Transistor NAND Gate or DTL NAND Gate and NAND Gate ICsX OR Gate and X NOR GateTransistor Transistor Logic or TTLNOR GateFan out of Logic GatesINHIBIT GateNMOS Logic and PMOS LogicSchmitt GatesLogic Families Significance and Types of Logic FamiliesBinary Number System | Binary to Decimal and Decimal to Binary ConversionBinary to Decimal and Decimal to Binary ConversionBCD or Binary Coded Decimal | BCD Conversion Addition SubtractionBinary to Octal and Octal to Binary ConversionOctal to Decimal and Decimal to Octal ConversionBinary to Hexadecimal and Hex to Binary ConversionHexadecimal to Decimal and Decimal to Hexadecimal ConversionGray Code | Binary to Gray Code and that to Binary ConversionOctal Number SystemDigital Logic Gates2′s Complement1′s ComplementASCII CodeHamming Code2s Complement ArithmeticError Detection and Correction Codes9s complement and 10s complement | SubtractionSome Common Applications of Logic GatesKeyboard EncoderAlphanumeric codes | ASCII code | EBCDIC code | UNICODELatches and Flip FlopsS R Flip Flop S R LatchActive Low S R Latch and Flip FlopGated S R Latches or Clocked S R Flip FlopsD Flip Flop or D LatchJ K Flip FlopMaster Slave Flip FlopRead Only Memory | ROMProgrammable Logic DevicesProgrammable Array LogicApplication of Flip FlopsShift RegistersBuffer Register and Controlled Buffer RegisterData Transfer in Shift RegistersSerial In Serial Out (SISO) Shift RegisterSerial in Parallel Out (SIPO) Shift RegisterParallel in Serial Out (PISO) Shift RegisterParallel in Parallel Out (PIPO) Shift RegisterUniversal Shift RegistersBidirectional Shift RegisterDynamic Shift RegisterApplications of Shift RegistersUninterruptible Power Supply | UPSConversion of Flip FlopsNew Articles
Resistance Variation with TemperatureLook Ahead Carry AdderGround Clearance of Different Transmission LinesWater Meter**De-Morgan's Theorem**which is called**De-Morgan's Laws**often. Before discussing**De-Morgan's theorems**we should know about complements. Complements are the reverse value of the existing value. We are trying to say that as there are only two digits in binary number system 0 and 1. Now if A = 0 then complement of A will be 1 or A’ = 1 There are actually two theorems that were put forward by De-Morgan. On the basis ofDE Morgan’s laws much Boolean algebra are solved. Solving these types of algebra with De-Morgan's theorem has a major application in the field of digital electronics. De Morgan’s theorem can be stated as follows:-Theorem 1:
The compliment of the product of two variables is equal to the sum of the compliment of each variable.
Thus according to **De-Morgan's laws** or De-Morgan's theorem if A and B are the two variables or Boolean numbers. Then accordingly
Theorem 2:
The compliment of the sum of two variables is equal to the product of the compliment of each variable.
Thus according to De Morgan’s theorem if A and B are the two variables then.
De-Morgan's laws can also be implemented in Boolean algebra in the following steps:-

- While doing Boolean algebra at first replace the given operator. That is if (+) is there then replace it with (.) and if (.) is there then replace it with (+).
- Next compliment of each of the term is to be found.

1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |

A | B | A’ | B | A+B | A.B | (A+B)’ | A’.B’ | (A.B)’ | A’+B’ |

0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |

0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |

1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |

1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 |

Let other example be, In both the equations we have suitably used De-Morgan's laws to make our calculation much easier.