theorem ssasymd (A B: set) (G: wff): $ G -> A C_ B $ > $ G -> B C_ A $ > $ G -> A == B $;
A C_ B -> B C_ A -> A == B
G -> A C_ B
G -> B C_ A
G -> A == B