Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ecovcom Structured version   Visualization version   GIF version

Theorem ecovcom 7741
 Description: Lemma used to transfer a commutative law via an equivalence relation. (Contributed by NM, 29-Aug-1995.) (Revised by David Abernethy, 4-Jun-2013.)
Hypotheses
Ref Expression
ecovcom.1 𝐶 = ((𝑆 × 𝑆) / )
ecovcom.2 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = [⟨𝐷, 𝐺⟩] )
ecovcom.3 (((𝑧𝑆𝑤𝑆) ∧ (𝑥𝑆𝑦𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
ecovcom.4 𝐷 = 𝐻
ecovcom.5 𝐺 = 𝐽
Assertion
Ref Expression
ecovcom ((𝐴𝐶𝐵𝐶) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝐴   𝑧,𝐵,𝑤   𝑥, + ,𝑦,𝑧,𝑤   𝑥, ,𝑦,𝑧,𝑤   𝑥,𝑆,𝑦,𝑧,𝑤   𝑧,𝐶,𝑤
Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦,𝑧,𝑤)   𝐺(𝑥,𝑦,𝑧,𝑤)   𝐻(𝑥,𝑦,𝑧,𝑤)   𝐽(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem ecovcom
StepHypRef Expression
1 ecovcom.1 . 2 𝐶 = ((𝑆 × 𝑆) / )
2 oveq1 6556 . . 3 ([⟨𝑥, 𝑦⟩] = 𝐴 → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = (𝐴 + [⟨𝑧, 𝑤⟩] ))
3 oveq2 6557 . . 3 ([⟨𝑥, 𝑦⟩] = 𝐴 → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴))
42, 3eqeq12d 2625 . 2 ([⟨𝑥, 𝑦⟩] = 𝐴 → (([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) ↔ (𝐴 + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴)))
5 oveq2 6557 . . 3 ([⟨𝑧, 𝑤⟩] = 𝐵 → (𝐴 + [⟨𝑧, 𝑤⟩] ) = (𝐴 + 𝐵))
6 oveq1 6556 . . 3 ([⟨𝑧, 𝑤⟩] = 𝐵 → ([⟨𝑧, 𝑤⟩] + 𝐴) = (𝐵 + 𝐴))
75, 6eqeq12d 2625 . 2 ([⟨𝑧, 𝑤⟩] = 𝐵 → ((𝐴 + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + 𝐴) ↔ (𝐴 + 𝐵) = (𝐵 + 𝐴)))
8 ecovcom.4 . . . 4 𝐷 = 𝐻
9 ecovcom.5 . . . 4 𝐺 = 𝐽
10 opeq12 4342 . . . . 5 ((𝐷 = 𝐻𝐺 = 𝐽) → ⟨𝐷, 𝐺⟩ = ⟨𝐻, 𝐽⟩)
1110eceq1d 7670 . . . 4 ((𝐷 = 𝐻𝐺 = 𝐽) → [⟨𝐷, 𝐺⟩] = [⟨𝐻, 𝐽⟩] )
128, 9, 11mp2an 704 . . 3 [⟨𝐷, 𝐺⟩] = [⟨𝐻, 𝐽⟩]
13 ecovcom.2 . . 3 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = [⟨𝐷, 𝐺⟩] )
14 ecovcom.3 . . . 4 (((𝑧𝑆𝑤𝑆) ∧ (𝑥𝑆𝑦𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
1514ancoms 468 . . 3 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ) = [⟨𝐻, 𝐽⟩] )
1612, 13, 153eqtr4a 2670 . 2 (((𝑥𝑆𝑦𝑆) ∧ (𝑧𝑆𝑤𝑆)) → ([⟨𝑥, 𝑦⟩] + [⟨𝑧, 𝑤⟩] ) = ([⟨𝑧, 𝑤⟩] + [⟨𝑥, 𝑦⟩] ))
171, 4, 7, 162ecoptocl 7725 1 ((𝐴𝐶𝐵𝐶) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ⟨cop 4131   × cxp 5036  (class class class)co 6549  [cec 7627   / cqs 7628 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fv 5812  df-ov 6552  df-ec 7631  df-qs 7635 This theorem is referenced by:  addcomsr  9787  mulcomsr  9789  axmulcom  9855
 Copyright terms: Public domain W3C validator