Please answer clearly and shortly thank you

Given the recursive definition of Well-Formed Formulas (WFF): Rule 1: Any single Latin letter is a WFF . Rule 2: if p is a WFF, then so are (p) and -p Rule 3: if p and q are WFFs, then so is p-q . Rule 4: if p and q are WFFs, then so is p Aq Rule 5: if p and q are WFFs, then so is p V q Prove that ((pAg)>(rAs))r(owVq)) is a WFF