Theorem cntzsubm 19380

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 19370	. . 3 ⊢ (𝑍‘𝑆) ⊆ 𝐵
4	3	a1i 11	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ⊆ 𝐵)
5		eqid 2764	. . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀)
6	1, 5	mndidcl 18785	. . . 4 ⊢ (𝑀 ∈ Mnd → (0g‘𝑀) ∈ 𝐵)
7	6	adantr 484	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (0g‘𝑀) ∈ 𝐵)
8		simpll 776	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → 𝑀 ∈ Mnd)
9		simpr 488	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → 𝑆 ⊆ 𝐵)
10	9	sselda 3938	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
11		eqid 2764	. . . . . . 7 ⊢ (+g‘𝑀) = (+g‘𝑀)
12	1, 11, 5	mndlid 18790	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → ((0g‘𝑀)(+g‘𝑀)𝑥) = 𝑥)
13	8, 10, 12	syl2anc 593	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → ((0g‘𝑀)(+g‘𝑀)𝑥) = 𝑥)
14	1, 11, 5	mndrid 18791	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵) → (𝑥(+g‘𝑀)(0g‘𝑀)) = 𝑥)
15	8, 10, 14	syl2anc 593	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → (𝑥(+g‘𝑀)(0g‘𝑀)) = 𝑥)
16	13, 15	eqtr4d 2802	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ 𝑥 ∈ 𝑆) → ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))
17	16	ralrimiva 3156	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))
18	1, 11, 2	elcntz 19364	. . . 4 ⊢ (𝑆 ⊆ 𝐵 → ((0g‘𝑀) ∈ (𝑍‘𝑆) ↔ ((0g‘𝑀) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))))
19	18	adantl 485	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ((0g‘𝑀) ∈ (𝑍‘𝑆) ↔ ((0g‘𝑀) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((0g‘𝑀)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(0g‘𝑀)))))
20	7, 17, 19	mpbir2and 723	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (0g‘𝑀) ∈ (𝑍‘𝑆))
21		simpll 776	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑀 ∈ Mnd)
22		simprl 780	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑦 ∈ (𝑍‘𝑆))
23	3, 22	sselid 3936	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑦 ∈ 𝐵)
24		simprr 782	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑧 ∈ (𝑍‘𝑆))
25	3, 24	sselid 3936	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → 𝑧 ∈ 𝐵)
26	1, 11	mndcl 18778	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝑦(+g‘𝑀)𝑧) ∈ 𝐵)
27	21, 23, 25, 26	syl3anc 1392	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → (𝑦(+g‘𝑀)𝑧) ∈ 𝐵)
28	21	adantr 484	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑀 ∈ Mnd)
29	23	adantr 484	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑦 ∈ 𝐵)
30	25	adantr 484	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑧 ∈ 𝐵)
31	10	adantlr 725	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
32	1, 11	mndass 18779	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)))
33	28, 29, 30, 31, 32	syl13anc 1393	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)))
34	11, 2	cntzi 19371	. . . . . . . . 9 ⊢ ((𝑧 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑧(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑧))
35	24, 34	sylan 589	. . . . . . . 8 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑧(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑧))
36	35	oveq2d 7414	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
37	1, 11	mndass 18779	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
38	28, 29, 31, 30, 37	syl13anc 1393	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = (𝑦(+g‘𝑀)(𝑥(+g‘𝑀)𝑧)))
39	11, 2	cntzi 19371	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
40	22, 39	sylan 589	. . . . . . . 8 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦))
41	40	oveq1d 7413	. . . . . . 7 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑥)(+g‘𝑀)𝑧) = ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧))
42	36, 38, 41	3eqtr2d 2805	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → (𝑦(+g‘𝑀)(𝑧(+g‘𝑀)𝑥)) = ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧))
43	1, 11	mndass 18779	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
44	28, 31, 29, 30, 43	syl13anc 1393	. . . . . 6 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑥(+g‘𝑀)𝑦)(+g‘𝑀)𝑧) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
45	33, 42, 44	3eqtrd 2803	. . . . 5 ⊢ ((((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) ∧ 𝑥 ∈ 𝑆) → ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
46	45	ralrimiva 3156	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))
47	1, 11, 2	elcntz 19364	. . . . 5 ⊢ (𝑆 ⊆ 𝐵 → ((𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆) ↔ ((𝑦(+g‘𝑀)𝑧) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))))
48	47	ad2antlr 737	. . . 4 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → ((𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆) ↔ ((𝑦(+g‘𝑀)𝑧) ∈ 𝐵 ∧ ∀𝑥 ∈ 𝑆 ((𝑦(+g‘𝑀)𝑧)(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)(𝑦(+g‘𝑀)𝑧)))))
49	27, 46, 48	mpbir2and 723	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) ∧ (𝑦 ∈ (𝑍‘𝑆) ∧ 𝑧 ∈ (𝑍‘𝑆))) → (𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))
50	49	ralrimivva 3207	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))
51	1, 5, 11	issubm 18839	. . 3 ⊢ (𝑀 ∈ Mnd → ((𝑍‘𝑆) ∈ (SubMnd‘𝑀) ↔ ((𝑍‘𝑆) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ (𝑍‘𝑆) ∧ ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))))
52	51	adantr 484	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → ((𝑍‘𝑆) ∈ (SubMnd‘𝑀) ↔ ((𝑍‘𝑆) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ (𝑍‘𝑆) ∧ ∀𝑦 ∈ (𝑍‘𝑆)∀𝑧 ∈ (𝑍‘𝑆)(𝑦(+g‘𝑀)𝑧) ∈ (𝑍‘𝑆))))
53	4, 20, 50, 52	mpbir3and 1357	1 ⊢ ((𝑀 ∈ Mnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ∈ (SubMnd‘𝑀))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  ∀wral 3078   ⊆ wss 3906  ‘cfv 6523  (class class class)co 7398  Basecbs 17247  +_gcplusg 17288  0_gc0g 17470  Mndcmnd 18770  SubMndcsubmnd 18818  Cntzccntz 19357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-0g 17472  df-mgm 18676  df-sgrp 18755  df-mnd 18771  df-submnd 18820  df-cntz 19359

This theorem is referenced by:  cntzsubg  19381  cntrcmnd  19884  cntzspan  19886  dprdfadd  20064  cntzsubr  20658