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

Theorem ablo4pnp 38695
Description: Obsolete theorem, use ablsub4 19963 instead. A commutative/associative law for Abelian groups. (Contributed by Jeff Madsen, 11-Jun-2010.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
abl4pnp.1 𝑋 = ran 𝐺
abl4pnp.2 𝐷 = ( /𝑔𝐺)
Assertion
Ref Expression
ablo4pnp ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))

Proof of Theorem ablo4pnp
StepHypRef Expression
1 df-3an 1105 . . . . 5 ((𝐴𝑋𝐵𝑋𝐶𝑋) ↔ ((𝐴𝑋𝐵𝑋) ∧ 𝐶𝑋))
2 abl4pnp.1 . . . . . 6 𝑋 = ran 𝐺
3 abl4pnp.2 . . . . . 6 𝐷 = ( /𝑔𝐺)
42, 3ablomuldiv 31065 . . . . 5 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
51, 4sylan2br 607 . . . 4 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ 𝐶𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
65adantrrr 738 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
76oveq1d 7431 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹))
8 ablogrpo 31060 . . . . . . 7 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
92grpocl 31013 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
1093expib 1140 . . . . . . 7 (𝐺 ∈ GrpOp → ((𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋))
118, 10syl 18 . . . . . 6 (𝐺 ∈ AbelOp → ((𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋))
1211anim1d 623 . . . . 5 (𝐺 ∈ AbelOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝑋𝐹𝑋))))
13 3anass 1111 . . . . 5 (((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋) ↔ ((𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝑋𝐹𝑋)))
1412, 13imbitrrdi 255 . . . 4 (𝐺 ∈ AbelOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋)))
1514imp 412 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋))
162, 3ablodivdiv4 31067 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋)) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)))
1715, 16syldan 603 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)))
182, 3grpodivcl 31052 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
19183expib 1140 . . . . . . 7 (𝐺 ∈ GrpOp → ((𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋))
2019anim1d 623 . . . . . 6 (𝐺 ∈ GrpOp → (((𝐴𝑋𝐶𝑋) ∧ (𝐵𝑋𝐹𝑋)) → ((𝐴𝐷𝐶) ∈ 𝑋 ∧ (𝐵𝑋𝐹𝑋))))
21 an4 669 . . . . . 6 (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) ↔ ((𝐴𝑋𝐶𝑋) ∧ (𝐵𝑋𝐹𝑋)))
22 3anass 1111 . . . . . 6 (((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋) ↔ ((𝐴𝐷𝐶) ∈ 𝑋 ∧ (𝐵𝑋𝐹𝑋)))
2320, 21, 223imtr4g 299 . . . . 5 (𝐺 ∈ GrpOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋)))
2423imp 412 . . . 4 ((𝐺 ∈ GrpOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋))
252, 3grpomuldivass 31054 . . . 4 ((𝐺 ∈ GrpOp ∧ ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋)) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
2624, 25syldan 603 . . 3 ((𝐺 ∈ GrpOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
278, 26sylan 592 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
287, 17, 273eqtr3d 2803 1 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  ran crn 5656  cfv 6535  (class class class)co 7416  GrpOpcgr 31002   /𝑔 cgs 31005  AbelOpcablo 31057
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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742
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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7992  df-2nd 7993  df-grpo 31006  df-gid 31007  df-ginv 31008  df-gdiv 31009  df-ablo 31058
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator