Theorem coof 7737

Description: The composition of a homomorphism with a function operation. (Contributed by SN, 20-May-2025.)

Hypotheses

Ref	Expression
coof.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
coof.g	⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
coof.h	⊢ (𝜑 → 𝐻 Fn 𝐵)
coof.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
coof.1	⊢ ((𝜑 ∧ (𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏𝑅𝑐) ∈ 𝐵)
coof.2	⊢ ((𝜑 ∧ (𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐)))

Assertion

Ref	Expression
coof	⊢ (𝜑 → (𝐻 ∘ (𝐹 ∘f 𝑅𝐺)) = ((𝐻 ∘ 𝐹) ∘f 𝑆(𝐻 ∘ 𝐺)))

Distinct variable groups:   𝐵,𝑏,𝑐   𝐹,𝑏,𝑐   𝐺,𝑏,𝑐   𝐻,𝑏,𝑐   𝑅,𝑏,𝑐   𝑆,𝑏,𝑐   𝜑,𝑏,𝑐

Allowed substitution hints:   𝐴(𝑏,𝑐)   𝑉(𝑏,𝑐)

Proof of Theorem coof

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		coof.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	ffvelcdmda 7118	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
3		coof.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4	3	ffvelcdmda 7118	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵)
5		coof.2	. . . . . 6 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐)))
6	5	ralrimivva 3208	. . . . 5 ⊢ (𝜑 → ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐)))
7	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐)))
8		fvoveq1 7471	. . . . . 6 ⊢ (𝑏 = (𝐹‘𝑥) → (𝐻‘(𝑏𝑅𝑐)) = (𝐻‘((𝐹‘𝑥)𝑅𝑐)))
9		fveq2 6920	. . . . . . 7 ⊢ (𝑏 = (𝐹‘𝑥) → (𝐻‘𝑏) = (𝐻‘(𝐹‘𝑥)))
10	9	oveq1d 7463	. . . . . 6 ⊢ (𝑏 = (𝐹‘𝑥) → ((𝐻‘𝑏)𝑆(𝐻‘𝑐)) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘𝑐)))
11	8, 10	eqeq12d 2756	. . . . 5 ⊢ (𝑏 = (𝐹‘𝑥) → ((𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐)) ↔ (𝐻‘((𝐹‘𝑥)𝑅𝑐)) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘𝑐))))
12		oveq2 7456	. . . . . . 7 ⊢ (𝑐 = (𝐺‘𝑥) → ((𝐹‘𝑥)𝑅𝑐) = ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
13	12	fveq2d 6924	. . . . . 6 ⊢ (𝑐 = (𝐺‘𝑥) → (𝐻‘((𝐹‘𝑥)𝑅𝑐)) = (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
14		fveq2 6920	. . . . . . 7 ⊢ (𝑐 = (𝐺‘𝑥) → (𝐻‘𝑐) = (𝐻‘(𝐺‘𝑥)))
15	14	oveq2d 7464	. . . . . 6 ⊢ (𝑐 = (𝐺‘𝑥) → ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘𝑐)) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥))))
16	13, 15	eqeq12d 2756	. . . . 5 ⊢ (𝑐 = (𝐺‘𝑥) → ((𝐻‘((𝐹‘𝑥)𝑅𝑐)) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘𝑐)) ↔ (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥)))))
17	11, 16	rspc2va 3647	. . . 4 ⊢ ((((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐺‘𝑥) ∈ 𝐵) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝐻‘(𝑏𝑅𝑐)) = ((𝐻‘𝑏)𝑆(𝐻‘𝑐))) → (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥))))
18	2, 4, 7, 17	syl21anc 837	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥))))
19	18	mpteq2dva 5266	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) = (𝑥 ∈ 𝐴 ↦ ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥)))))
20	1	ffnd 6748	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴)
21	3	ffnd 6748	. . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐴)
22		coof.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
23		inidm 4248	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
24		eqidd 2741	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥))
25		eqidd 2741	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐺‘𝑥))
26	20, 21, 22, 22, 23, 24, 25	offval 7723	. . . 4 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
27	26	coeq2d 5887	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝐹 ∘f 𝑅𝐺)) = (𝐻 ∘ (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))))
28		coof.h	. . . . 5 ⊢ (𝜑 → 𝐻 Fn 𝐵)
29		dffn3 6759	. . . . 5 ⊢ (𝐻 Fn 𝐵 ↔ 𝐻:𝐵⟶ran 𝐻)
30	28, 29	sylib 218	. . . 4 ⊢ (𝜑 → 𝐻:𝐵⟶ran 𝐻)
31	2, 4	jca 511	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐺‘𝑥) ∈ 𝐵))
32		coof.1	. . . . . 6 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏𝑅𝑐) ∈ 𝐵)
33	32	caovclg 7642	. . . . 5 ⊢ ((𝜑 ∧ ((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐺‘𝑥) ∈ 𝐵)) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ 𝐵)
34	31, 33	syldan 590	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ 𝐵)
35	30, 34	cofmpt 7166	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) = (𝑥 ∈ 𝐴 ↦ (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥)))))
36	27, 35	eqtrd 2780	. 2 ⊢ (𝜑 → (𝐻 ∘ (𝐹 ∘f 𝑅𝐺)) = (𝑥 ∈ 𝐴 ↦ (𝐻‘((𝐹‘𝑥)𝑅(𝐺‘𝑥)))))
37		fnfco 6786	. . . 4 ⊢ ((𝐻 Fn 𝐵 ∧ 𝐹:𝐴⟶𝐵) → (𝐻 ∘ 𝐹) Fn 𝐴)
38	28, 1, 37	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐻 ∘ 𝐹) Fn 𝐴)
39		fnfco 6786	. . . 4 ⊢ ((𝐻 Fn 𝐵 ∧ 𝐺:𝐴⟶𝐵) → (𝐻 ∘ 𝐺) Fn 𝐴)
40	28, 3, 39	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐻 ∘ 𝐺) Fn 𝐴)
41		fvco2 7019	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐻 ∘ 𝐹)‘𝑥) = (𝐻‘(𝐹‘𝑥)))
42	20, 41	sylan 579	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐻 ∘ 𝐹)‘𝑥) = (𝐻‘(𝐹‘𝑥)))
43		fvco2 7019	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐻 ∘ 𝐺)‘𝑥) = (𝐻‘(𝐺‘𝑥)))
44	21, 43	sylan 579	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐻 ∘ 𝐺)‘𝑥) = (𝐻‘(𝐺‘𝑥)))
45	38, 40, 22, 22, 23, 42, 44	offval 7723	. 2 ⊢ (𝜑 → ((𝐻 ∘ 𝐹) ∘f 𝑆(𝐻 ∘ 𝐺)) = (𝑥 ∈ 𝐴 ↦ ((𝐻‘(𝐹‘𝑥))𝑆(𝐻‘(𝐺‘𝑥)))))
46	19, 36, 45	3eqtr4d 2790	1 ⊢ (𝜑 → (𝐻 ∘ (𝐹 ∘f 𝑅𝐺)) = ((𝐻 ∘ 𝐹) ∘f 𝑆(𝐻 ∘ 𝐺)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067   ↦ cmpt 5249  ran crn 5701   ∘ ccom 5704   Fn wfn 6568  ⟶wf 6569  ‘cfv 6573  (class class class)co 7448   ∘_f cof 7712

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-of 7714

This theorem is referenced by:  rhmply1vsca  22413