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

Theorem caovdig 7614
Description: Convert an operation distributive law to class notation. (Contributed by NM, 25-Aug-1995.) (Revised by Mario Carneiro, 26-Jul-2014.)
Hypothesis
Ref Expression
caovdig.1 ((𝜑 ∧ (𝑥𝐾𝑦𝑆𝑧𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
Assertion
Ref Expression
caovdig ((𝜑 ∧ (𝐴𝐾𝐵𝑆𝐶𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovdig
StepHypRef Expression
1 caovdig.1 . . 3 ((𝜑 ∧ (𝑥𝐾𝑦𝑆𝑧𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
21ralrimivvva 3211 . 2 (𝜑 → ∀𝑥𝐾𝑦𝑆𝑧𝑆 (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
3 oveq1 7407 . . . 4 (𝑥 = 𝐴 → (𝑥𝐺(𝑦𝐹𝑧)) = (𝐴𝐺(𝑦𝐹𝑧)))
4 oveq1 7407 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
5 oveq1 7407 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐺𝑧) = (𝐴𝐺𝑧))
64, 5oveq12d 7418 . . . 4 (𝑥 = 𝐴 → ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)))
73, 6eqeq12d 2781 . . 3 (𝑥 = 𝐴 → ((𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) ↔ (𝐴𝐺(𝑦𝐹𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧))))
8 oveq1 7407 . . . . 5 (𝑦 = 𝐵 → (𝑦𝐹𝑧) = (𝐵𝐹𝑧))
98oveq2d 7416 . . . 4 (𝑦 = 𝐵 → (𝐴𝐺(𝑦𝐹𝑧)) = (𝐴𝐺(𝐵𝐹𝑧)))
10 oveq2 7408 . . . . 5 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
1110oveq1d 7415 . . . 4 (𝑦 = 𝐵 → ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)))
129, 11eqeq12d 2781 . . 3 (𝑦 = 𝐵 → ((𝐴𝐺(𝑦𝐹𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)) ↔ (𝐴𝐺(𝐵𝐹𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧))))
13 oveq2 7408 . . . . 5 (𝑧 = 𝐶 → (𝐵𝐹𝑧) = (𝐵𝐹𝐶))
1413oveq2d 7416 . . . 4 (𝑧 = 𝐶 → (𝐴𝐺(𝐵𝐹𝑧)) = (𝐴𝐺(𝐵𝐹𝐶)))
15 oveq2 7408 . . . . 5 (𝑧 = 𝐶 → (𝐴𝐺𝑧) = (𝐴𝐺𝐶))
1615oveq2d 7416 . . . 4 (𝑧 = 𝐶 → ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))
1714, 16eqeq12d 2781 . . 3 (𝑧 = 𝐶 → ((𝐴𝐺(𝐵𝐹𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)) ↔ (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))))
187, 12, 17rspc3v 3600 . 2 ((𝐴𝐾𝐵𝑆𝐶𝑆) → (∀𝑥𝐾𝑦𝑆𝑧𝑆 (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))))
192, 18mpan9 515 1 ((𝜑 ∧ (𝐴𝐾𝐵𝑆𝐶𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1563  wcel 2145  wral 3079  (class class class)co 7400
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-iota 6481  df-fv 6533  df-ov 7403
This theorem is referenced by:  caovdid  7615  caovdi  7619  srgdilem  20262  ringdilem  20319
  Copyright terms: Public domain W3C validator