Simplification

This technique is used with two alternatives that differ by a single Boolean.

Let x and y be two booleans .

Let A be an alternative containing booleans (a,b,c…) and a boolean x .

Let A’ be an alternative containing the booleans (a,b,c,…) identical to those of A, and the boolean y.

In this case, x=y : we can replace one with the other.

Here a1=f1 .

So, the boolean f1 of the Oscar  row can be swapped with the boolean a1 … Or the boolean a1 of the Aya row can be swapped with the boolean f1.