If it was rejected, then we have an insurmountable problem here, because everything about how you want closed protocols to work would be the same thing with a different syntax. If the type checker cannot handle automatic promotion from an associated type to an enum, I fail to see how any alternative spelling could enable essentially the same feature under the hood when written as a protocol existential.
The problem is with the subtype between generic associated types and an enum. In particular, consider:
enum Either<Left, Right> {
case left(Left)
case right(Right)
}
When we have Either<Int, Int> how should Int be promoted? Into the left case or the right case? Either choice would be arbitrary and neither would be right!
This problem simply does not exist for closed protocols.
Obviously this problem does not exist for non-generic enums with mutually exclusive associated types either. It does complicate the design of any feature that introduces promotion of associated types, however. It would be valuable to have this in some form eventually but it alone is not a substitute for closed protocols. We would also need a way to forward members from the enum to the associated types. Any such mechanism would likely be driven by protocols anyway so a related protocol would also need to be designed.
Closed protocols are a much simpler solution to some design problems. For example, a closed protocol may be a good choice for implementing a value-semantic type that has multiple library-defined representations (similar to a class cluster) that each implements a common interface. There are certainly other ways to implement a type like this and one may even be better, but closed protocols would be a great option to have available.