Theorem sraval 21333

Description: Lemma for srabase 21335 through sravsca 21339. (Contributed by Mario Carneiro, 27-Nov-2014.) (Revised by Thierry Arnoux, 16-Jun-2019.)

Assertion

Ref	Expression
sraval	⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))

Proof of Theorem sraval

Dummy variables 𝑠 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3479	. . . 4 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
2	1	adantr 486	. . 3 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → 𝑊 ∈ V)
3		fveq2 6888	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4	3	pweqd 4584	. . . . 5 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
5		id 23	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → 𝑤 = 𝑊)
6		oveq1 7430	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑤 ↾s 𝑠) = (𝑊 ↾s 𝑠))
7	6	opeq2d 4850	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩)
8	5, 7	oveq12d 7441	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩))
9		fveq2 6888	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (.r‘𝑤) = (.r‘𝑊))
10	9	opeq2d 4850	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩ = ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)
11	8, 10	oveq12d 7441	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
12	9	opeq2d 4850	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(·𝑖‘ndx), (.r‘𝑤)⟩ = ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)
13	11, 12	oveq12d 7441	. . . . 5 ⊢ (𝑤 = 𝑊 → (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑤)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
14	4, 13	mpteq12dv 5203	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑤)⟩)) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
15		df-sra 21331	. . . 4 ⊢ subringAlg = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑤)⟩)))
16		fvex 6901	. . . . . 6 ⊢ (Base‘𝑊) ∈ V
17	16	pwex 5356	. . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V
18	17	mptex 7228	. . . 4 ⊢ (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)) ∈ V
19	14, 15, 18	fvmpt 6996	. . 3 ⊢ (𝑊 ∈ V → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
20	2, 19	syl 18	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
21		simpr 490	. . . . . . 7 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
22	21	oveq2d 7439	. . . . . 6 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 ↾s 𝑠) = (𝑊 ↾s 𝑆))
23	22	opeq2d 4850	. . . . 5 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)
24	23	oveq2d 7439	. . . 4 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩))
25	24	oveq1d 7438	. . 3 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
26	25	oveq1d 7438	. 2 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
27	16	elpw2 5310	. . 3 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑊) ↔ 𝑆 ⊆ (Base‘𝑊))
28	27	bilanri 512	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → 𝑆 ∈ 𝒫 (Base‘𝑊))
29		ovexd 7458	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩) ∈ V)
30	20, 26, 28, 29	fvmptd 7004	1 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3458   ⊆ wss 3908  𝒫 cpw 4567  ⟨cop 4600   ↦ cmpt 5197  ‘cfv 6543  (class class class)co 7423   sSet csts 17248  ndxcnx 17278  Basecbs 17294   ↾_s cress 17315  ._rcmulr 17336  Scalarcsca 17338   ·_𝑠 cvsca 17339  ·_𝑖cip 17340  subringAlg csra 21329

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-sra 21331

This theorem is used by:  sralem  21334  srasca  21338  sravsca  21339  sraip  21340  rlmval2  21350  resssra  34008