| 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 30635 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴)) |
| 3 | 2 | 3adant3r3 1186 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐺𝐵) = (𝐵𝐺𝐴)) |
| 4 | 3 | oveq1d 7383 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐵𝐺𝐴)𝐷𝐶)) |
| 5 | 3ancoma 1098 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) ↔ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) | |
| 6 | ablogrpo 30634 | . . . 4 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp) | |
| 7 | abldiv.3 | . . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 8 | 1, 7 | grpomuldivass 30628 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 9 | 6, 8 | sylan 581 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 10 | 5, 9 | sylan2b 595 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐵𝐺𝐴)𝐷𝐶) = (𝐵𝐺(𝐴𝐷𝐶))) |
| 11 | simpr2 1197 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 12 | 1, 7 | grpodivcl 30626 | . . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 13 | 6, 12 | syl3an1 1164 | . . . . 5 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 14 | 13 | 3adant3r2 1185 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐷𝐶) ∈ 𝑋) |
| 15 | 11, 14 | jca 511 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) |
| 16 | 1 | ablocom 30635 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 17 | 16 | 3expb 1121 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐵 ∈ 𝑋 ∧ (𝐴𝐷𝐶) ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 18 | 15, 17 | syldan 592 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐺(𝐴𝐷𝐶)) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| 19 | 4, 10, 18 | 3eqtrd 2776 | 1 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ran crn 5633 ‘cfv 6500 (class class class)co 7368 GrpOpcgr 30576 /𝑔 cgs 30579 AbelOpcablo 30631 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-grpo 30580 df-gid 30581 df-ginv 30582 df-gdiv 30583 df-ablo 30632 |
| This theorem is referenced by: ablodivdiv 30640 nvaddsub 30742 ablo4pnp 38128 |
| Copyright terms: Public domain | W3C validator |