![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > grpoeqdivid | Structured version Visualization version GIF version |
Description: Two group elements are equal iff their quotient is the identity. (Contributed by Jeff Madsen, 6-Jan-2011.) |
Ref | Expression |
---|---|
grpeqdivid.1 | ⊢ 𝑋 = ran 𝐺 |
grpeqdivid.2 | ⊢ 𝑈 = (GId‘𝐺) |
grpeqdivid.3 | ⊢ 𝐷 = ( /𝑔 ‘𝐺) |
Ref | Expression |
---|---|
grpoeqdivid | ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grpeqdivid.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
2 | grpeqdivid.3 | . . . . 5 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
3 | grpeqdivid.2 | . . . . 5 ⊢ 𝑈 = (GId‘𝐺) | |
4 | 1, 2, 3 | grpodivid 30574 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈) |
5 | 4 | 3adant2 1131 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈) |
6 | oveq1 7455 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐴𝐷𝐵) = (𝐵𝐷𝐵)) | |
7 | 6 | eqeq1d 2742 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝐴𝐷𝐵) = 𝑈 ↔ (𝐵𝐷𝐵) = 𝑈)) |
8 | 5, 7 | syl5ibrcom 247 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 → (𝐴𝐷𝐵) = 𝑈)) |
9 | oveq1 7455 | . . 3 ⊢ ((𝐴𝐷𝐵) = 𝑈 → ((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵)) | |
10 | 1, 2 | grponpcan 30575 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
11 | 1, 3 | grpolid 30548 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵) |
12 | 11 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵) |
13 | 10, 12 | eqeq12d 2756 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵) ↔ 𝐴 = 𝐵)) |
14 | 9, 13 | imbitrid 244 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 𝑈 → 𝐴 = 𝐵)) |
15 | 8, 14 | impbid 212 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ran crn 5701 ‘cfv 6573 (class class class)co 7448 GrpOpcgr 30521 GIdcgi 30522 /𝑔 cgs 30524 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-grpo 30525 df-gid 30526 df-ginv 30527 df-gdiv 30528 |
This theorem is referenced by: grpokerinj 37853 dmncan1 38036 |
Copyright terms: Public domain | W3C validator |