Theorem srascag 14008

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 12840	. . . . . . 7 ⊢ (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
3	2	simpri 113	. . . . . 6 ⊢ (Scalar‘ndx) ∈ ℕ
4	3	a1i 9	. . . . 5 ⊢ (𝜑 → (Scalar‘ndx) ∈ ℕ)
5		basfn 12746	. . . . . . . 8 ⊢ Base Fn V
6	1	elexd 2776	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ V)
7		funfvex 5576	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
8	7	funfni 5359	. . . . . . . 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 4174	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ V)
12		ressex 12753	. . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝑆 ∈ V) → (𝑊 ↾s 𝑆) ∈ V)
13	1, 11, 12	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝑆) ∈ V)
14		setsex 12720	. . . . 5 ⊢ ((𝑊 ∈ 𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
15	1, 4, 13, 14	syl3anc 1249	. . . 4 ⊢ (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
16		mulrslid 12819	. . . . . 6 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
17	16	slotex 12715	. . . . 5 ⊢ (𝑊 ∈ 𝑋 → (.r‘𝑊) ∈ V)
18	1, 17	syl 14	. . . 4 ⊢ (𝜑 → (.r‘𝑊) ∈ V)
19		vscandxnscandx 12849	. . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (Scalar‘ndx)
20	19	necomi 2452	. . . . 5 ⊢ (Scalar‘ndx) ≠ ( ·𝑠 ‘ndx)
21		vscaslid 12850	. . . . . 6 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
22	21	simpri 113	. . . . 5 ⊢ ( ·𝑠 ‘ndx) ∈ ℕ
23	2, 20, 22	setsslnid 12740	. . . 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 12720	. . . . 5 ⊢ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r‘𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
27	15, 25, 18, 26	syl3anc 1249	. . . 4 ⊢ (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
28		slotsdifipndx 12862	. . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx))
29	28	simpri 113	. . . . 5 ⊢ (Scalar‘ndx) ≠ (·𝑖‘ndx)
30		ipslid 12858	. . . . . 6 ⊢ (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
31	30	simpri 113	. . . . 5 ⊢ (·𝑖‘ndx) ∈ ℕ
32	2, 29, 31	setsslnid 12740	. . . 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 2229	. 2 ⊢ (𝜑 → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
35	2	setsslid 12739	. . 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 14003	. . . . 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 2229	. . 3 ⊢ (𝜑 → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
41	40	fveq2d 5563	. 2 ⊢ (𝜑 → (Scalar‘𝐴) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
42	34, 36, 41	3eqtr4d 2239	1 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴))

Syntax hints:   → wi 4   = wceq 1364   ∈ wcel 2167   ≠ wne 2367  Vcvv 2763   ⊆ wss 3157  ⟨cop 3626   Fn wfn 5254  ‘cfv 5259  (class class class)co 5923  ℕcn 8992  ndxcnx 12685   sSet csts 12686  Slot cslot 12687  Basecbs 12688   ↾_s cress 12689  ._rcmulr 12766  Scalarcsca 12768   ·_𝑠 cvsca 12769  ·_𝑖cip 12770  subringAlg csra 13999

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7972  ax-resscn 7973  ax-1cn 7974  ax-1re 7975  ax-icn 7976  ax-addcl 7977  ax-addrcl 7978  ax-mulcl 7979  ax-addcom 7981  ax-addass 7983  ax-i2m1 7986  ax-0lt1 7987  ax-0id 7989  ax-rnegex 7990  ax-pre-ltirr 7993  ax-pre-lttrn 7995  ax-pre-ltadd 7997

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5926  df-oprab 5927  df-mpo 5928  df-pnf 8065  df-mnf 8066  df-ltxr 8068  df-inn 8993  df-2 9051  df-3 9052  df-4 9053  df-5 9054  df-6 9055  df-7 9056  df-8 9057  df-ndx 12691  df-slot 12692  df-base 12694  df-sets 12695  df-iress 12696  df-mulr 12779  df-sca 12781  df-vsca 12782  df-ip 12783  df-sra 14001

This theorem is referenced by:  sralmod  14016  rlmscabas  14026