$A ∩ B = A ∩ (B' ∩ A)'$ if $A,B ⊆ U$ (universal set)
so to prove it I need to show that both sides are a subset of each other. I did the right side in the following steps:
De Morrigan: $A ∩ (B' ∩ A)' = A ∩ (B'' ∪ A') $
Universal set laws: $A ∩ (B'' ∪ A') = A ∩ (B ∪ A')$
I could have used distribution law but based on how they are not allowing us to use them so they can make each homework harder I went with:
Intersection def: $∀x∈ A ∩ (B ∪ A'), x∈A \,\text{&}\, x∈(B ∪ A')$
$... x∈A \,\text{&}\, x∈B \,\text{or}\, x∈A'$
Universal set laws: $x∈A\,\text{ &}\, x∈B \,\text{or}\, x∉A$
if $x∉A$ it a contradiction with $x∈A$ which means that $x∈B$ is the correct one.
thusly we arrive at $x∈A$ & $x∈B \implies x∈A ∩ B \implies A ∩ (B' ∩ A)' ⊆ A ∩ B$.
now for the other side, I tried everything, and the best thing I came out with is:
$A ∩ B \implies A ∩ B ∪ ∅ \implies$
$A ∩ B ∪ ( A ∩ A') \implies A ∩ [B ∪ ( A ∩ A')] \implies$
$A ∩ [(B ∪ A) ∩ ( B ∪ A')] \implies A ∩ [(B ∪ A) ∩ ( B ∪ A')]'' \implies$
$[(B ∪ A)' ∪ ( B ∪ A')']' \implies A ∩ [(B' ∩ A') ∪ ( B' ∩ A)]'$ and from here I spiraled in many ways etc.
SIDENOTE: thank you for your advice regarding deleting the original post and giving more context, it was my first time using the site and I posted it out of desperation at like 5 pm my time.