Induction step: If F1â,F2ââG, then ÂŹF1â,(F1ââ¨F2â)âG
Step 2
Now we prove that for all formula FâG, â formula FⲠs.t
Fâ˛uoc{0,â} and Fâ˛âĄF
Basis
Let F=x where x is a propositional variable
Then Fâ˛uoc{0,â} (Fâ uses no connectives at all)
And Fâ˛âĄF (Fâ˛=F)
As wanted
Induction Step
Suppose that are formulas F1â˛â and F2â˛â s.t
F1â˛â,F2â˛âuoc{0,â} and F1â˛ââĄF1â and F2â˛ââĄF2â (IH)
Then, there are two cases: