Theorem caofdi 7733

Description: Transfer a distributive law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.)

Hypotheses

Ref	Expression
caofdi.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofdi.2	⊢ (𝜑 → 𝐹:𝐴⟶𝐾)
caofdi.3	⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
caofdi.4	⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
caofdi.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧)))

Assertion

Ref	Expression
caofdi	⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝑥,𝑂,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧

Allowed substitution hints:   𝑉(𝑥, 𝑦, 𝑧)

Proof of Theorem caofdi

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofdi.5	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧)))
2	1	adantlr 728	. . . 4 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑇(𝑦𝑅𝑧)) = ((𝑥𝑇𝑦)𝑂(𝑥𝑇𝑧)))
3		caofdi.2	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐾)
4	3	ffvelcdmda 7082	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝐾)
5		caofdi.3	. . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
6	5	ffvelcdmda 7082	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
7		caofdi.4	. . . . 5 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
8	7	ffvelcdmda 7082	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆)
9	2, 4, 6, 8	caovdid 7634	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤))) = (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤))))
10	9	mpteq2dva 5198	. 2 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤)))) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤)))))
11		caofdi.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
12		ovexd 7453	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐺‘𝑤)𝑅(𝐻‘𝑤)) ∈ V)
13	3	feqmptd 6951	. . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)))
14	5	feqmptd 6951	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
15	7	feqmptd 6951	. . . 4 ⊢ (𝜑 → 𝐻 = (𝑤 ∈ 𝐴 ↦ (𝐻‘𝑤)))
16	11, 6, 8, 14, 15	offval2 7711	. . 3 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐻‘𝑤))))
17	11, 4, 12, 13, 16	offval2 7711	. 2 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇((𝐺‘𝑤)𝑅(𝐻‘𝑤)))))
18		ovexd 7453	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐺‘𝑤)) ∈ V)
19		ovexd 7453	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑇(𝐻‘𝑤)) ∈ V)
20	11, 4, 6, 13, 14	offval2 7711	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐺‘𝑤))))
21	11, 4, 8, 13, 15	offval2 7711	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑇𝐻) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑇(𝐻‘𝑤))))
22	11, 18, 19, 20, 21	offval2 7711	. 2 ⊢ (𝜑 → ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻)) = (𝑤 ∈ 𝐴 ↦ (((𝐹‘𝑤)𝑇(𝐺‘𝑤))𝑂((𝐹‘𝑤)𝑇(𝐻‘𝑤)))))
23	10, 17, 22	3eqtr4d 2806	1 ⊢ (𝜑 → (𝐹 ∘f 𝑇(𝐺 ∘f 𝑅𝐻)) = ((𝐹 ∘f 𝑇𝐺) ∘f 𝑂(𝐹 ∘f 𝑇𝐻)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ↦ 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:  psrlmod  22260  plydivlem4  26610  plydiveu  26612  quotcan  26625  basellem9  27409  lflvsdi2  40116  mendlmod  44175