Informal Proof of Set Completeness

Method

Show $\neg F\equiv (F\to 0F)\wedge F_1\vee F_2\equiv ((F_1\to 0F_1)\to F_2)$

Intuition

An informal proof of $C$ involves showing how each connective in $\{\neg ,\vee \}$ can be expressed as combinations of elements of $C$