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

Theorem caovdird 7426
Description: Convert an operation distributive law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovdirg.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝐾)) → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)))
caovdird.2 (𝜑𝐴𝑆)
caovdird.3 (𝜑𝐵𝑆)
caovdird.4 (𝜑𝐶𝐾)
Assertion
Ref Expression
caovdird (𝜑 → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovdird
StepHypRef Expression
1 id 22 . 2 (𝜑𝜑)
2 caovdird.2 . 2 (𝜑𝐴𝑆)
3 caovdird.3 . 2 (𝜑𝐵𝑆)
4 caovdird.4 . 2 (𝜑𝐶𝐾)
5 caovdirg.1 . . 3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝐾)) → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)))
65caovdirg 7425 . 2 ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝐾)) → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶)))
71, 2, 3, 4, 6syl13anc 1374 1 (𝜑 → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  (class class class)co 7213
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-ext 2708
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3066  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-iota 6338  df-fv 6388  df-ov 7216
This theorem is referenced by:  caofdir  7508
  Copyright terms: Public domain W3C validator