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 38559
Description: A commutative/associative law for Abelian groups. (Contributed by Jeff Madsen, 11-Jun-2010.)
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 30913 . . . . 5 ((𝐺 ∈ AbelOp ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
51, 4sylan2br 606 . . . 4 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ 𝐶𝑋)) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
65adantrrr 737 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵)𝐷𝐶) = ((𝐴𝐷𝐶)𝐺𝐵))
76oveq1d 7425 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹))
8 ablogrpo 30908 . . . . . . 7 (𝐺 ∈ AbelOp → 𝐺 ∈ GrpOp)
92grpocl 30861 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋)
1093expib 1140 . . . . . . 7 (𝐺 ∈ GrpOp → ((𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋))
118, 10syl 18 . . . . . 6 (𝐺 ∈ AbelOp → ((𝐴𝑋𝐵𝑋) → (𝐴𝐺𝐵) ∈ 𝑋))
1211anim1d 622 . . . . 5 (𝐺 ∈ AbelOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝑋𝐹𝑋))))
13 3anass 1111 . . . . 5 (((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋) ↔ ((𝐴𝐺𝐵) ∈ 𝑋 ∧ (𝐶𝑋𝐹𝑋)))
1412, 13imbitrrdi 255 . . . 4 (𝐺 ∈ AbelOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋)))
1514imp 411 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋))
162, 3ablodivdiv4 30915 . . 3 ((𝐺 ∈ AbelOp ∧ ((𝐴𝐺𝐵) ∈ 𝑋𝐶𝑋𝐹𝑋)) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)))
1715, 16syldan 602 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐺𝐵)𝐷𝐶)𝐷𝐹) = ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)))
182, 3grpodivcl 30900 . . . . . . . 8 ((𝐺 ∈ GrpOp ∧ 𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋)
19183expib 1140 . . . . . . 7 (𝐺 ∈ GrpOp → ((𝐴𝑋𝐶𝑋) → (𝐴𝐷𝐶) ∈ 𝑋))
2019anim1d 622 . . . . . 6 (𝐺 ∈ GrpOp → (((𝐴𝑋𝐶𝑋) ∧ (𝐵𝑋𝐹𝑋)) → ((𝐴𝐷𝐶) ∈ 𝑋 ∧ (𝐵𝑋𝐹𝑋))))
21 an4 668 . . . . . 6 (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) ↔ ((𝐴𝑋𝐶𝑋) ∧ (𝐵𝑋𝐹𝑋)))
22 3anass 1111 . . . . . 6 (((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋) ↔ ((𝐴𝐷𝐶) ∈ 𝑋 ∧ (𝐵𝑋𝐹𝑋)))
2320, 21, 223imtr4g 299 . . . . 5 (𝐺 ∈ GrpOp → (((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋)) → ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋)))
2423imp 411 . . . 4 ((𝐺 ∈ GrpOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋))
252, 3grpomuldivass 30902 . . . 4 ((𝐺 ∈ GrpOp ∧ ((𝐴𝐷𝐶) ∈ 𝑋𝐵𝑋𝐹𝑋)) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
2624, 25syldan 602 . . 3 ((𝐺 ∈ GrpOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
278, 26sylan 591 . 2 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → (((𝐴𝐷𝐶)𝐺𝐵)𝐷𝐹) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
287, 17, 273eqtr3d 2806 1 ((𝐺 ∈ AbelOp ∧ ((𝐴𝑋𝐵𝑋) ∧ (𝐶𝑋𝐹𝑋))) → ((𝐴𝐺𝐵)𝐷(𝐶𝐺𝐹)) = ((𝐴𝐷𝐶)𝐺(𝐵𝐷𝐹)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  ran crn 5662  cfv 6536  (class class class)co 7410  GrpOpcgr 30850   /𝑔 cgs 30853  AbelOpcablo 30905
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-grpo 30854  df-gid 30855  df-ginv 30856  df-gdiv 30857  df-ablo 30906
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator