Theorem ghmpropd 19520

Description: Group homomorphism depends only on the group attributes of structures. (Contributed by Mario Carneiro, 12-Jun-2015.)

Hypotheses

Ref	Expression
ghmpropd.a	⊢ (𝜑 → 𝐵 = (Base‘𝐽))
ghmpropd.b	⊢ (𝜑 → 𝐶 = (Base‘𝐾))
ghmpropd.c	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
ghmpropd.d	⊢ (𝜑 → 𝐶 = (Base‘𝑀))
ghmpropd.e	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐽)𝑦) = (𝑥(+g‘𝐿)𝑦))
ghmpropd.f	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝑀)𝑦))

Assertion

Ref	Expression
ghmpropd	⊢ (𝜑 → (𝐽 GrpHom 𝐾) = (𝐿 GrpHom 𝑀))

Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝑥,𝑀,𝑦   𝜑,𝑥,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem ghmpropd

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ghmpropd.a	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐽))
2		ghmpropd.c	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3		ghmpropd.e	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐽)𝑦) = (𝑥(+g‘𝐿)𝑦))
4	1, 2, 3	grppropd 19212	. . . . 5 ⊢ (𝜑 → (𝐽 ∈ Grp ↔ 𝐿 ∈ Grp))
5		ghmpropd.b	. . . . . 6 ⊢ (𝜑 → 𝐶 = (Base‘𝐾))
6		ghmpropd.d	. . . . . 6 ⊢ (𝜑 → 𝐶 = (Base‘𝑀))
7		ghmpropd.f	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝑀)𝑦))
8	5, 6, 7	grppropd 19212	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ Grp ↔ 𝑀 ∈ Grp))
9	4, 8	anbi12d 644	. . . 4 ⊢ (𝜑 → ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ↔ (𝐿 ∈ Grp ∧ 𝑀 ∈ Grp)))
10	1, 5, 2, 6, 3, 7	mhmpropd 19037	. . . . 5 ⊢ (𝜑 → (𝐽 MndHom 𝐾) = (𝐿 MndHom 𝑀))
11	10	eleq2d 2850	. . . 4 ⊢ (𝜑 → (𝑓 ∈ (𝐽 MndHom 𝐾) ↔ 𝑓 ∈ (𝐿 MndHom 𝑀)))
12	9, 11	anbi12d 644	. . 3 ⊢ (𝜑 → (((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ∧ 𝑓 ∈ (𝐽 MndHom 𝐾)) ↔ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) ∧ 𝑓 ∈ (𝐿 MndHom 𝑀))))
13		ghmgrp1 19482	. . . . 5 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → 𝐽 ∈ Grp)
14		ghmgrp2 19483	. . . . 5 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → 𝐾 ∈ Grp)
15	13, 14	jca 521	. . . 4 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → (𝐽 ∈ Grp ∧ 𝐾 ∈ Grp))
16		ghmmhmb 19491	. . . . 5 ⊢ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) → (𝐽 GrpHom 𝐾) = (𝐽 MndHom 𝐾))
17	16	eleq2d 2850	. . . 4 ⊢ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) → (𝑓 ∈ (𝐽 GrpHom 𝐾) ↔ 𝑓 ∈ (𝐽 MndHom 𝐾)))
18	15, 17	biadanii 834	. . 3 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) ↔ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ∧ 𝑓 ∈ (𝐽 MndHom 𝐾)))
19		ghmgrp1 19482	. . . . 5 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → 𝐿 ∈ Grp)
20		ghmgrp2 19483	. . . . 5 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → 𝑀 ∈ Grp)
21	19, 20	jca 521	. . . 4 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → (𝐿 ∈ Grp ∧ 𝑀 ∈ Grp))
22		ghmmhmb 19491	. . . . 5 ⊢ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) → (𝐿 GrpHom 𝑀) = (𝐿 MndHom 𝑀))
23	22	eleq2d 2850	. . . 4 ⊢ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) → (𝑓 ∈ (𝐿 GrpHom 𝑀) ↔ 𝑓 ∈ (𝐿 MndHom 𝑀)))
24	21, 23	biadanii 834	. . 3 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) ↔ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) ∧ 𝑓 ∈ (𝐿 MndHom 𝑀)))
25	12, 18, 24	3bitr4g 317	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝐽 GrpHom 𝐾) ↔ 𝑓 ∈ (𝐿 GrpHom 𝑀)))
26	25	eqrdv 2761	1 ⊢ (𝜑 → (𝐽 GrpHom 𝐾) = (𝐿 GrpHom 𝑀))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +_gcplusg 17472   MndHom cmhm 19026  Grpcgrp 19194   GrpHom cghm 19477

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-mhm 19028  df-grp 19197  df-ghm 19478

This theorem is used by:  rhmpropd  20912  lmhmpropd  21399  evls1maplmhm  22750  grpgimcanon  46192