Proof of Theorem ablmuldiv
| Step | Hyp | Ref
| Expression |
| 1 | | abldiv.1 |
. . . . 5
⊢ X = ran G |
| 2 | 1 | ablcom 8111 |
. . . 4
⊢ ((G ∈ Abel ⋀ A ∈ X ⋀ B ∈ X) →
(AGB) = (BGA)) |
| 3 | 2 | 3adant3r3 848 |
. . 3
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
(AGB) = (BGA)) |
| 4 | 3 | opreq1d 3989 |
. 2
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
((AGB)DC) = ((BGA)DC)) |
| 5 | | abldiv.3 |
. . . . 5
⊢ D = ( /g ‘G) |
| 6 | 1, 5 | grpmuldivass 8096 |
. . . 4
⊢ ((G ∈ Grp ⋀ (B ∈ X ⋀ A ∈ X ⋀ C ∈ X)) →
((BGA)DC) = (BG(ADC))) |
| 7 | | ablgrp 8110 |
. . . 4
⊢ (G ∈ Abel →
G ∈
Grp) |
| 8 | 6, 7 | sylan 451 |
. . 3
⊢ ((G ∈ Abel ⋀ (B ∈ X ⋀ A ∈ X ⋀ C ∈ X)) →
((BGA)DC) = (BG(ADC))) |
| 9 | | 3ancoma 786 |
. . 3
⊢ ((A ∈ X ⋀ B ∈ X ⋀ C ∈ X) ↔ (B
∈ X ⋀ A ∈ X ⋀ C ∈ X)) |
| 10 | 8, 9 | sylan2b 455 |
. 2
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
((BGA)DC) = (BG(ADC))) |
| 11 | | 3simp2 793 |
. . . . 5
⊢ ((A ∈ X ⋀ B ∈ X ⋀ C ∈ X) → B
∈ X) |
| 12 | 11 | adantl 390 |
. . . 4
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
B ∈
X) |
| 13 | 1, 5 | grpdivcl 8094 |
. . . . . 6
⊢ ((G ∈ Grp ⋀ A ∈ X ⋀ C ∈ X) →
(ADC) ∈ X) |
| 14 | 13, 7 | syl3an1 863 |
. . . . 5
⊢ ((G ∈ Abel ⋀ A ∈ X ⋀ C ∈ X) →
(ADC) ∈ X) |
| 15 | 14 | 3adant3r2 847 |
. . . 4
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
(ADC) ∈ X) |
| 16 | 12, 15 | jca 288 |
. . 3
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
(B ∈
X ⋀
(ADC) ∈ X)) |
| 17 | 1 | ablcom 8111 |
. . . 4
⊢ ((G ∈ Abel ⋀ B ∈ X ⋀ (ADC) ∈ X) →
(BG(ADC)) =
((ADC)GB)) |
| 18 | 17 | 3expb 838 |
. . 3
⊢ ((G ∈ Abel ⋀ (B ∈ X ⋀ (ADC) ∈ X)) →
(BG(ADC)) =
((ADC)GB)) |
| 19 | 16, 18 | syldan 470 |
. 2
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
(BG(ADC)) =
((ADC)GB)) |
| 20 | 4, 10, 19 | 3eqtrd 1518 |
1
⊢ ((G ∈ Abel ⋀ (A ∈ X ⋀ B ∈ X ⋀ C ∈ X)) →
((AGB)DC) = ((ADC)GB)) |