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

Theorem caofcom 7728
Description: Transfer a commutative law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.)
Hypotheses
Ref Expression
caofref.1 (𝜑 → 𝐴 ∈ 𝑉)
caofref.2 (𝜑 → 𝐹:𝐴⟶𝑆)
caofcom.3 (𝜑 → 𝐺:𝐴⟶𝑆)
caofcom.4 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦) = (𝑦𝑅𝑥))
Assertion
Ref Expression
caofcom (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐺 ∘f 𝑅𝐹))
Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐺,𝑦   𝜑,𝑥,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem caofcom
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 caofref.2 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝑆)
21ffvelcdmda 7082 . . . . 5 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
3 caofcom.3 . . . . . 6 (𝜑 → 𝐺:𝐴⟶𝑆)
43ffvelcdmda 7082 . . . . 5 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
52, 4jca 521 . . . 4 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆))
6 caofcom.4 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦) = (𝑦𝑅𝑥))
76caovcomg 7614 . . . 4 ((𝜑 ∧ ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))
85, 7syldan 603 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))
98mpteq2dva 5198 . 2 (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))))
10 caofref.1 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
111feqmptd 6951 . . 3 (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)))
123feqmptd 6951 . . 3 (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
1310, 2, 4, 11, 12offval2 7711 . 2 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))))
1410, 4, 2, 12, 11offval2 7711 . 2 (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))))
159, 13, 143eqtr4d 2806 1 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐺 ∘f 𝑅𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ∘f cof 7689
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-of 7691
This theorem is used by:  plyn0mulidp  26595  plydivlem4  26610  quotcan  26625  dchrabl  27574  lfladdcom  40109  expgrowth  45304  amgmwlem  50956
  Copyright terms: Public domain W3C validator