Theorem rngoa4 36053

Description: Rearrangement of 4 terms in a sum of ring elements. (Contributed by Steve Rodriguez, 9-Sep-2007.) (New usage is discouraged.)

Hypotheses

Ref	Expression
ringgcl.1	⊢ 𝐺 = (1st ‘𝑅)
ringgcl.2	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
rngoa4	⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(𝐶𝐺𝐷)) = ((𝐴𝐺𝐶)𝐺(𝐵𝐺𝐷)))

Proof of Theorem rngoa4

Step	Hyp	Ref	Expression
1		ringgcl.1	. . 3 ⊢ 𝐺 = (1st ‘𝑅)
2	1	rngoablo 36045	. 2 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ AbelOp)
3		ringgcl.2	. . 3 ⊢ 𝑋 = ran 𝐺
4	3	ablo4 28891	. 2 ⊢ ((𝐺 ∈ AbelOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(𝐶𝐺𝐷)) = ((𝐴𝐺𝐶)𝐺(𝐵𝐺𝐷)))
5	2, 4	syl3an1 1161	1 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(𝐶𝐺𝐷)) = ((𝐴𝐺𝐶)𝐺(𝐵𝐺𝐷)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1541   ∈ wcel 2109  ran crn 5589  ‘cfv 6430  (class class class)co 7268  1^st c1st 7815  AbelOpcablo 28885  RingOpscrngo 36031

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355  ax-un 7579

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-fo 6436  df-fv 6438  df-ov 7271  df-1st 7817  df-2nd 7818  df-grpo 28834  df-ablo 28886  df-rngo 36032

This theorem is referenced by: (None)