Thanks so much Stephan 😃 That really makes sense!
I actually saw something like "Symmetry == Permutations(X) \union Permutations(Y)" somewhere but then I was thinking mistakenly that if we haveÂ
X { 1,2,3} and Y = { "a","b"} then I was thinking TLC will treat the entire Union as a symmetry set and that might break the spec as it might think it is OK to replace 1 with "a"
But now I think that won't be a problem as long as the spec prevents such substitution. For example if we have a counter withÂ
Init == x = 1
Next == x' = x +1
Then x can never be "a" anyway so using such a union for symmetry shouldn't break the rest of the spec
Thank you so much for your the guidance