| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablomuldiv | Structured version Visualization version GIF version | ||
| Description: Law for group multiplication and division. (Contributed by NM, 15-Feb-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| abldiv.1 | ⊢ 𝑋 = ran 𝐺 |
| abldiv.3 | ⊢ 𝐷 = ( /𝑔 ‘𝐺) |
| Ref | Expression |
|---|---|
| ablomuldiv | ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abldiv.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
| 2 | 1 | ablocom 30929 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴)) |
| 3 | 2 | 3adant3r3 1203 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴)) |
| 4 | 3 | oveq1d 7431 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐵𝐺𝐴)𝐷𝐶)) |
| 5 | 3ancoma 1115 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) | |
| 6 | ablogrpo 30928 | . . . 4 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp) | |
| 7 | abldiv.3 | . . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 8 | 1, 7 | grpomuldivass 30922 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 9 | 6, 8 | sylan 592 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 10 | 5, 9 | sylan2b 606 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 11 | simpr2 1214 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 12 | 1, 7 | grpodivcl 30920 | . . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 13 | 6, 12 | syl3an1 1181 | . . . . 5 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 14 | 13 | 3adant3r2 1202 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 15 | 11, 14 | jca 521 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) |
| 16 | 1 | ablocom 30929 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 17 | 16 | 3expb 1138 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 18 | 15, 17 | syldan 603 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 19 | 4, 10, 18 | 3eqtrd 2804 | 1 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ran crn 5664 ‘cfv 6540 (class class class)co 7416 GrpOpcgr 30870 /𝑔 cgs 30873 AbelOpcablo 30925 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-grpo 30874 df-gid 30875 df-ginv 30876 df-gdiv 30877 df-ablo 30926 |
| This theorem is used by: ablodivdiv 30934 nvaddsub 31036 ablo4pnp 38564 |
| Copyright terms: Public domain | W3C validator |