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

Theorem ghomdiv 39092
Description: Obsolete theorem, use ghmsub 19488 instead. Group homomorphisms preserve division. (Contributed by Jeff Madsen, 16-Jun-2011.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
ghomdiv.1 𝑋 = ran 𝐺
ghomdiv.2 𝐷 = ( /𝑔 ‘𝐺)
ghomdiv.3 𝐶 = ( /𝑔 ‘𝐻)
Assertion
Ref Expression
ghomdiv (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘(𝐴𝐷𝐵)) = ((𝐹‘𝐴)𝐶(𝐹‘𝐵)))

Proof of Theorem ghomdiv
StepHypRef Expression
1 simpl2 1211 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐻 ∈ GrpOp)
2 ghomdiv.1 . . . . . . 7 𝑋 = ran 𝐺
3 eqid 2763 . . . . . . 7 ran 𝐻 = ran 𝐻
42, 3ghomf 39090 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → 𝐹:𝑋⟶ran 𝐻)
54ffvelcdmda 7116 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ran 𝐻)
65adantrr 730 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘𝐴) ∈ ran 𝐻)
74ffvelcdmda 7116 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ 𝐵 ∈ 𝑋) → (𝐹‘𝐵) ∈ ran 𝐻)
87adantrl 729 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘𝐵) ∈ ran 𝐻)
9 ghomdiv.3 . . . . 5 𝐶 = ( /𝑔 ‘𝐻)
103, 9grponpcan 31202 . . . 4 ((𝐻 ∈ GrpOp ∧ (𝐹‘𝐴) ∈ ran 𝐻 ∧ (𝐹‘𝐵) ∈ ran 𝐻) → (((𝐹‘𝐴)𝐶(𝐹‘𝐵))𝐻(𝐹‘𝐵)) = (𝐹‘𝐴))
111, 6, 8, 10syl3anc 1399 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (((𝐹‘𝐴)𝐶(𝐹‘𝐵))𝐻(𝐹‘𝐵)) = (𝐹‘𝐴))
12 ghomdiv.2 . . . . . . 7 𝐷 = ( /𝑔 ‘𝐺)
132, 12grponpcan 31202 . . . . . 6 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
14133expb 1138 . . . . 5 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
15143ad2antl1 1204 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴)
1615fveq2d 6920 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘((𝐴𝐷𝐵)𝐺𝐵)) = (𝐹‘𝐴))
172, 12grpodivcl 31198 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ 𝑋)
18173expb 1138 . . . . . 6 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ 𝑋)
19 simprr 785 . . . . . 6 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐵 ∈ 𝑋)
2018, 19jca 521 . . . . 5 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
21203ad2antl1 1204 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐷𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
222ghomlinOLD 39088 . . . . 5 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ ((𝐴𝐷𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)) = (𝐹‘((𝐴𝐷𝐵)𝐺𝐵)))
2322eqcomd 2769 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ ((𝐴𝐷𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘((𝐴𝐷𝐵)𝐺𝐵)) = ((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)))
2421, 23syldan 603 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘((𝐴𝐷𝐵)𝐺𝐵)) = ((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)))
2511, 16, 243eqtr2rd 2805 . 2 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)) = (((𝐹‘𝐴)𝐶(𝐹‘𝐵))𝐻(𝐹‘𝐵)))
26183ad2antl1 1204 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐷𝐵) ∈ 𝑋)
274ffvelcdmda 7116 . . . 4 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴𝐷𝐵) ∈ 𝑋) → (𝐹‘(𝐴𝐷𝐵)) ∈ ran 𝐻)
2826, 27syldan 603 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘(𝐴𝐷𝐵)) ∈ ran 𝐻)
293, 9grpodivcl 31198 . . . 4 ((𝐻 ∈ GrpOp ∧ (𝐹‘𝐴) ∈ ran 𝐻 ∧ (𝐹‘𝐵) ∈ ran 𝐻) → ((𝐹‘𝐴)𝐶(𝐹‘𝐵)) ∈ ran 𝐻)
301, 6, 8, 29syl3anc 1399 . . 3 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐹‘𝐴)𝐶(𝐹‘𝐵)) ∈ ran 𝐻)
313grporcan 31177 . . 3 ((𝐻 ∈ GrpOp ∧ ((𝐹‘(𝐴𝐷𝐵)) ∈ ran 𝐻 ∧ ((𝐹‘𝐴)𝐶(𝐹‘𝐵)) ∈ ran 𝐻 ∧ (𝐹‘𝐵) ∈ ran 𝐻)) → (((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)) = (((𝐹‘𝐴)𝐶(𝐹‘𝐵))𝐻(𝐹‘𝐵)) ↔ (𝐹‘(𝐴𝐷𝐵)) = ((𝐹‘𝐴)𝐶(𝐹‘𝐵))))
321, 28, 30, 8, 31syl13anc 1400 . 2 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (((𝐹‘(𝐴𝐷𝐵))𝐻(𝐹‘𝐵)) = (((𝐹‘𝐴)𝐶(𝐹‘𝐵))𝐻(𝐹‘𝐵)) ↔ (𝐹‘(𝐴𝐷𝐵)) = ((𝐹‘𝐴)𝐶(𝐹‘𝐵))))
3325, 32mpbid 235 1 (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘(𝐴𝐷𝐵)) = ((𝐹‘𝐴)𝐶(𝐹‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ran crn 5659  ‘cfv 6566  (class class class)co 7451  GrpOpcgr 31148   /𝑔 cgs 31151   GrpOpHom cghomOLD 39083
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-grpo 31152  df-gid 31153  df-ginv 31154  df-gdiv 31155  df-ghomOLD 39084
This theorem is used by:  grpokerinj  39093  rngohomsub  39173
  Copyright terms: Public domain W3C validator