Theorem ismgmhm 45348

Description: Property of a magma homomorphism. (Contributed by AV, 25-Feb-2020.)

Hypotheses

Ref	Expression
ismgmhm.b	⊢ 𝐵 = (Base‘𝑆)
ismgmhm.c	⊢ 𝐶 = (Base‘𝑇)
ismgmhm.p	⊢ + = (+g‘𝑆)
ismgmhm.q	⊢ ⨣ = (+g‘𝑇)

Assertion

Ref	Expression
ismgmhm	⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶𝐶 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝑥,𝐹,𝑦

Allowed substitution hints:   𝐶(𝑥,𝑦)   + (𝑥,𝑦)   ⨣ (𝑥,𝑦)

Proof of Theorem ismgmhm

Dummy variables 𝑓 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mgmhmrcl 45346	. 2 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → (𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm))
2		fveq2 6783	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = (Base‘𝑇))
3		ismgmhm.c	. . . . . . . 8 ⊢ 𝐶 = (Base‘𝑇)
4	2, 3	eqtr4di 2797	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (Base‘𝑡) = 𝐶)
5		fveq2 6783	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
6		ismgmhm.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑆)
7	5, 6	eqtr4di 2797	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (Base‘𝑠) = 𝐵)
8	4, 7	oveqan12rd 7304	. . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ((Base‘𝑡) ↑m (Base‘𝑠)) = (𝐶 ↑m 𝐵))
9	7	adantr 481	. . . . . . 7 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (Base‘𝑠) = 𝐵)
10		fveq2 6783	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = (+g‘𝑆))
11		ismgmhm.p	. . . . . . . . . . . 12 ⊢ + = (+g‘𝑆)
12	10, 11	eqtr4di 2797	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑆 → (+g‘𝑠) = + )
13	12	oveqd 7301	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (𝑥(+g‘𝑠)𝑦) = (𝑥 + 𝑦))
14	13	fveq2d 6787	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (𝑓‘(𝑥(+g‘𝑠)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
15		fveq2 6783	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = (+g‘𝑇))
16		ismgmhm.q	. . . . . . . . . . 11 ⊢ ⨣ = (+g‘𝑇)
17	15, 16	eqtr4di 2797	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (+g‘𝑡) = ⨣ )
18	17	oveqd 7301	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦)))
19	14, 18	eqeqan12d 2753	. . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ((𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))))
20	9, 19	raleqbidv 3337	. . . . . . 7 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))))
21	9, 20	raleqbidv 3337	. . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))))
22	8, 21	rabeqbidv 3421	. . . . 5 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → {𝑓 ∈ ((Base‘𝑡) ↑m (Base‘𝑠)) ∣ ∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦))} = {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))})
23		df-mgmhm 45344	. . . . 5 ⊢ MgmHom = (𝑠 ∈ Mgm, 𝑡 ∈ Mgm ↦ {𝑓 ∈ ((Base‘𝑡) ↑m (Base‘𝑠)) ∣ ∀𝑥 ∈ (Base‘𝑠)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥(+g‘𝑠)𝑦)) = ((𝑓‘𝑥)(+g‘𝑡)(𝑓‘𝑦))})
24		ovex 7317	. . . . . 6 ⊢ (𝐶 ↑m 𝐵) ∈ V
25	24	rabex 5257	. . . . 5 ⊢ {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))} ∈ V
26	22, 23, 25	ovmpoa 7437	. . . 4 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) → (𝑆 MgmHom 𝑇) = {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))})
27	26	eleq2d 2825	. . 3 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) → (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))}))
28		fveq1 6782	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 + 𝑦)) = (𝐹‘(𝑥 + 𝑦)))
29		fveq1 6782	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
30		fveq1 6782	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
31	29, 30	oveq12d 7302	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ⨣ (𝑓‘𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))
32	28, 31	eqeq12d 2755	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))
33	32	2ralbidv 3130	. . . . 5 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))
34	33	elrab 3625	. . . 4 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))} ↔ (𝐹 ∈ (𝐶 ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))
35	3	fvexi 6797	. . . . . 6 ⊢ 𝐶 ∈ V
36	6	fvexi 6797	. . . . . 6 ⊢ 𝐵 ∈ V
37	35, 36	elmap 8668	. . . . 5 ⊢ (𝐹 ∈ (𝐶 ↑m 𝐵) ↔ 𝐹:𝐵⟶𝐶)
38	37	anbi1i 624	. . . 4 ⊢ ((𝐹 ∈ (𝐶 ↑m 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) ↔ (𝐹:𝐵⟶𝐶 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))
39	34, 38	bitri 274	. . 3 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐶 ↑m 𝐵) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑓‘(𝑥 + 𝑦)) = ((𝑓‘𝑥) ⨣ (𝑓‘𝑦))} ↔ (𝐹:𝐵⟶𝐶 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))
40	27, 39	bitrdi 287	. 2 ⊢ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) → (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ (𝐹:𝐵⟶𝐶 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))))
41	1, 40	biadanii 819	1 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶𝐶 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))))

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2107  ∀wral 3065  {crab 3069  ⟶wf 6433  ‘cfv 6437  (class class class)co 7284   ↑_m cmap 8624  Basecbs 16921  +_gcplusg 16971  Mgmcmgm 18333   MgmHom cmgmhm 45342

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2710  ax-sep 5224  ax-nul 5231  ax-pow 5289  ax-pr 5353  ax-un 7597

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3435  df-sbc 3718  df-dif 3891  df-un 3893  df-in 3895  df-ss 3905  df-nul 4258  df-if 4461  df-pw 4536  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4841  df-br 5076  df-opab 5138  df-id 5490  df-xp 5596  df-rel 5597  df-cnv 5598  df-co 5599  df-dm 5600  df-rn 5601  df-iota 6395  df-fun 6439  df-fn 6440  df-f 6441  df-fv 6445  df-ov 7287  df-oprab 7288  df-mpo 7289  df-map 8626  df-mgmhm 45344

This theorem is referenced by:  mgmhmf  45349  mgmhmpropd  45350  mgmhmlin  45351  mgmhmf1o  45352  idmgmhm  45353  resmgmhm  45363  resmgmhm2  45364  resmgmhm2b  45365  mgmhmco  45366  ismhm0  45370  mhmismgmhm  45371  isrnghmmul  45462  c0mgm  45478  c0snmgmhm  45483