Define boolean operations and, or, not for church booleans?

Church booleans:

• And:

  $\text{and}=\lambda b_1.\lambda b_2.b_1{b}_2\text{fls}$

• Or:

  $\text{or}=\lambda b_1.\lambda b_2.b_1\text{tru}{b}_2$

• Not:

  $\text{not}=\lambda b.b\text{fls}\text{tru}$