![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ablonncan | Structured version Visualization version GIF version |
Description: Cancellation law for group division. (nncan 10763 analog.) (Contributed by NM, 7-Mar-2008.) (New usage is discouraged.) |
Ref | Expression |
---|---|
abldiv.1 | ⊢ 𝑋 = ran 𝐺 |
abldiv.3 | ⊢ 𝐷 = ( /𝑔 ‘𝐺) |
Ref | Expression |
---|---|
ablonncan | ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) | |
2 | 1 | 3anidm12 1412 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) |
3 | abldiv.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
4 | abldiv.3 | . . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
5 | 3, 4 | ablodivdiv 28021 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵)) |
6 | 2, 5 | sylan2 592 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵)) |
7 | 6 | 3impb 1108 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = ((𝐴𝐷𝐴)𝐺𝐵)) |
8 | ablogrpo 28015 | . . . . 5 ⊢ (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp) | |
9 | eqid 2795 | . . . . . 6 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
10 | 3, 4, 9 | grpodivid 28010 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺)) |
11 | 8, 10 | sylan 580 | . . . 4 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺)) |
12 | 11 | 3adant3 1125 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐴) = (GId‘𝐺)) |
13 | 12 | oveq1d 7031 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐴)𝐺𝐵) = ((GId‘𝐺)𝐺𝐵)) |
14 | 3, 9 | grpolid 27984 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵) |
15 | 8, 14 | sylan 580 | . . 3 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵) |
16 | 15 | 3adant2 1124 | . 2 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((GId‘𝐺)𝐺𝐵) = 𝐵) |
17 | 7, 13, 16 | 3eqtrd 2835 | 1 ⊢ ((𝐺 ∈ AbelOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷(𝐴𝐷𝐵)) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1080 = wceq 1522 ∈ wcel 2081 ran crn 5444 ‘cfv 6225 (class class class)co 7016 GrpOpcgr 27957 GIdcgi 27958 /𝑔 cgs 27960 AbelOpcablo 28012 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-13 2344 ax-ext 2769 ax-rep 5081 ax-sep 5094 ax-nul 5101 ax-pow 5157 ax-pr 5221 ax-un 7319 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3an 1082 df-tru 1525 df-ex 1762 df-nf 1766 df-sb 2043 df-mo 2576 df-eu 2612 df-clab 2776 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ne 2985 df-ral 3110 df-rex 3111 df-reu 3112 df-rab 3114 df-v 3439 df-sbc 3707 df-csb 3812 df-dif 3862 df-un 3864 df-in 3866 df-ss 3874 df-nul 4212 df-if 4382 df-pw 4455 df-sn 4473 df-pr 4475 df-op 4479 df-uni 4746 df-iun 4827 df-br 4963 df-opab 5025 df-mpt 5042 df-id 5348 df-xp 5449 df-rel 5450 df-cnv 5451 df-co 5452 df-dm 5453 df-rn 5454 df-res 5455 df-ima 5456 df-iota 6189 df-fun 6227 df-fn 6228 df-f 6229 df-f1 6230 df-fo 6231 df-f1o 6232 df-fv 6233 df-riota 6977 df-ov 7019 df-oprab 7020 df-mpo 7021 df-1st 7545 df-2nd 7546 df-grpo 27961 df-gid 27962 df-ginv 27963 df-gdiv 27964 df-ablo 28013 |
This theorem is referenced by: ablonnncan1 28025 |
Copyright terms: Public domain | W3C validator |