Theorem cntzsubm 19310

Description: Centralizers in a monoid are submonoids. (Contributed by Stefan O'Rear, 6-Sep-2015.) (Revised by Mario Carneiro, 19-Apr-2016.)

Hypotheses

Ref	Expression
cntzrec.b	⊢ 𝐵 = (Base‘𝑀)
cntzrec.z	⊢ 𝑍 = (Cntz‘𝑀)

Assertion

Ref	Expression
cntzsubm	⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ∈ (SubMnd‘𝑀))

Proof of Theorem cntzsubm

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

Step	Hyp	Ref	Expression
1		cntzrec.b	. . . 4 ⊢ 𝐵 = (Base‘𝑀)
2		cntzrec.z	. . . 4 ⊢ 𝑍 = (Cntz‘𝑀)
3	1, 2	cntzssv 19300	. . 3 ⊢ (𝑍‘𝑆) ⊆ 𝐵
4	3	a1i 11	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ⊆ 𝐵)
5		eqid 2737	. . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀)
6	1, 5	mndidcl 18714	. . . 4 ⊢ (𝑀 ∈ Mnd → (0g‘𝑀) ∈ 𝐵)
7	6	adantr 480	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (0g‘𝑀) ∈ 𝐵)
8		simpll 767	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → 𝑀 ∈ Mnd)
9		simpr 484	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → 𝑆 ⊆ 𝐵)
10	9	sselda 3922	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
11		eqid 2737	. . . . . . 7 ⊢ (+g‘𝑀) = (+g‘𝑀)
12	1, 11, 5	mndlid 18719	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ((0g‘𝑀)(+g‘𝑀)𝑥) = 𝑥)
13	8, 10, 12	syl2anc 585	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → ((0g‘𝑀)(+g‘𝑀)𝑥) = 𝑥)
14	1, 11, 5	mndrid 18720	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝑀)(0g‘𝑀)) = 𝑥)
15	8, 10, 14	syl2anc 585	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → (𝑥(+g‘𝑀)(0g‘𝑀)) = 𝑥)
16	13, 15	eqtr4d 2775	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))
17	16	ralrimiva 3130	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))
18	1, 11, 2	elcntz 19294	. . . 4 ⊢ (𝑆 ⊆ 𝐵 → ((0g‘𝑀) ∈ (𝑍‘𝑆) ↔ ((0g‘𝑀) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))))
19	18	adantl 481	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ((0g‘𝑀) ∈ (𝑍‘𝑆) ↔ ((0g‘𝑀) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))))
20	7, 17, 19	mpbir2and 714	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (0g‘𝑀) ∈ (𝑍‘𝑆))
21		simpll 767	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑀 ∈ Mnd)
22		simprl 771	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑦 ∈ (𝑍‘𝑆))
23	3, 22	sselid 3920	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑦 ∈ 𝐵)
24		simprr 773	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑧 ∈ (𝑍‘𝑆))
25	3, 24	sselid 3920	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑧 ∈ 𝐵)
26	1, 11	mndcl 18707	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+g‘𝑀)𝑧) ∈ 𝐵)
27	21, 23, 25, 26	syl3anc 1374	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → (𝑦(+g‘𝑀)𝑧) ∈ 𝐵)
28	21	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑀 ∈ Mnd)
29	23	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑦 ∈ 𝐵)
30	25	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑧 ∈ 𝐵)
31	10	adantlr 716	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
32	1, 11	mndass 18708	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)))
33	28, 29, 30, 31, 32	syl13anc 1375	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)))
34	11, 2	cntzi 19301	. . . . . . . . 9 ⊢ ((𝑧 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑧(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑧))
35	24, 34	sylan 581	. . . . . . . 8 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑧(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑧))
36	35	oveq2d 7380	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
37	1, 11	mndass 18708	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
38	28, 29, 31, 30, 37	syl13anc 1375	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
39	11, 2	cntzi 19301	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
40	22, 39	sylan 581	. . . . . . . 8 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
41	40	oveq1d 7379	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧))
42	36, 38, 41	3eqtr2d 2778	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)) = ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧))
43	1, 11	mndass 18708	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
44	28, 31, 29, 30, 43	syl13anc 1375	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
45	33, 42, 44	3eqtrd 2776	. . . . 5 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
46	45	ralrimiva 3130	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
47	1, 11, 2	elcntz 19294	. . . . 5 ⊢ (𝑆 ⊆ 𝐵 → ((𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆) ↔ ((𝑦(+g‘𝑀)𝑧) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))))
48	47	ad2antlr 728	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → ((𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆) ↔ ((𝑦(+g‘𝑀)𝑧) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))))
49	27, 46, 48	mpbir2and 714	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → (𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))
50	49	ralrimivva 3181	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))
51	1, 5, 11	issubm 18768	. . 3 ⊢ (𝑀 ∈ Mnd → ((𝑍‘𝑆) ∈ (SubMnd‘𝑀) ↔ ((𝑍‘𝑆) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ (𝑍‘𝑆) ∧ ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))))
52	51	adantr 480	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ((𝑍‘𝑆) ∈ (SubMnd‘𝑀) ↔ ((𝑍‘𝑆) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ (𝑍‘𝑆) ∧ ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))))
53	4, 20, 50, 52	mpbir3and 1344	1 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ∈ (SubMnd‘𝑀))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3890  ‘cfv 6496  (class class class)co 7364  Basecbs 17176  +_gcplusg 17217  0_gc0g 17399  Mndcmnd 18699  SubMndcsubmnd 18747  Cntzccntz 19287

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5306  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5523  df-xp 5634  df-rel 5635  df-cnv 5636  df-co 5637  df-dm 5638  df-rn 5639  df-res 5640  df-ima 5641  df-iota 6452  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7321  df-ov 7367  df-0g 17401  df-mgm 18605  df-sgrp 18684  df-mnd 18700  df-submnd 18749  df-cntz 19289

This theorem is referenced by:  cntzsubg  19311  cntrcmnd  19814  cntzspan  19816  dprdfadd  19994  cntzsubr  20580