grpoeqdivid - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > grpoeqdivid		Structured version Visualization version GIF version

Theorem grpoeqdivid 35153

Description: Two group elements are equal iff their quotient is the identity. (Contributed by Jeff Madsen, 6-Jan-2011.)

**Hypotheses**
Ref	Expression
grpeqdivid.1	⊢ 𝑋 = ran 𝐺
grpeqdivid.2	⊢ 𝑈 = (GId‘𝐺)
grpeqdivid.3	⊢ 𝐷 = ( /_𝑔 ‘𝐺)

**Assertion**
Ref	Expression
grpoeqdivid	⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈))

**Proof of Theorem grpoeqdivid**
Step	Hyp	Ref	Expression
1		grpeqdivid.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
2		grpeqdivid.3	. . . . 5 ⊢ 𝐷 = ( /_𝑔 ‘𝐺)
3		grpeqdivid.2	. . . . 5 ⊢ 𝑈 = (GId‘𝐺)
4	1, 2, 3	grpodivid 28313	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
5	4	3adant2 1127	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
6		oveq1 7157	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴𝐷𝐵) = (𝐵𝐷𝐵))
7	6	eqeq1d 2823	. . 3 ⊢ (𝐴 = 𝐵 → ((𝐴𝐷𝐵) = 𝑈 ↔ (𝐵𝐷𝐵) = 𝑈))
8	5, 7	syl5ibrcom 249	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 → (𝐴𝐷𝐵) = 𝑈))
9		oveq1 7157	. . 3 ⊢ ((𝐴𝐷𝐵) = 𝑈 → ((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵))
10	1, 2	grponpcan 28314	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
11	1, 3	grpolid 28287	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
12	11	3adant2 1127	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
13	10, 12	eqeq12d 2837	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵) ↔ 𝐴 = 𝐵))
14	9, 13	syl5ib 246	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 𝑈 → 𝐴 = 𝐵))
15	8, 14	impbid 214	1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ran crn 5550 ‘cfv 6349 (class class class)co 7150 GrpOpcgr 28260 GIdcgi 28261 /_𝑔 cgs 28263

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-grpo 28264 df-gid 28265 df-ginv 28266 df-gdiv 28267

This theorem is referenced by: grpokerinj 35165 dmncan1 35348

W3C validator