The teacher is always wrong, flip his answer Your dumb teacher is always wrong, so flip his answer.

Change these responses

True -&gt; False
Yes -&gt; No 
0 -&gt; 1
Yeah -&gt; Nope


and vice versa. Keeping punctuation and the first letter's capitalization counts. Only one condition will be passed to the program. 

You only need to accept the following test cases:

True &lt;-&gt; False
True. &lt;-&gt; False.
true &lt;-&gt; false
true. &lt;-&gt; false.
Yes &lt;-&gt; No
Yes. &lt;-&gt; No.
yes &lt;-&gt; no
yes. &lt;-&gt; no.
0 &lt;-&gt; 1  
Yeah &lt;-&gt; Nope
yeah &lt;-&gt; nope
Yeah. &lt;-&gt; Nope.
yeah. &lt;-&gt; nope.


This is code-golf, so the shortest answer in bytes wins.
05AB1E, 45 41 40 39 38 bytes

Code:

“‰¦žä¥æ€¸pe…Ü€¸“ð¡2ôDí«D€™«vy`:D_D¹Êiq


Explanation:

It first starts with the compression:

“‰¦žä¥æ€¸pe…Ü€¸“


This is a compressed version of "true false yeah nope yes no". After that, we split on the spaces with ð¡, resulting into:

['true', 'false', 'yeah', 'nope', 'yes', 'no']


We slice this array into pieces of 2 with 2ô, resulting into:

[['true', 'false'], ['yeah', 'nope'], ['yes', 'no']]


We duplicate this array and reverse each element of it with Dí. Then we append this to our first array with «, resulting into:

[['true', 'false'], ['yeah', 'nope'], ['yes', 'no'], ['false', 'true'], ['nope', 'yeah'], ['no', 'yes']]


To get the titlecased words, we duplicate the array again and convert each word to titlecase with €™. Finally, this is appended to the initial array. So, the final list is:

[['true', 'false'],
 ['yeah', 'nope'],
 ['yes', 'no'],
 ['false', 'true'],
 ['nope', 'yeah'],
 ['no', 'yes'],
 ['True', 'False'],
 ['Yeah', 'Nope'],
 ['Yes', 'No'],
 ['False', 'True'],
 ['Nope', 'Yeah'],
 ['No', 'Yes']]


The imporant part here is that Nope comes before No. Eventually, we get to this part of the code:

vy`:D_D¹Êiq


Explanation:

v            # For each in the array...
 y`          #   Push the array (containing 2 words) and flatten.
   :         #   Replace the first word with the second.
    D_       #   Duplicate and negate (resulting 0 into 1 and 1 into 0).
                 If this is not possible, this results into nothing.
      D      #   Duplicate the top of the stack again.
       ¹Ê    #   If it's not equal to the inital input string...
         iq  #     Quit the program and implicitly print the processed string.


Uses the CP-1252 encoding. Try it online!.