Theorem issubassa2 15119

Description: A subring of a unital algebra is a subspace and thus a subalgebra iff it contains all scalar multiples of the identity. (Contributed by Mario Carneiro, 9-Mar-2015.)

Hypotheses

Ref	Expression
issubassa2.a	⊢ 𝐴 = (algSc‘𝑊)
issubassa2.l	⊢ 𝐿 = (LSubSp‘𝑊)

Assertion

Ref	Expression
issubassa2	⊢ ((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) → (𝑆 ∈ 𝐿 ↔ ran 𝐴 ⊆ 𝑆))

Proof of Theorem issubassa2

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

Step	Hyp	Ref	Expression
1		issubassa2.a	. . . . 5 ⊢ 𝐴 = (algSc‘𝑊)
2		eqid 2238	. . . . 5 ⊢ (1r‘𝑊) = (1r‘𝑊)
3		eqid 2238	. . . . 5 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
4	1, 2, 3	rnascl 15118	. . . 4 ⊢ (𝑊 ∈ AssAlg → ran 𝐴 = ((LSpan‘𝑊)‘{(1r‘𝑊)}))
5	4	ad2antrr 492	. . 3 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → ran 𝐴 = ((LSpan‘𝑊)‘{(1r‘𝑊)}))
6		issubassa2.l	. . . 4 ⊢ 𝐿 = (LSubSp‘𝑊)
7		assalmod 15090	. . . . 5 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ LMod)
8	7	ad2antrr 492	. . . 4 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → 𝑊 ∈ LMod)
9		simpr 110	. . . 4 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → 𝑆 ∈ 𝐿)
10	2	subrg1cl 14621	. . . . 5 ⊢ (𝑆 ∈ (SubRing‘𝑊) → (1r‘𝑊) ∈ 𝑆)
11	10	ad2antlr 493	. . . 4 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → (1r‘𝑊) ∈ 𝑆)
12	6, 3, 8, 9, 11	ellspsn5 14831	. . 3 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → ((LSpan‘𝑊)‘{(1r‘𝑊)}) ⊆ 𝑆)
13	5, 12	eqsstrd 3284	. 2 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ 𝑆 ∈ 𝐿) → ran 𝐴 ⊆ 𝑆)
14		subrgsubg 14619	. . . 4 ⊢ (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ∈ (SubGrp‘𝑊))
15	14	ad2antlr 493	. . 3 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝑆 ∈ (SubGrp‘𝑊))
16		simplll 539	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → 𝑊 ∈ AssAlg)
17		simprl 535	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → 𝑥 ∈ (Base‘(Scalar‘𝑊)))
18		eqid 2238	. . . . . . . . . 10 ⊢ (Base‘𝑊) = (Base‘𝑊)
19	18	subrgss 14614	. . . . . . . . 9 ⊢ (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ⊆ (Base‘𝑊))
20	19	ad2antlr 493	. . . . . . . 8 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝑆 ⊆ (Base‘𝑊))
21	20	sselda 3248	. . . . . . 7 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ (Base‘𝑊))
22	21	adantrl 482	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ (Base‘𝑊))
23		eqid 2238	. . . . . . 7 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
24		eqid 2238	. . . . . . 7 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
25		eqid 2238	. . . . . . 7 ⊢ (.r‘𝑊) = (.r‘𝑊)
26		eqid 2238	. . . . . . 7 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
27	1, 23, 24, 18, 25, 26	asclmul1 15113	. . . . . 6 ⊢ ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → ((𝐴‘𝑥)(.r‘𝑊)𝑦) = (𝑥( ·𝑠 ‘𝑊)𝑦))
28	16, 17, 22, 27	syl3anc 1278	. . . . 5 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → ((𝐴‘𝑥)(.r‘𝑊)𝑦) = (𝑥( ·𝑠 ‘𝑊)𝑦))
29		simpllr 540	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → 𝑆 ∈ (SubRing‘𝑊))
30		simplr 533	. . . . . . . 8 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊))) → ran 𝐴 ⊆ 𝑆)
31	7	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝑊 ∈ LMod)
32		assaring 15091	. . . . . . . . . . 11 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ Ring)
33	32	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝑊 ∈ Ring)
34	1, 23, 24, 31, 33	asclfnd 15107	. . . . . . . . 9 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝐴 Fn (Base‘(Scalar‘𝑊)))
35		fnfvelrn 5840	. . . . . . . . 9 ⊢ ((𝐴 Fn (Base‘(Scalar‘𝑊)) ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊))) → (𝐴‘𝑥) ∈ ran 𝐴)
36	34, 35	sylan 283	. . . . . . . 8 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊))) → (𝐴‘𝑥) ∈ ran 𝐴)
37	30, 36	sseldd 3249	. . . . . . 7 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ 𝑥 ∈ (Base‘(Scalar‘𝑊))) → (𝐴‘𝑥) ∈ 𝑆)
38	37	adantrr 483	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → (𝐴‘𝑥) ∈ 𝑆)
39		simprr 537	. . . . . 6 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ 𝑆)
40	25	subrgmcl 14625	. . . . . 6 ⊢ ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝐴‘𝑥) ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝐴‘𝑥)(.r‘𝑊)𝑦) ∈ 𝑆)
41	29, 38, 39, 40	syl3anc 1278	. . . . 5 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → ((𝐴‘𝑥)(.r‘𝑊)𝑦) ∈ 𝑆)
42	28, 41	eqeltrrd 2316	. . . 4 ⊢ ((((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) ∧ (𝑥 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑦 ∈ 𝑆)) → (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ 𝑆)
43	42	ralrimivva 2632	. . 3 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → ∀𝑥 ∈ (Base‘(Scalar‘𝑊))∀𝑦 ∈ 𝑆 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ 𝑆)
44	23, 24, 18, 26, 6	islss4 14803	. . . . 5 ⊢ (𝑊 ∈ LMod → (𝑆 ∈ 𝐿 ↔ (𝑆 ∈ (SubGrp‘𝑊) ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑊))∀𝑦 ∈ 𝑆 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ 𝑆)))
45	7, 44	syl 14	. . . 4 ⊢ (𝑊 ∈ AssAlg → (𝑆 ∈ 𝐿 ↔ (𝑆 ∈ (SubGrp‘𝑊) ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑊))∀𝑦 ∈ 𝑆 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ 𝑆)))
46	45	ad2antrr 492	. . 3 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → (𝑆 ∈ 𝐿 ↔ (𝑆 ∈ (SubGrp‘𝑊) ∧ ∀𝑥 ∈ (Base‘(Scalar‘𝑊))∀𝑦 ∈ 𝑆 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ 𝑆)))
47	15, 43, 46	mpbir2and 957	. 2 ⊢ (((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) ∧ ran 𝐴 ⊆ 𝑆) → 𝑆 ∈ 𝐿)
48	13, 47	impbida 604	1 ⊢ ((𝑊 ∈ AssAlg ∧ 𝑆 ∈ (SubRing‘𝑊)) → (𝑆 ∈ 𝐿 ↔ ran 𝐴 ⊆ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  {csn 3709  ran crn 4775   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  ._rcmulr 13485  Scalarcsca 13487   ·_𝑠 cvsca 13488  SubGrpcsubg 14023  1_rcur 14346  Ringcrg 14384  SubRingcsubrg 14609  LModclmod 14707  LSubSpclss 14773  LSpanclspn 14807  AssAlgcasa 15080  algSccascl 15082

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-5 9369  df-6 9370  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-mulr 13498  df-sca 13500  df-vsca 13501  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-sbg 13863  df-subg 14026  df-mgp 14302  df-ur 14347  df-ring 14386  df-subrg 14611  df-lmod 14709  df-lssm 14774  df-lsp 14808  df-assa 15083  df-ascl 15085

This theorem is used by:  rnasclassa  15122