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

Theorem grpoeqdivid 38816
Description: Obsolete theorem, use grpsubeq0 19236 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.)
Hypotheses
Ref Expression
grpeqdivid.1 𝑋 = ran 𝐺
grpeqdivid.2 𝑈 = (GId‘𝐺)
grpeqdivid.3 𝐷 = ( /𝑔 ‘𝐺)
Assertion
Ref Expression
grpoeqdivid ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈))

Proof of Theorem grpoeqdivid
StepHypRef Expression
1 grpeqdivid.1 . . . . 5 𝑋 = ran 𝐺
2 grpeqdivid.3 . . . . 5 𝐷 = ( /𝑔 ‘𝐺)
3 grpeqdivid.2 . . . . 5 𝑈 = (GId‘𝐺)
41, 2, 3grpodivid 31144 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
543adant2 1149 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
6 oveq1 7427 . . . 4 (𝐴 = 𝐵 → (𝐴𝐷𝐵) = (𝐵𝐷𝐵))
76eqeq1d 2762 . . 3 (𝐴 = 𝐵 → ((𝐴𝐷𝐵) = 𝑈 ↔ (𝐵𝐷𝐵) = 𝑈))
85, 7syl5ibrcom 250 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 → (𝐴𝐷𝐵) = 𝑈))
9 oveq1 7427 . . 3 ((𝐴𝐷𝐵) = 𝑈 → ((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵))
101, 2grponpcan 31145 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
111, 3grpolid 31118 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
12113adant2 1149 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
1310, 12eqeq12d 2776 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵) ↔ 𝐴 = 𝐵))
149, 13imbitrid 247 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 𝑈 → 𝐴 = 𝐵))
158, 14impbid 215 1 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ↔ (𝐴𝐷𝐵) = 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ran crn 5651  ‘cfv 6538  (class class class)co 7420  GrpOpcgr 31091  GIdcgi 31092   /𝑔 cgs 31094
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-grpo 31095  df-gid 31096  df-ginv 31097  df-gdiv 31098
This theorem is used by:  grpokerinj  38828  dmncan1  39011
  Copyright terms: Public domain W3C validator