I found this explanation ... can someone confirm this is correct?

CNF = Conjunctive Normal Form

wff = Well Formed Formula

The following is the procedure to transform any wff into a logically equivalent wff that is in CNF.

Step 1. Eliminate ⇔’s (using the Law of Equivalence)

Step 2. Eliminate ⇒’s (using the Law of Implication)

Step 3. Move ¬’s inwards (using De Morgan’s Laws), eliminating any double negations (using the Law of Negation).

Step 4. Use the Distribute Law (∨ over ∧) to move the ∧’s up and the ∨’s down; use commutativity and associativity of ∧ and ∨ to reorder subformulas so that this law may be used.