The following diagram shows that 185 \(\not \Rightarrow\) 250 is a code 6 non-implication, and the theory of transferability then shows that it is actually a code 4. It follows that the non-implication 199(\(n\)) \( \not \Rightarrow \) 250 is not just a code 6 non-implication, but is also a code 4 non-implication.
| 250 | This form is negation transferable | |||
| \(\Downarrow\) | ||||
| 47-n | ||||
| \(\Downarrow\) | ||||
| 288-n | ||||
| \(\Downarrow\) | ||||
| 67 | \( \not \Rightarrow \) | 373-n | ||
| \( \Downarrow \) | ||||
| 89 | ||||
| \( \Downarrow \) | ||||
| 90 | ||||
| \( \Downarrow \) | ||||
| 51 | ||||
| \( \Downarrow \) | ||||
| 77 | ||||
| \( \Downarrow \) | ||||
| This form is transferable | 185 | |||
| \( \Downarrow \) | ||||
| 13 | ||||
| \( \Downarrow \) | ||||
| 199(\(n\)) |