Theorem conjnmzb 13353

Description: Alternative condition for elementhood in the normalizer. (Contributed by Mario Carneiro, 18-Jan-2015.)

Hypotheses

Ref	Expression
conjghm.x	⊢ 𝑋 = (Base‘𝐺)
conjghm.p	⊢ + = (+g‘𝐺)
conjghm.m	⊢ − = (-g‘𝐺)
conjsubg.f	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
conjnmz.1	⊢ 𝑁 = {𝑦 ∈ 𝑋 ∣ ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}

Assertion

Ref	Expression
conjnmzb	⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐴 ∈ 𝑁 ↔ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)))

Distinct variable groups:   𝑥,𝑦, −   𝑥,𝑧, + ,𝑦   𝑥,𝐴,𝑦,𝑧   𝑦,𝐹,𝑧   𝑥,𝑁   𝑥,𝐺,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧

Allowed substitution hints:   𝐹(𝑥)   − (𝑧)   𝑁(𝑦,𝑧)

Proof of Theorem conjnmzb

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		conjnmz.1	. . . . 5 ⊢ 𝑁 = {𝑦 ∈ 𝑋 ∣ ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}
2	1	ssrab3 3266	. . . 4 ⊢ 𝑁 ⊆ 𝑋
3		simpr 110	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝐴 ∈ 𝑁)
4	2, 3	sselid 3178	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝐴 ∈ 𝑋)
5		conjghm.x	. . . 4 ⊢ 𝑋 = (Base‘𝐺)
6		conjghm.p	. . . 4 ⊢ + = (+g‘𝐺)
7		conjghm.m	. . . 4 ⊢ − = (-g‘𝐺)
8		conjsubg.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
9	5, 6, 7, 8, 1	conjnmz 13352	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝑆 = ran 𝐹)
10	4, 9	jca 306	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹))
11		simprl 529	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) → 𝐴 ∈ 𝑋)
12		simplrr 536	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → 𝑆 = ran 𝐹)
13	12	eleq2d 2263	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → ((𝐴 + 𝑤) ∈ 𝑆 ↔ (𝐴 + 𝑤) ∈ ran 𝐹))
14		subgrcl 13252	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
15	14	ad3antrrr 492	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ Grp)
16		simpllr 534	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑋)
17	5	subgss 13247	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝑋)
18	17	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
19	18	sselda 3180	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
20	5, 6, 7	grpaddsubass 13165	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝐴 + 𝑥) − 𝐴) = (𝐴 + (𝑥 − 𝐴)))
21	15, 16, 19, 16, 20	syl13anc 1251	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + 𝑥) − 𝐴) = (𝐴 + (𝑥 − 𝐴)))
22	21	eqeq1d 2202	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → (((𝐴 + 𝑥) − 𝐴) = (𝐴 + 𝑤) ↔ (𝐴 + (𝑥 − 𝐴)) = (𝐴 + 𝑤)))
23	5, 7	grpsubcl 13155	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑥 − 𝐴) ∈ 𝑋)
24	15, 19, 16, 23	syl3anc 1249	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → (𝑥 − 𝐴) ∈ 𝑋)
25		simplr 528	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → 𝑤 ∈ 𝑋)
26	5, 6	grplcan 13137	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ ((𝑥 − 𝐴) ∈ 𝑋 ∧ 𝑤 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝐴 + (𝑥 − 𝐴)) = (𝐴 + 𝑤) ↔ (𝑥 − 𝐴) = 𝑤))
27	15, 24, 25, 16, 26	syl13anc 1251	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + (𝑥 − 𝐴)) = (𝐴 + 𝑤) ↔ (𝑥 − 𝐴) = 𝑤))
28	5, 6, 7	grpsubadd 13163	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝑥 − 𝐴) = 𝑤 ↔ (𝑤 + 𝐴) = 𝑥))
29	15, 19, 16, 25, 28	syl13anc 1251	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → ((𝑥 − 𝐴) = 𝑤 ↔ (𝑤 + 𝐴) = 𝑥))
30	22, 27, 29	3bitrd 214	. . . . . . . . 9 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → (((𝐴 + 𝑥) − 𝐴) = (𝐴 + 𝑤) ↔ (𝑤 + 𝐴) = 𝑥))
31		eqcom 2195	. . . . . . . . 9 ⊢ ((𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴) ↔ ((𝐴 + 𝑥) − 𝐴) = (𝐴 + 𝑤))
32		eqcom 2195	. . . . . . . . 9 ⊢ (𝑥 = (𝑤 + 𝐴) ↔ (𝑤 + 𝐴) = 𝑥)
33	30, 31, 32	3bitr4g 223	. . . . . . . 8 ⊢ ((((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴) ↔ 𝑥 = (𝑤 + 𝐴)))
34	33	rexbidva 2491	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) → (∃𝑥 ∈ 𝑆 (𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴) ↔ ∃𝑥 ∈ 𝑆 𝑥 = (𝑤 + 𝐴)))
35	34	adantlrr 483	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → (∃𝑥 ∈ 𝑆 (𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴) ↔ ∃𝑥 ∈ 𝑆 𝑥 = (𝑤 + 𝐴)))
36	14	ad2antrr 488	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → 𝐺 ∈ Grp)
37		simplrl 535	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → 𝐴 ∈ 𝑋)
38		simpr 110	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → 𝑤 ∈ 𝑋)
39	5, 6, 36, 37, 38	grpcld 13089	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → (𝐴 + 𝑤) ∈ 𝑋)
40	8	elrnmpt 4912	. . . . . . 7 ⊢ ((𝐴 + 𝑤) ∈ 𝑋 → ((𝐴 + 𝑤) ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑆 (𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴)))
41	39, 40	syl 14	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → ((𝐴 + 𝑤) ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑆 (𝐴 + 𝑤) = ((𝐴 + 𝑥) − 𝐴)))
42		risset 2522	. . . . . . 7 ⊢ ((𝑤 + 𝐴) ∈ 𝑆 ↔ ∃𝑥 ∈ 𝑆 𝑥 = (𝑤 + 𝐴))
43	42	a1i 9	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → ((𝑤 + 𝐴) ∈ 𝑆 ↔ ∃𝑥 ∈ 𝑆 𝑥 = (𝑤 + 𝐴)))
44	35, 41, 43	3bitr4d 220	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → ((𝐴 + 𝑤) ∈ ran 𝐹 ↔ (𝑤 + 𝐴) ∈ 𝑆))
45	13, 44	bitrd 188	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) ∧ 𝑤 ∈ 𝑋) → ((𝐴 + 𝑤) ∈ 𝑆 ↔ (𝑤 + 𝐴) ∈ 𝑆))
46	45	ralrimiva 2567	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) → ∀𝑤 ∈ 𝑋 ((𝐴 + 𝑤) ∈ 𝑆 ↔ (𝑤 + 𝐴) ∈ 𝑆))
47	1	elnmz 13281	. . 3 ⊢ (𝐴 ∈ 𝑁 ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑤 ∈ 𝑋 ((𝐴 + 𝑤) ∈ 𝑆 ↔ (𝑤 + 𝐴) ∈ 𝑆)))
48	11, 46, 47	sylanbrc 417	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)) → 𝐴 ∈ 𝑁)
49	10, 48	impbida 596	1 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐴 ∈ 𝑁 ↔ (𝐴 ∈ 𝑋 ∧ 𝑆 = ran 𝐹)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2164  ∀wral 2472  ∃wrex 2473  {crab 2476   ⊆ wss 3154   ↦ cmpt 4091  ran crn 4661  ‘cfv 5255  (class class class)co 5919  Basecbs 12621  +_gcplusg 12698  Grpcgrp 13075  -_gcsg 13077  SubGrpcsubg 13240

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-inn 8985  df-2 9043  df-ndx 12624  df-slot 12625  df-base 12627  df-plusg 12711  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-grp 13078  df-minusg 13079  df-sbg 13080  df-subg 13243

This theorem is referenced by: (None)