Theorem ghmpropd 19389

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 19081	. . . . 5 ⊢ (𝜑 → (𝐽 ∈ Grp ↔ 𝐿 ∈ Grp))
5		ghmpropd.b	. . . . . 6 ⊢ (𝜑 → 𝐶 = (Base‘𝐾))
6		ghmpropd.d	. . . . . 6 ⊢ (𝜑 → 𝐶 = (Base‘𝑀))
7		ghmpropd.f	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝑀)𝑦))
8	5, 6, 7	grppropd 19081	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ Grp ↔ 𝑀 ∈ Grp))
9	4, 8	anbi12d 644	. . . 4 ⊢ (𝜑 → ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ↔ (𝐿 ∈ Grp ∧ 𝑀 ∈ Grp)))
10	1, 5, 2, 6, 3, 7	mhmpropd 18906	. . . . 5 ⊢ (𝜑 → (𝐽 MndHom 𝐾) = (𝐿 MndHom 𝑀))
11	10	eleq2d 2848	. . . 4 ⊢ (𝜑 → (𝑓 ∈ (𝐽 MndHom 𝐾) ↔ 𝑓 ∈ (𝐿 MndHom 𝑀)))
12	9, 11	anbi12d 644	. . 3 ⊢ (𝜑 → (((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ∧ 𝑓 ∈ (𝐽 MndHom 𝐾)) ↔ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) ∧ 𝑓 ∈ (𝐿 MndHom 𝑀))))
13		ghmgrp1 19351	. . . . 5 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → 𝐽 ∈ Grp)
14		ghmgrp2 19352	. . . . 5 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → 𝐾 ∈ Grp)
15	13, 14	jca 521	. . . 4 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) → (𝐽 ∈ Grp ∧ 𝐾 ∈ Grp))
16		ghmmhmb 19360	. . . . 5 ⊢ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) → (𝐽 GrpHom 𝐾) = (𝐽 MndHom 𝐾))
17	16	eleq2d 2848	. . . 4 ⊢ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) → (𝑓 ∈ (𝐽 GrpHom 𝐾) ↔ 𝑓 ∈ (𝐽 MndHom 𝐾)))
18	15, 17	biadanii 834	. . 3 ⊢ (𝑓 ∈ (𝐽 GrpHom 𝐾) ↔ ((𝐽 ∈ Grp ∧ 𝐾 ∈ Grp) ∧ 𝑓 ∈ (𝐽 MndHom 𝐾)))
19		ghmgrp1 19351	. . . . 5 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → 𝐿 ∈ Grp)
20		ghmgrp2 19352	. . . . 5 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → 𝑀 ∈ Grp)
21	19, 20	jca 521	. . . 4 ⊢ (𝑓 ∈ (𝐿 GrpHom 𝑀) → (𝐿 ∈ Grp ∧ 𝑀 ∈ Grp))
22		ghmmhmb 19360	. . . . 5 ⊢ ((𝐿 ∈ Grp ∧ 𝑀 ∈ Grp) → (𝐿 GrpHom 𝑀) = (𝐿 MndHom 𝑀))
23	22	eleq2d 2848	. . . 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 2760	1 ⊢ (𝜑 → (𝐽 GrpHom 𝐾) = (𝐿 GrpHom 𝑀))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  +_gcplusg 17348   MndHom cmhm 18895  Grpcgrp 19063   GrpHom cghm 19346

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-map 8832  df-0g 17532  df-mgm 18736  df-sgrp 18827  df-mnd 18843  df-mhm 18897  df-grp 19066  df-ghm 19347

This theorem is used by:  rhmpropd  20777  lmhmpropd  21263  evls1maplmhm  22608