help for problem

Apl Programming

prove that if a circuit is hazard free n its tie sets then it is also
hazard fre in its cut sets                                            

L. Carrol -the author of "Alice in Wonderland" has written on syllogisms and 
logic- prior to Boolean algebra
A stable has several stalls.
The stable has no shit.
Conclusion: every stall has no shit.

Apologies for the crudities but "poop" is too inocuous.