Theorem srascag 14830

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 13558	. . . . . . 7 ⊢ (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
3	2	simpri 113	. . . . . 6 ⊢ (Scalar‘ndx) ∈ ℕ
4	3	a1i 9	. . . . 5 ⊢ (𝜑 → (Scalar‘ndx) ∈ ℕ)
5		basfn 13462	. . . . . . . 8 ⊢ Base Fn V
6	1	elexd 2835	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ V)
7		funfvex 5712	. . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
8	7	funfni 5483	. . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
9	5, 6, 8	sylancr 418	. . . . . . 7 ⊢ (𝜑 → (Base‘𝑊) ∈ V)
10		srapart.s	. . . . . . 7 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊))
11	9, 10	ssexd 4273	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ V)
12		ressex 13470	. . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝑆 ∈ V) → (𝑊 ↾s 𝑆) ∈ V)
13	1, 11, 12	syl2anc 415	. . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝑆) ∈ V)
14		setsex 13435	. . . . 5 ⊢ ((𝑊 ∈ 𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
15	1, 4, 13, 14	syl3anc 1278	. . . 4 ⊢ (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V)
16		mulrslid 13537	. . . . . 6 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
17	16	slotex 13430	. . . . 5 ⊢ (𝑊 ∈ 𝑋 → (.r‘𝑊) ∈ V)
18	1, 17	syl 14	. . . 4 ⊢ (𝜑 → (.r‘𝑊) ∈ V)
19		vscandxnscandx 13567	. . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (Scalar‘ndx)
20	19	necomi 2505	. . . . 5 ⊢ (Scalar‘ndx) ≠ ( ·𝑠 ‘ndx)
21		vscaslid 13568	. . . . . 6 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
22	21	simpri 113	. . . . 5 ⊢ ( ·𝑠 ‘ndx) ∈ ℕ
23	2, 20, 22	setsslnid 13455	. . . 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 415	. . 3 ⊢ (𝜑 → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)))
25	22	a1i 9	. . . . 5 ⊢ (𝜑 → ( ·𝑠 ‘ndx) ∈ ℕ)
26		setsex 13435	. . . . 5 ⊢ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r‘𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
27	15, 25, 18, 26	syl3anc 1278	. . . 4 ⊢ (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) ∈ V)
28		slotsdifipndx 13580	. . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx))
29	28	simpri 113	. . . . 5 ⊢ (Scalar‘ndx) ≠ (·𝑖‘ndx)
30		ipslid 13576	. . . . . 6 ⊢ (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
31	30	simpri 113	. . . . 5 ⊢ (·𝑖‘ndx) ∈ ℕ
32	2, 29, 31	setsslnid 13455	. . . 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 415	. . 3 ⊢ (𝜑 → (Scalar‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
34	24, 33	eqtrd 2271	. 2 ⊢ (𝜑 → (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
35	2	setsslid 13454	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)))
36	1, 13, 35	syl2anc 415	. 2 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)))
37		srapart.a	. . . 4 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
38		sraval 14825	. . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
39	6, 10, 38	syl2anc 415	. . . 4 ⊢ (𝜑 → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
40	37, 39	eqtrd 2271	. . 3 ⊢ (𝜑 → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
41	40	fveq2d 5699	. 2 ⊢ (𝜑 → (Scalar‘𝐴) = (Scalar‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
42	34, 36, 41	3eqtr4d 2281	1 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  Vcvv 2821   ⊆ wss 3220  ⟨cop 3712   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  ℕcn 9307  ndxcnx 13400   sSet csts 13401  Slot cslot 13402  Basecbs 13403   ↾_s cress 13404  ._rcmulr 13483  Scalarcsca 13485   ·_𝑠 cvsca 13486  ·_𝑖cip 13487  subringAlg csra 14821

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-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-ov 6088  df-oprab 6089  df-mpo 6090  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-7 9371  df-8 9372  df-ndx 13406  df-slot 13407  df-base 13409  df-sets 13410  df-iress 13411  df-mulr 13496  df-sca 13498  df-vsca 13499  df-ip 13500  df-sra 14823

This theorem is used by:  sralmod  14838  rlmscabas  14848