For the following proof (of equivalence of 2 formulae) provide the justifications at each step, using the following equivalences. Use the following key:
a
Idempotent Law
b
Double Negation
c
De Morgan's Law
d
Commutative Properties
e
Associative Properties
f
Distributive Properties
g
Equivalence of Contrapositive
h
Definition of Implication
i
Definition of Equivalence
j
Identity Laws \( (p \vee F \equiv p \wedge T \equiv p) \)
k
Tautology \( (p \vee \neg p \equiv T) \)
l
Contradiction \( (p \wedge \neg p \equiv F) \)
by
by
by
by
by
by
You can earn partial credit on this problem.