| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > grpoeqdivid | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem, use grpsubeq0 19148 instead. Two group elements are equal iff their quotient is the identity. (Contributed by Jeff Madsen, 6-Jan-2011.) (New usage is discouraged.) (Proof modification is discouraged.) |
| 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 31007 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈) |
| 5 | 4 | 3adant2 1149 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈) |
| 6 | oveq1 7423 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐴𝐷𝐵) = (𝐵𝐷𝐵)) | |
| 7 | 6 | eqeq1d 2764 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝐴𝐷𝐵) = 𝑈 ↔ (𝐵𝐷𝐵) = 𝑈)) |
| 8 | 5, 7 | syl5ibrcom 250 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 → (𝐴𝐷𝐵) = 𝑈)) |
| 9 | oveq1 7423 | . . 3 ⊢ ((𝐴𝐷𝐵) = 𝑈 → ((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵)) | |
| 10 | 1, 2 | grponpcan 31008 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
| 11 | 1, 3 | grpolid 30981 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵) |
| 12 | 11 | 3adant2 1149 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵) |
| 13 | 10, 12 | eqeq12d 2778 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵) ↔ 𝐴 = 𝐵)) |
| 14 | 9, 13 | imbitrid 247 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 𝑈 → 𝐴 = 𝐵)) |
| 15 | 8, 14 | impbid 215 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ran crn 5660 ‘cfv 6537 (class class class)co 7416 GrpOpcgr 30954 GIdcgi 30955 /𝑔 cgs 30957 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-grpo 30958 df-gid 30959 df-ginv 30960 df-gdiv 30961 |
| This theorem is used by: grpokerinj 38628 dmncan1 38811 |
| Copyright terms: Public domain | W3C validator |