Not only impossible in python, but also seems conceptually useless (why would you have a set of frozen sets?).
If the need exists for a list of lists then it exists for a set of sets.
An example of this is finding all combinations possible non ordered groups of letters given a collection of letters: abadfjiik.
A typical algorithm will produce dupes. But if your accumulator is a set of frozen sets you can produce a result with no dupes.
I could maybe see something like this as an intermediary result of parsing some horrible, nested obscure message format (except the dict, that baffles me unless the key-value types are reversed?)