Well yes! Two things: You have a successful algorithm that runs in P time that solves an NP Hard problem and 2) you can map other NP Hard problems to your problem. Without the second factor, it is only a demonstration of a "range" in the computational realm in question, where p = np or whatever the declaration. Being able to show that your pizza slice is actually an ocean of pizza, and also show that any other shape of pizza slice can be appropriately transformed into the shape you have means p = np. a "solution." Or perhaps better put, it is a funnel through which complex computational patterns can either be reduced or simplified or elegantly correlated, approaching absolutely perfect parallelization of operations. This is just one way to look at it, but essentially intractability is an interesting term to consider.

Please forgive me if my liberal use of the language is an offense