Theorem ghmf1 13684

Description: Two ways of saying a group homomorphism is 1-1 into its codomain. (Contributed by Paul Chapman, 3-Mar-2008.) (Revised by Mario Carneiro, 13-Jan-2015.) (Proof shortened by AV, 4-Apr-2025.)

Hypotheses

Ref	Expression
f1ghm0to0.a	⊢ 𝐴 = (Base‘𝑅)
f1ghm0to0.b	⊢ 𝐵 = (Base‘𝑆)
f1ghm0to0.n	⊢ 𝑁 = (0g‘𝑅)
f1ghm0to0.0	⊢ 0 = (0g‘𝑆)

Assertion

Ref	Expression
ghmf1	⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹:𝐴–1-1→𝐵 ↔ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)))

Distinct variable groups:   𝑥, 0   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝑁   𝑥,𝑅   𝑥,𝑆

Proof of Theorem ghmf1

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1ghm0to0.a	. . . . . 6 ⊢ 𝐴 = (Base‘𝑅)
2		f1ghm0to0.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
3		f1ghm0to0.n	. . . . . 6 ⊢ 𝑁 = (0g‘𝑅)
4		f1ghm0to0.0	. . . . . 6 ⊢ 0 = (0g‘𝑆)
5	1, 2, 3, 4	f1ghm0to0 13683	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 0 ↔ 𝑥 = 𝑁))
6	5	3expa 1206	. . . 4 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 0 ↔ 𝑥 = 𝑁))
7	6	biimpd 144	. . 3 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁))
8	7	ralrimiva 2580	. 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐴–1-1→𝐵) → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁))
9	1, 2	ghmf 13658	. . . 4 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝐹:𝐴⟶𝐵)
10	9	adantr 276	. . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) → 𝐹:𝐴⟶𝐵)
11		eqid 2206	. . . . . . . . . 10 ⊢ (-g‘𝑅) = (-g‘𝑅)
12		eqid 2206	. . . . . . . . . 10 ⊢ (-g‘𝑆) = (-g‘𝑆)
13	1, 11, 12	ghmsub 13662	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘(𝑦(-g‘𝑅)𝑧)) = ((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)))
14	13	3expb 1207	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝐹‘(𝑦(-g‘𝑅)𝑧)) = ((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)))
15	14	adantlr 477	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝐹‘(𝑦(-g‘𝑅)𝑧)) = ((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)))
16	15	eqeq1d 2215	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝐹‘(𝑦(-g‘𝑅)𝑧)) = 0 ↔ ((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)) = 0 ))
17		fveqeq2 5598	. . . . . . . 8 ⊢ (𝑥 = (𝑦(-g‘𝑅)𝑧) → ((𝐹‘𝑥) = 0 ↔ (𝐹‘(𝑦(-g‘𝑅)𝑧)) = 0 ))
18		eqeq1 2213	. . . . . . . 8 ⊢ (𝑥 = (𝑦(-g‘𝑅)𝑧) → (𝑥 = 𝑁 ↔ (𝑦(-g‘𝑅)𝑧) = 𝑁))
19	17, 18	imbi12d 234	. . . . . . 7 ⊢ (𝑥 = (𝑦(-g‘𝑅)𝑧) → (((𝐹‘𝑥) = 0 → 𝑥 = 𝑁) ↔ ((𝐹‘(𝑦(-g‘𝑅)𝑧)) = 0 → (𝑦(-g‘𝑅)𝑧) = 𝑁)))
20		simplr 528	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁))
21		ghmgrp1 13656	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
22	21	adantr 276	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) → 𝑅 ∈ Grp)
23	1, 11	grpsubcl 13487	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑦(-g‘𝑅)𝑧) ∈ 𝐴)
24	23	3expb 1207	. . . . . . . 8 ⊢ ((𝑅 ∈ Grp ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦(-g‘𝑅)𝑧) ∈ 𝐴)
25	22, 24	sylan 283	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦(-g‘𝑅)𝑧) ∈ 𝐴)
26	19, 20, 25	rspcdva 2886	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝐹‘(𝑦(-g‘𝑅)𝑧)) = 0 → (𝑦(-g‘𝑅)𝑧) = 𝑁))
27	16, 26	sylbird 170	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)) = 0 → (𝑦(-g‘𝑅)𝑧) = 𝑁))
28		ghmgrp2 13657	. . . . . . 7 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑆 ∈ Grp)
29	28	ad2antrr 488	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → 𝑆 ∈ Grp)
30	9	ad2antrr 488	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → 𝐹:𝐴⟶𝐵)
31		simprl 529	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → 𝑦 ∈ 𝐴)
32	30, 31	ffvelcdmd 5729	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝐹‘𝑦) ∈ 𝐵)
33		simprr 531	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → 𝑧 ∈ 𝐴)
34	30, 33	ffvelcdmd 5729	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝐹‘𝑧) ∈ 𝐵)
35	2, 4, 12	grpsubeq0 13493	. . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ (𝐹‘𝑦) ∈ 𝐵 ∧ (𝐹‘𝑧) ∈ 𝐵) → (((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)) = 0 ↔ (𝐹‘𝑦) = (𝐹‘𝑧)))
36	29, 32, 34, 35	syl3anc 1250	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (((𝐹‘𝑦)(-g‘𝑆)(𝐹‘𝑧)) = 0 ↔ (𝐹‘𝑦) = (𝐹‘𝑧)))
37	21	ad2antrr 488	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → 𝑅 ∈ Grp)
38	1, 3, 11	grpsubeq0 13493	. . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑦(-g‘𝑅)𝑧) = 𝑁 ↔ 𝑦 = 𝑧))
39	37, 31, 33, 38	syl3anc 1250	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑦(-g‘𝑅)𝑧) = 𝑁 ↔ 𝑦 = 𝑧))
40	27, 36, 39	3imtr3d 202	. . . 4 ⊢ (((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
41	40	ralrimivva 2589	. . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
42		dff13 5850	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)))
43	10, 41, 42	sylanbrc 417	. 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)) → 𝐹:𝐴–1-1→𝐵)
44	8, 43	impbida 596	1 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝐹:𝐴–1-1→𝐵 ↔ ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 0 → 𝑥 = 𝑁)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2177  ∀wral 2485  ⟶wf 5276  –1-1→wf1 5277  ‘cfv 5280  (class class class)co 5957  Basecbs 12907  0_gc0g 13163  Grpcgrp 13407  -_gcsg 13409   GrpHom cghm 13651

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4167  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1re 8039  ax-addrcl 8042

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-inn 9057  df-2 9115  df-ndx 12910  df-slot 12911  df-base 12913  df-plusg 12997  df-0g 13165  df-mgm 13263  df-sgrp 13309  df-mnd 13324  df-grp 13410  df-minusg 13411  df-sbg 13412  df-ghm 13652

This theorem is referenced by: (None)