Theorem rhmimasubrnglem 20542

Description: Lemma for rhmimasubrng 20543: Modified part of mhmima 18793. (Contributed by Mario Carneiro, 10-Mar-2015.) (Revised by AV, 16-Feb-2025.)

Hypothesis

Ref	Expression
rhmimasubrnglem.b	⊢ 𝑀 = (mulGrp‘𝑅)

Assertion

Ref	Expression
rhmimasubrnglem	⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝑀   𝑥,𝑁,𝑦   𝑥,𝑅   𝑥,𝑋,𝑦

Allowed substitution hints:   𝑅(𝑦)   𝑀(𝑦)

Proof of Theorem rhmimasubrnglem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 767	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝐹 ∈ (𝑀 MndHom 𝑁))
2		eqid 2736	. . . . . . . . . . . . 13 ⊢ (Base‘𝑅) = (Base‘𝑅)
3	2	subrngss 20525	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ (SubRng‘𝑅) → 𝑋 ⊆ (Base‘𝑅))
4		rhmimasubrnglem.b	. . . . . . . . . . . . 13 ⊢ 𝑀 = (mulGrp‘𝑅)
5	4, 2	mgpbas 20126	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑀)
6	3, 5	sseqtrdi 3962	. . . . . . . . . . 11 ⊢ (𝑋 ∈ (SubRng‘𝑅) → 𝑋 ⊆ (Base‘𝑀))
7	6	adantl 481	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → 𝑋 ⊆ (Base‘𝑀))
8	7	adantr 480	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝑋 ⊆ (Base‘𝑀))
9		simprl 771	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝑧 ∈ 𝑋)
10	8, 9	sseldd 3922	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝑧 ∈ (Base‘𝑀))
11		simprr 773	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
12	8, 11	sseldd 3922	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝑥 ∈ (Base‘𝑀))
13		eqid 2736	. . . . . . . . 9 ⊢ (Base‘𝑀) = (Base‘𝑀)
14		eqid 2736	. . . . . . . . 9 ⊢ (+g‘𝑀) = (+g‘𝑀)
15		eqid 2736	. . . . . . . . 9 ⊢ (+g‘𝑁) = (+g‘𝑁)
16	13, 14, 15	mhmlin 18761	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑧 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝐹‘(𝑧(+g‘𝑀)𝑥)) = ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)))
17	1, 10, 12, 16	syl3anc 1374	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝐹‘(𝑧(+g‘𝑀)𝑥)) = ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)))
18		eqid 2736	. . . . . . . . . . . 12 ⊢ (Base‘𝑁) = (Base‘𝑁)
19	13, 18	mhmf 18757	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
20	19	adantr 480	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
21	20	ffnd 6669	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → 𝐹 Fn (Base‘𝑀))
22	21	adantr 480	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → 𝐹 Fn (Base‘𝑀))
23		eqid 2736	. . . . . . . . . . . . 13 ⊢ (.r‘𝑅) = (.r‘𝑅)
24	4, 23	mgpplusg 20125	. . . . . . . . . . . 12 ⊢ (.r‘𝑅) = (+g‘𝑀)
25	24	eqcomi 2745	. . . . . . . . . . 11 ⊢ (+g‘𝑀) = (.r‘𝑅)
26	25	subrngmcl 20534	. . . . . . . . . 10 ⊢ ((𝑋 ∈ (SubRng‘𝑅) ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋)
27	26	3expb 1121	. . . . . . . . 9 ⊢ ((𝑋 ∈ (SubRng‘𝑅) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋)
28	27	adantll 715	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋)
29		fnfvima 7188	. . . . . . . 8 ⊢ ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (𝑧(+g‘𝑀)𝑥) ∈ 𝑋) → (𝐹‘(𝑧(+g‘𝑀)𝑥)) ∈ (𝐹 “ 𝑋))
30	22, 8, 28, 29	syl3anc 1374	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝐹‘(𝑧(+g‘𝑀)𝑥)) ∈ (𝐹 “ 𝑋))
31	17, 30	eqeltrrd 2837	. . . . . 6 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ (𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋))
32	31	anassrs 467	. . . . 5 ⊢ ((((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋))
33	32	ralrimiva 3129	. . . 4 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ 𝑧 ∈ 𝑋) → ∀𝑥 ∈ 𝑋 ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋))
34		oveq2 7375	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝑧)(+g‘𝑁)𝑦) = ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)))
35	34	eleq1d 2821	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑥) → (((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋)))
36	35	ralima 7192	. . . . . 6 ⊢ ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋)))
37	21, 7, 36	syl2anc 585	. . . . 5 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → (∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋)))
38	37	adantr 480	. . . 4 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ 𝑧 ∈ 𝑋) → (∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑥 ∈ 𝑋 ((𝐹‘𝑧)(+g‘𝑁)(𝐹‘𝑥)) ∈ (𝐹 “ 𝑋)))
39	33, 38	mpbird 257	. . 3 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) ∧ 𝑧 ∈ 𝑋) → ∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋))
40	39	ralrimiva 3129	. 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → ∀𝑧 ∈ 𝑋 ∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋))
41		oveq1 7374	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑧) → (𝑥(+g‘𝑁)𝑦) = ((𝐹‘𝑧)(+g‘𝑁)𝑦))
42	41	eleq1d 2821	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑧) → ((𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))
43	42	ralbidv 3160	. . . 4 ⊢ (𝑥 = (𝐹‘𝑧) → (∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))
44	43	ralima 7192	. . 3 ⊢ ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑧 ∈ 𝑋 ∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))
45	21, 7, 44	syl2anc 585	. 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → (∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋) ↔ ∀𝑧 ∈ 𝑋 ∀𝑦 ∈ (𝐹 “ 𝑋)((𝐹‘𝑧)(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))
46	40, 45	mpbird 257	1 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubRng‘𝑅)) → ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3051   ⊆ wss 3889   “ cima 5634   Fn wfn 6493  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  Basecbs 17179  +_gcplusg 17220  ._rcmulr 17221   MndHom cmhm 18749  mulGrpcmgp 20121  SubRngcsubrng 20522

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 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-3 12245  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-mulr 17234  df-mgm 18608  df-sgrp 18687  df-mhm 18751  df-subg 19099  df-abl 19758  df-mgp 20122  df-rng 20134  df-subrng 20523

This theorem is referenced by: (None)