A, B, C, and D are boolean variables, meaning that each takes the value
"true" or "false". More complex expressions have value "true" or "false"
depending on the values of these variables, so for example A'BD' is true if
A is false, B is true, and D is false, and C is either true or false.
To say that F = G, where F and G are complex expressions, means that, no
matter what values the boolean variables have, the value of F is the same
as the value of G (that is, F and G are either both true or both false).
So, for example, we have
AB + AC = A(B+C)
because if A is true and either B or C is true, then both sides are true,
and in any other case both sides are false---there's no way to assign
values to A, B, C such that the two side come out differently.
As previous posters have mentioned, you can always prove (or disprove!) an
equality by going through all possible assignments of "true" and "false" to
the variables. The goal seems to be to prove "by theorems", that is, using
operations previously proven true. As you say, we can either manipulate
one side of the equation until it has the form of the other side, or we
could manipulate both sides and get them into a common form.
In this case, the first thing to notice is that the right-hand side (RHS)
is a copy of the LHS with some extra stuff tacked onto the end. For this
reason it's simplest to manipulate just the RHS to get rid of the
surplussage! We can start with this basic theorem:
if Q is true whenever P is true, then Q = Q + P
We can prove this theorem by systematically considering all possibilities
for P and Q. Or look at it this way: If Q is true, then both sides of the
equation are true. And if Q is false, then P must be false (since, by
assumption, if P were true Q would be true) hence both sides are false.
Given this theorem we prove:
XY + X'Z = XY + X'Z + YZ
Proof: Let P be YZ and let Q be XY+X'Z. Suppose P is true, that is, Y and
Z are both true. But if Y and Z are both true, then XY+X'Z must be true.
(Reason: If X is true then, since Y is true, XY is true. And if X is
false then, since Z is true, X'Z is true. So in either case XY+X'Z is
true.) So we've shown that Q is true whenever P is true, hence by the
previous theorem Q = Q + P, which in this case is what we wanted to prove.
Now we can prove
A'D' + AC' = A'D' + AC' + C'D'
This is just the same as the previous theorem, putting A for X, D' for Y,
and C' for Z.
This last theorem implies
B(A'D' + AC') = B(A'D' + AC' + C'D')
which is the same as
A'BD' + ABC' = A'BD' + ABC' + BC'D'
Given this, we can take the RHS of the original and substitute A'BD' + ABC'
for A'BD' + ABC' + BC'D', which is to say, we can drop the term BC'D'.
With steps similar to the above we can prove these two theorems:
A'BD' + BCD = A'BD' + BCD + A'BC
BCD + ABC' = BCD + ABC' + ABD
which permit us to drop the final two terms of the RHS of the original,
completing the proof.
I think you are confusing during the application of minimization by using Boolean algebra formula
First you apply consensus theorem for terms 1,2,3 by taking D as a common factor. This helps in removing the term 2. So the minimized expression is A'C'D + BCD + ABC + ACD'
Now combining the last three terms similarly leads to elimination of the term ABC
So the minimized expression is A'C'D + BCD + ACD'.
Here you don't have any terms for which consensus theorem can be applied i.e., so you question describes there were no more 2 and 4 terms to eliminate the term 3.
So the minimized expression is A'C'D + BCD + ACD'
Best Answer
Hint:
The trick is notice that $A$ and $B$ implies $C$ and $C'$ and $D$ and $D'$ which is impossible, so we will use $C$ or $C'$ and $D$ or $D'$ to cancel that term, and the basic idea is use Identity law and Negation law: $$P=P(1)=P(Q+Q')$$
Answer:
\begin{align} &AB+BC'D'+AC+AD\\ =&AB(1)+BC'D'+AC+AD\tag*{Identity law}\\ =&AB(C+C')+BC'D'+AC+AD\tag*{Negation law}\\ =&ABC+ABC'+BC'D'+AC+AD\tag*{Distributive law}\\ =&BAC+AC+ABC'+BC'D'+AD\tag*{Reordering}\\ =&AC+ABC'+BC'D'+AD\tag*{Absorption law}\\ =&AC+ABC'(1)+BC'D'+AD\tag*{Identity law}\\ =&AC+ABC'(D+D')+BC'D'+AD\tag*{Negation law}\\ =&AC+ABC'D+ABC'D'+BC'D'+AD\tag*{Distributive law}\\ =&AC+BC'AD+AD+ABC'D'+BC'D'\tag*{Reordering}\\ =&AC+AD+BC'D'\tag*{Absorption law}\\ \end{align}
If you have Consensus law:
\begin{align} &AB+BC'D'+AC+AD\\ =&AB+BC'D'+A(C+D)\tag*{Distributive law}\\ =&AB+BC'D'+A(C'D')'\tag*{De Morgan's law}\\ =&BC'D'+A(C'D')'\tag*{Consensus law}\\ =&BC'D'+A(C+D)\tag*{De Morgan's law}\\ =&BC'D'+AC+AD\tag*{Distributive law}\\ \end{align}