I was having some difficulties when trying to use Armstrong axiom to solve functional dependencies.
R (A,B,C,D,E,F)
Given FD = { A->CD , C->BE, B->F, F->A }
Prove A-> BF
By using closure, for A, I get {A,C,D,B,E,F} so I know A->BF is valid.
So I came out with these to prove using Axiom:
A->CD
CD->BED (Augmentation)
A->BED (Transitivity)
BED->FED (Augmentation)
A->FED (Transitivity)
Then from there, I am lost. Anybody knows how to prove it?
Thanks in advance.
Best Answer
Here is a possible derivation: