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

Theorem caofcom 7734
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 7089 . . . . 5 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
3 caofcom.3 . . . . . 6 (𝜑 → 𝐺:𝐴⟶𝑆)
43ffvelcdmda 7089 . . . . 5 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
52, 4jca 521 . . . 4 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆))
6 caofcom.4 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦) = (𝑦𝑅𝑥))
76caovcomg 7620 . . . 4 ((𝜑 ∧ ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))
85, 7syldan 603 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))
98mpteq2dva 5197 . 2 (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))))
10 caofref.1 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
111feqmptd 6958 . . 3 (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)))
123feqmptd 6958 . . 3 (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
1310, 2, 4, 11, 12offval2 7717 . 2 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))))
1410, 4, 2, 12, 11offval2 7717 . 2 (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))))
159, 13, 143eqtr4d 2805 1 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐺 ∘f 𝑅𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ↦ cmpt 5185  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424   ∘f cof 7695
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  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 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-of 7697
This theorem is used by:  plyn0mulidp  26611  plydivlem4  26626  quotcan  26641  dchrabl  27590  lfladdcom  40238  expgrowth  45428  amgmwlem  51170
  Copyright terms: Public domain W3C validator