Theorem srascag 14449

Description: The set of scalars of a subring algebra. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Proof shortened by AV, 12-Nov-2024.)

Hypotheses

Ref	Expression
srapart.a	⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
srapart.s	⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊))
srapart.ex	⊢ (𝜑 → 𝑊 ∈ 𝑋)

Assertion

Ref	Expression
srascag	⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴))

Proof of Theorem srascag

Step	Hyp	Ref	Expression
1		srapart.ex	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
2		scaslid 13229	. . . . . . 7 ⊢ (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
3	2	simpri 113	. . . . . 6 ⊢ (Scalar‘ndx) ∈ ℕ
4	3	a1i 9	. . . . 5 ⊢ (𝜑 → (Scalar‘ndx) ∈ ℕ)
5		basfn 13134	. . . . . . . 8 ⊢ Base Fn V
6	1	elexd 2814	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ V)
7		funfvex 5652	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
8	7	funfni 5429	. . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
9	5, 6, 8	sylancr 414	. . . . . . 7 ⊢ (𝜑 → (Base‘𝑊) ∈ V)
10		srapart.s	. . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊))
11	9, 10	ssexd 4227	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ V)
12		ressex 13141	. . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝑆 ∈ V) → (𝑊 ↾s 𝑆) ∈ V)
13	1, 11, 12	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝑆) ∈ V)
14		setsex 13107	. . . . 5 ⊢ ((𝑊 ∈ 𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
15	1, 4, 13, 14	syl3anc 1271	. . . 4 ⊢ (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
16		mulrslid 13208	. . . . . 6 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
17	16	slotex 13102	. . . . 5 ⊢ (𝑊 ∈ 𝑋 → (.r‘𝑊) ∈ V)
18	1, 17	syl 14	. . . 4 ⊢ (𝜑 → (.r‘𝑊) ∈ V)
19		vscandxnscandx 13238	. . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (Scalar‘ndx)
20	19	necomi 2485	. . . . 5 ⊢ (Scalar‘ndx) ≠ ( ·𝑠 ‘ndx)
21		vscaslid 13239	. . . . . 6 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
22	21	simpri 113	. . . . 5 ⊢ ( ·𝑠 ‘ndx) ∈ ℕ
23	2, 20, 22	setsslnid 13127	. . . 4 ⊢ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V ∧ (.r‘𝑊) ∈ V) → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)))
24	15, 18, 23	syl2anc 411	. . 3 ⊢ (𝜑 → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)))
25	22	a1i 9	. . . . 5 ⊢ (𝜑 → ( ·𝑠 ‘ndx) ∈ ℕ)
26		setsex 13107	. . . . 5 ⊢ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r‘𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
27	15, 25, 18, 26	syl3anc 1271	. . . 4 ⊢ (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
28		slotsdifipndx 13251	. . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx))
29	28	simpri 113	. . . . 5 ⊢ (Scalar‘ndx) ≠ (·𝑖‘ndx)
30		ipslid 13247	. . . . . 6 ⊢ (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
31	30	simpri 113	. . . . 5 ⊢ (·𝑖‘ndx) ∈ ℕ
32	2, 29, 31	setsslnid 13127	. . . 4 ⊢ ((((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V ∧ (.r‘𝑊) ∈ V) → (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
33	27, 18, 32	syl2anc 411	. . 3 ⊢ (𝜑 → (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
34	24, 33	eqtrd 2262	. 2 ⊢ (𝜑 → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
35	2	setsslid 13126	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)))
36	1, 13, 35	syl2anc 411	. 2 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)))
37		srapart.a	. . . 4 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
38		sraval 14444	. . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
39	6, 10, 38	syl2anc 411	. . . 4 ⊢ (𝜑 → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
40	37, 39	eqtrd 2262	. . 3 ⊢ (𝜑 → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
41	40	fveq2d 5639	. 2 ⊢ (𝜑 → (Scalar‘𝐴) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
42	34, 36, 41	3eqtr4d 2272	1 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴))

Syntax hints:   → wi 4   = wceq 1395   ∈ wcel 2200   ≠ wne 2400  Vcvv 2800   ⊆ wss 3198  ⟨cop 3670   Fn wfn 5319  ‘cfv 5324  (class class class)co 6013  ℕcn 9136  ndxcnx 13072   sSet csts 13073  Slot cslot 13074  Basecbs 13075   ↾_s cress 13076  ._rcmulr 13154  Scalarcsca 13156   ·_𝑠 cvsca 13157  ·_𝑖cip 13158  subringAlg csra 14440

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-pre-ltirr 8137  ax-pre-lttrn 8139  ax-pre-ltadd 8141

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8209  df-mnf 8210  df-ltxr 8212  df-inn 9137  df-2 9195  df-3 9196  df-4 9197  df-5 9198  df-6 9199  df-7 9200  df-8 9201  df-ndx 13078  df-slot 13079  df-base 13081  df-sets 13082  df-iress 13083  df-mulr 13167  df-sca 13169  df-vsca 13170  df-ip 13171  df-sra 14442

This theorem is referenced by:  sralmod  14457  rlmscabas  14467