We say a set of formulas I' is `consistent" iff there is no formula A such thatTF A and I E¬A. Use the soundness and the completeness of propositional logic to show that I' is satisfiable if and only...

Please show all the steps in detail, mention any methods used and be atleast 99% sure of your answer. Take your few 2-3 hours time. Thank you. :)

Extracted text: We say a set of formulas I' is `consistent" iff there is no formula A such thatTF A and I E¬A. Use the soundness and the completeness of propositional logic to show that I' is satisfiable if and only if it is consistent.