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 39006
Description: Obsolete theorem, use grpsubeq0 19262 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 31171 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
543adant2 1149 . . 3 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 𝑈)
6 oveq1 7447 . . . 4 (𝐴 = 𝐵 → (𝐴𝐷𝐵) = (𝐵𝐷𝐵))
76eqeq1d 2765 . . 3 (𝐴 = 𝐵 → ((𝐴𝐷𝐵) = 𝑈 ↔ (𝐵𝐷𝐵) = 𝑈))
85, 7syl5ibrcom 250 . 2 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 → (𝐴𝐷𝐵) = 𝑈))
9 oveq1 7447 . . 3 ((𝐴𝐷𝐵) = 𝑈 → ((𝐴𝐷𝐵)𝐺𝐵) = (𝑈𝐺𝐵))
101, 2grponpcan 31172 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
111, 3grpolid 31145 . . . . 5 ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
12113adant2 1149 . . . 4 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑈𝐺𝐵) = 𝐵)
1310, 12eqeq12d 2779 . . 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 1570   ∈ wcel 2147  ran crn 5656  ‘cfv 6555  (class class class)co 7440  GrpOpcgr 31118  GIdcgi 31119   /𝑔 cgs 31121
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-grpo 31122  df-gid 31123  df-ginv 31124  df-gdiv 31125
This theorem is used by:  grpokerinj  39018  dmncan1  39201
  Copyright terms: Public domain W3C validator