Theorem frmdss2 18737

Description: A subset of generators is contained in a submonoid iff the set of words on the generators is in the submonoid. This can be viewed as an elementary way of saying "the monoidal closure of 𝐽 is Word 𝐽". (Contributed by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
frmdmnd.m	⊢ 𝑀 = (freeMnd‘𝐼)
frmdgsum.u	⊢ 𝑈 = (varFMnd‘𝐼)

Assertion

Ref	Expression
frmdss2	⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → ((𝑈 “ 𝐽) ⊆ 𝐴 ↔ Word 𝐽 ⊆ 𝐴))

Proof of Theorem frmdss2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1192	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝐼 ∈ 𝑉)
2		simpl2 1193	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝐽 ⊆ 𝐼)
3		sswrd 14429	. . . . . . . . 9 ⊢ (𝐽 ⊆ 𝐼 → Word 𝐽 ⊆ Word 𝐼)
4	2, 3	syl 17	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → Word 𝐽 ⊆ Word 𝐼)
5		simprr 772	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝑥 ∈ Word 𝐽)
6	4, 5	sseldd 3936	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝑥 ∈ Word 𝐼)
7		frmdmnd.m	. . . . . . . 8 ⊢ 𝑀 = (freeMnd‘𝐼)
8		frmdgsum.u	. . . . . . . 8 ⊢ 𝑈 = (varFMnd‘𝐼)
9	7, 8	frmdgsum 18736	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word 𝐼) → (𝑀 Σg (𝑈 ∘ 𝑥)) = 𝑥)
10	1, 6, 9	syl2anc 584	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑀 Σg (𝑈 ∘ 𝑥)) = 𝑥)
11		simpl3 1194	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝐴 ∈ (SubMnd‘𝑀))
12		wrdf 14425	. . . . . . . . . . 11 ⊢ (𝑥 ∈ Word 𝐽 → 𝑥:(0..^(♯‘𝑥))⟶𝐽)
13	12	ad2antll 729	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝑥:(0..^(♯‘𝑥))⟶𝐽)
14	13	frnd 6660	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → ran 𝑥 ⊆ 𝐽)
15		cores 6198	. . . . . . . . 9 ⊢ (ran 𝑥 ⊆ 𝐽 → ((𝑈 ↾ 𝐽) ∘ 𝑥) = (𝑈 ∘ 𝑥))
16	14, 15	syl 17	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → ((𝑈 ↾ 𝐽) ∘ 𝑥) = (𝑈 ∘ 𝑥))
17	8	vrmdf 18732	. . . . . . . . . . . . 13 ⊢ (𝐼 ∈ 𝑉 → 𝑈:𝐼⟶Word 𝐼)
18	17	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → 𝑈:𝐼⟶Word 𝐼)
19	18	ffnd 6653	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → 𝑈 Fn 𝐼)
20		fnssres 6605	. . . . . . . . . . 11 ⊢ ((𝑈 Fn 𝐼 ∧ 𝐽 ⊆ 𝐼) → (𝑈 ↾ 𝐽) Fn 𝐽)
21	19, 2, 20	syl2an2r 685	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑈 ↾ 𝐽) Fn 𝐽)
22		df-ima 5632	. . . . . . . . . . 11 ⊢ (𝑈 “ 𝐽) = ran (𝑈 ↾ 𝐽)
23		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑈 “ 𝐽) ⊆ 𝐴)
24	22, 23	eqsstrrid 3975	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → ran (𝑈 ↾ 𝐽) ⊆ 𝐴)
25		df-f 6486	. . . . . . . . . 10 ⊢ ((𝑈 ↾ 𝐽):𝐽⟶𝐴 ↔ ((𝑈 ↾ 𝐽) Fn 𝐽 ∧ ran (𝑈 ↾ 𝐽) ⊆ 𝐴))
26	21, 24, 25	sylanbrc 583	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑈 ↾ 𝐽):𝐽⟶𝐴)
27		wrdco 14738	. . . . . . . . 9 ⊢ ((𝑥 ∈ Word 𝐽 ∧ (𝑈 ↾ 𝐽):𝐽⟶𝐴) → ((𝑈 ↾ 𝐽) ∘ 𝑥) ∈ Word 𝐴)
28	5, 26, 27	syl2anc 584	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → ((𝑈 ↾ 𝐽) ∘ 𝑥) ∈ Word 𝐴)
29	16, 28	eqeltrrd 2829	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑈 ∘ 𝑥) ∈ Word 𝐴)
30		gsumwsubmcl 18711	. . . . . . 7 ⊢ ((𝐴 ∈ (SubMnd‘𝑀) ∧ (𝑈 ∘ 𝑥) ∈ Word 𝐴) → (𝑀 Σg (𝑈 ∘ 𝑥)) ∈ 𝐴)
31	11, 29, 30	syl2anc 584	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → (𝑀 Σg (𝑈 ∘ 𝑥)) ∈ 𝐴)
32	10, 31	eqeltrrd 2829	. . . . 5 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ ((𝑈 “ 𝐽) ⊆ 𝐴 ∧ 𝑥 ∈ Word 𝐽)) → 𝑥 ∈ 𝐴)
33	32	expr 456	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ (𝑈 “ 𝐽) ⊆ 𝐴) → (𝑥 ∈ Word 𝐽 → 𝑥 ∈ 𝐴))
34	33	ssrdv 3941	. . 3 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ (𝑈 “ 𝐽) ⊆ 𝐴) → Word 𝐽 ⊆ 𝐴)
35	34	ex 412	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → ((𝑈 “ 𝐽) ⊆ 𝐴 → Word 𝐽 ⊆ 𝐴))
36		simpl1 1192	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → 𝐼 ∈ 𝑉)
37		simp2 1137	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → 𝐽 ⊆ 𝐼)
38	37	sselda 3935	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → 𝑥 ∈ 𝐼)
39	8	vrmdval 18731	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ 𝐼) → (𝑈‘𝑥) = ⟨“𝑥”⟩)
40	36, 38, 39	syl2anc 584	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → (𝑈‘𝑥) = ⟨“𝑥”⟩)
41		simpr 484	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → 𝑥 ∈ 𝐽)
42	41	s1cld 14510	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → ⟨“𝑥”⟩ ∈ Word 𝐽)
43	40, 42	eqeltrd 2828	. . . . 5 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) ∧ 𝑥 ∈ 𝐽) → (𝑈‘𝑥) ∈ Word 𝐽)
44	43	ralrimiva 3121	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ 𝐽 (𝑈‘𝑥) ∈ Word 𝐽)
45	18	ffund 6656	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → Fun 𝑈)
46	18	fdmd 6662	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → dom 𝑈 = 𝐼)
47	37, 46	sseqtrrd 3973	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → 𝐽 ⊆ dom 𝑈)
48		funimass4 6887	. . . . 5 ⊢ ((Fun 𝑈 ∧ 𝐽 ⊆ dom 𝑈) → ((𝑈 “ 𝐽) ⊆ Word 𝐽 ↔ ∀𝑥 ∈ 𝐽 (𝑈‘𝑥) ∈ Word 𝐽))
49	45, 47, 48	syl2anc 584	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → ((𝑈 “ 𝐽) ⊆ Word 𝐽 ↔ ∀𝑥 ∈ 𝐽 (𝑈‘𝑥) ∈ Word 𝐽))
50	44, 49	mpbird 257	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → (𝑈 “ 𝐽) ⊆ Word 𝐽)
51		sstr2 3942	. . 3 ⊢ ((𝑈 “ 𝐽) ⊆ Word 𝐽 → (Word 𝐽 ⊆ 𝐴 → (𝑈 “ 𝐽) ⊆ 𝐴))
52	50, 51	syl 17	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → (Word 𝐽 ⊆ 𝐴 → (𝑈 “ 𝐽) ⊆ 𝐴))
53	35, 52	impbid 212	1 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐽 ⊆ 𝐼 ∧ 𝐴 ∈ (SubMnd‘𝑀)) → ((𝑈 “ 𝐽) ⊆ 𝐴 ↔ Word 𝐽 ⊆ 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044   ⊆ wss 3903  dom cdm 5619  ran crn 5620   ↾ cres 5621   “ cima 5622   ∘ ccom 5623  Fun wfun 6476   Fn wfn 6477  ⟶wf 6478  ‘cfv 6482  (class class class)co 7349  0cc0 11009  ..^cfzo 13557  ♯chash 14237  Word cword 14420  ⟨“cs1 14502   Σ_g cgsu 17344  SubMndcsubmnd 18656  freeMndcfrmd 18721  var_FMndcvrmd 18722

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-card 9835  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-nn 12129  df-2 12191  df-n0 12385  df-xnn0 12458  df-z 12472  df-uz 12736  df-fz 13411  df-fzo 13558  df-seq 13909  df-hash 14238  df-word 14421  df-lsw 14470  df-concat 14478  df-s1 14503  df-substr 14548  df-pfx 14578  df-struct 17058  df-sets 17075  df-slot 17093  df-ndx 17105  df-base 17121  df-ress 17142  df-plusg 17174  df-0g 17345  df-gsum 17346  df-mgm 18514  df-sgrp 18593  df-mnd 18609  df-submnd 18658  df-frmd 18723  df-vrmd 18724

This theorem is referenced by: (None)