MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sraval Structured version   Visualization version   GIF version

Theorem sraval 21455
Description: Lemma for srabase 21457 through sravsca 21461. (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.
StepHypRef Expression
1 elex 3471 . . . 4 (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
21adantr 486 . . 3 ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → 𝑊 ∈ V)
3 fveq2 6885 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
43pweqd 4573 . . . . 5 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
5 id 23 . . . . . . . 8 (𝑤 = 𝑊 → 𝑤 = 𝑊)
6 oveq1 7427 . . . . . . . . 9 (𝑤 = 𝑊 → (𝑤 ↾s 𝑠) = (𝑊 ↾s 𝑠))
76opeq2d 4846 . . . . . . . 8 (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩)
85, 7oveq12d 7438 . . . . . . 7 (𝑤 = 𝑊 → (𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩))
9 fveq2 6885 . . . . . . . 8 (𝑤 = 𝑊 → (.r‘𝑤) = (.r‘𝑊))
109opeq2d 4846 . . . . . . 7 (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩ = ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)
118, 10oveq12d 7438 . . . . . 6 (𝑤 = 𝑊 → ((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
129opeq2d 4846 . . . . . 6 (𝑤 = 𝑊 → ⟨(·𝑖‘ndx), (.r‘𝑤)⟩ = ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)
1311, 12oveq12d 7438 . . . . 5 (𝑤 = 𝑊 → (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑤)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
144, 13mpteq12dv 5191 . . . 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 21453 . . . 4 subringAlg = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑤)⟩)))
16 fvex 6898 . . . . . 6 (Base‘𝑊) ∈ V
1716pwex 5341 . . . . 5 𝒫 (Base‘𝑊) ∈ V
1817mptex 7229 . . . 4 (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)) ∈ V
1914, 15, 18fvmpt 6993 . . 3 (𝑊 ∈ V → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
202, 19syl 18 . 2 ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
21 simpr 490 . . . . . . 7 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
2221oveq2d 7436 . . . . . 6 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 ↾s 𝑠) = (𝑊 ↾s 𝑆))
2322opeq2d 4846 . . . . 5 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)
2423oveq2d 7436 . . . 4 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩))
2524oveq1d 7435 . . 3 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
2625oveq1d 7435 . 2 (((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
2716elpw2 5295 . . 3 (𝑆 ∈ 𝒫 (Base‘𝑊) ↔ 𝑆 ⊆ (Base‘𝑊))
2827bilanri 512 . 2 ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → 𝑆 ∈ 𝒫 (Base‘𝑊))
29 ovexd 7455 . 2 ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩) ∈ V)
3020, 26, 28, 29fvmptd 7001 1 ((𝑊 ∈ 𝑉 ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895  𝒫 cpw 4556  ⟨cop 4834   ↦ cmpt 5185  ‘cfv 6538  (class class class)co 7420   sSet csts 17346  ndxcnx 17376  Basecbs 17392   ↾s cress 17413  .rcmulr 17434  Scalarcsca 17436   ·𝑠 cvsca 17437  ·𝑖cip 17438  subringAlg csra 21451
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-sra 21453
This theorem is used by:  sralem  21456  srasca  21460  sravsca  21461  sraip  21462  rlmval2  21472  resssra  34265
  Copyright terms: Public domain W3C validator