Metamath Proof Explorer


Theorem symgcom2

Description: Two permutations X and Y commute if their orbits are disjoint. (Contributed by Thierry Arnoux, 17-Nov-2023)

Ref Expression
Hypotheses symgcom.g ⊢ G = SymGrp ⁡ A
symgcom.b ⊢ B = Base G
symgcom.x ⊢ φ → X ∈ B
symgcom.y ⊢ φ → Y ∈ B
symgcom2.1 ⊢ φ → dom ⁡ X ∖ I ∩ dom ⁡ Y ∖ I = ∅
Assertion symgcom2 ⊢ φ → X ∘ Y = Y ∘ X

Proof

Step Hyp Ref Expression
1 symgcom.g ⊢ G = SymGrp ⁡ A
2 symgcom.b ⊢ B = Base G
3 symgcom.x ⊢ φ → X ∈ B
4 symgcom.y ⊢ φ → Y ∈ B
5 symgcom2.1 ⊢ φ → dom ⁡ X ∖ I ∩ dom ⁡ Y ∖ I = ∅
6 1 2 symgbasf ⊢ X ∈ B → X : A ⟶ A
7 3 6 syl ⊢ φ → X : A ⟶ A
8 7 ffnd ⊢ φ → X Fn A
9 fnresi ⊢ I ↾ A Fn A
10 9 a1i ⊢ φ → I ↾ A Fn A
11 difssd ⊢ φ → A ∖ dom ⁡ X ∖ I ⊆ A
12 ssidd ⊢ φ → A ∖ dom ⁡ X ∖ I ⊆ A ∖ dom ⁡ X ∖ I
13 nfpconfp ⊢ X Fn A → A ∖ dom ⁡ X ∖ I = dom ⁡ X ∩ I
14 8 13 syl ⊢ φ → A ∖ dom ⁡ X ∖ I = dom ⁡ X ∩ I
15 inres ⊢ X ∩ I ↾ A = X ∩ I ↾ A
16 reli ⊢ Rel ⁡ I
17 relin2 ⊢ Rel ⁡ I → Rel ⁡ X ∩ I
18 16 17 ax-mp ⊢ Rel ⁡ X ∩ I
19 14 11 eqsstrrd ⊢ φ → dom ⁡ X ∩ I ⊆ A
20 relssres ⊢ Rel ⁡ X ∩ I ∧ dom ⁡ X ∩ I ⊆ A → X ∩ I ↾ A = X ∩ I
21 18 19 20 sylancr ⊢ φ → X ∩ I ↾ A = X ∩ I
22 15 21 eqtrid ⊢ φ → X ∩ I ↾ A = X ∩ I
23 22 dmeqd ⊢ φ → dom ⁡ X ∩ I ↾ A = dom ⁡ X ∩ I
24 14 23 eqtr4d ⊢ φ → A ∖ dom ⁡ X ∖ I = dom ⁡ X ∩ I ↾ A
25 12 24 sseqtrd ⊢ φ → A ∖ dom ⁡ X ∖ I ⊆ dom ⁡ X ∩ I ↾ A
26 fnreseql ⊢ X Fn A ∧ I ↾ A Fn A ∧ A ∖ dom ⁡ X ∖ I ⊆ A → X ↾ A ∖ dom ⁡ X ∖ I = I ↾ A ↾ A ∖ dom ⁡ X ∖ I ↔ A ∖ dom ⁡ X ∖ I ⊆ dom ⁡ X ∩ I ↾ A
27 26 biimpar ⊢ X Fn A ∧ I ↾ A Fn A ∧ A ∖ dom ⁡ X ∖ I ⊆ A ∧ A ∖ dom ⁡ X ∖ I ⊆ dom ⁡ X ∩ I ↾ A → X ↾ A ∖ dom ⁡ X ∖ I = I ↾ A ↾ A ∖ dom ⁡ X ∖ I
28 8 10 11 25 27 syl31anc ⊢ φ → X ↾ A ∖ dom ⁡ X ∖ I = I ↾ A ↾ A ∖ dom ⁡ X ∖ I
29 11 resabs1d ⊢ φ → I ↾ A ↾ A ∖ dom ⁡ X ∖ I = I ↾ A ∖ dom ⁡ X ∖ I
30 28 29 eqtrd ⊢ φ → X ↾ A ∖ dom ⁡ X ∖ I = I ↾ A ∖ dom ⁡ X ∖ I
31 1 2 symgbasf ⊢ Y ∈ B → Y : A ⟶ A
32 4 31 syl ⊢ φ → Y : A ⟶ A
33 32 ffnd ⊢ φ → Y Fn A
34 difss ⊢ X ∖ I ⊆ X
35 dmss ⊢ X ∖ I ⊆ X → dom ⁡ X ∖ I ⊆ dom ⁡ X
36 34 35 ax-mp ⊢ dom ⁡ X ∖ I ⊆ dom ⁡ X
37 fdm ⊢ X : A ⟶ A → dom ⁡ X = A
38 3 6 37 3syl ⊢ φ → dom ⁡ X = A
39 36 38 sseqtrid ⊢ φ → dom ⁡ X ∖ I ⊆ A
40 reldisj ⊢ dom ⁡ X ∖ I ⊆ A → dom ⁡ X ∖ I ∩ dom ⁡ Y ∖ I = ∅ ↔ dom ⁡ X ∖ I ⊆ A ∖ dom ⁡ Y ∖ I
41 39 40 syl ⊢ φ → dom ⁡ X ∖ I ∩ dom ⁡ Y ∖ I = ∅ ↔ dom ⁡ X ∖ I ⊆ A ∖ dom ⁡ Y ∖ I
42 5 41 mpbid ⊢ φ → dom ⁡ X ∖ I ⊆ A ∖ dom ⁡ Y ∖ I
43 nfpconfp ⊢ Y Fn A → A ∖ dom ⁡ Y ∖ I = dom ⁡ Y ∩ I
44 33 43 syl ⊢ φ → A ∖ dom ⁡ Y ∖ I = dom ⁡ Y ∩ I
45 42 44 sseqtrd ⊢ φ → dom ⁡ X ∖ I ⊆ dom ⁡ Y ∩ I
46 inres ⊢ Y ∩ I ↾ A = Y ∩ I ↾ A
47 relin2 ⊢ Rel ⁡ I → Rel ⁡ Y ∩ I
48 16 47 ax-mp ⊢ Rel ⁡ Y ∩ I
49 difssd ⊢ φ → A ∖ dom ⁡ Y ∖ I ⊆ A
50 44 49 eqsstrrd ⊢ φ → dom ⁡ Y ∩ I ⊆ A
51 relssres ⊢ Rel ⁡ Y ∩ I ∧ dom ⁡ Y ∩ I ⊆ A → Y ∩ I ↾ A = Y ∩ I
52 48 50 51 sylancr ⊢ φ → Y ∩ I ↾ A = Y ∩ I
53 46 52 eqtrid ⊢ φ → Y ∩ I ↾ A = Y ∩ I
54 53 dmeqd ⊢ φ → dom ⁡ Y ∩ I ↾ A = dom ⁡ Y ∩ I
55 45 54 sseqtrrd ⊢ φ → dom ⁡ X ∖ I ⊆ dom ⁡ Y ∩ I ↾ A
56 fnreseql ⊢ Y Fn A ∧ I ↾ A Fn A ∧ dom ⁡ X ∖ I ⊆ A → Y ↾ dom ⁡ X ∖ I = I ↾ A ↾ dom ⁡ X ∖ I ↔ dom ⁡ X ∖ I ⊆ dom ⁡ Y ∩ I ↾ A
57 56 biimpar ⊢ Y Fn A ∧ I ↾ A Fn A ∧ dom ⁡ X ∖ I ⊆ A ∧ dom ⁡ X ∖ I ⊆ dom ⁡ Y ∩ I ↾ A → Y ↾ dom ⁡ X ∖ I = I ↾ A ↾ dom ⁡ X ∖ I
58 33 10 39 55 57 syl31anc ⊢ φ → Y ↾ dom ⁡ X ∖ I = I ↾ A ↾ dom ⁡ X ∖ I
59 39 resabs1d ⊢ φ → I ↾ A ↾ dom ⁡ X ∖ I = I ↾ dom ⁡ X ∖ I
60 58 59 eqtrd ⊢ φ → Y ↾ dom ⁡ X ∖ I = I ↾ dom ⁡ X ∖ I
61 difin2 ⊢ dom ⁡ X ∖ I ⊆ A → dom ⁡ X ∖ I ∖ dom ⁡ X ∖ I = A ∖ dom ⁡ X ∖ I ∩ dom ⁡ X ∖ I
62 39 61 syl ⊢ φ → dom ⁡ X ∖ I ∖ dom ⁡ X ∖ I = A ∖ dom ⁡ X ∖ I ∩ dom ⁡ X ∖ I
63 difid ⊢ dom ⁡ X ∖ I ∖ dom ⁡ X ∖ I = ∅
64 62 63 eqtr3di ⊢ φ → A ∖ dom ⁡ X ∖ I ∩ dom ⁡ X ∖ I = ∅
65 undif1 ⊢ A ∖ dom ⁡ X ∖ I ∪ dom ⁡ X ∖ I = A ∪ dom ⁡ X ∖ I
66 ssequn2 ⊢ dom ⁡ X ∖ I ⊆ A ↔ A ∪ dom ⁡ X ∖ I = A
67 39 66 sylib ⊢ φ → A ∪ dom ⁡ X ∖ I = A
68 65 67 eqtrid ⊢ φ → A ∖ dom ⁡ X ∖ I ∪ dom ⁡ X ∖ I = A
69 1 2 3 4 30 60 64 68 symgcom ⊢ φ → X ∘ Y = Y ∘ X