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

Theorem sraval 21222
Description: Lemma for srabase 21224 through sravsca 21228. (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 3474 . . . 4 (𝑊𝑉𝑊 ∈ V)
21adantr 484 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑊 ∈ V)
3 fveq2 6863 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
43pweqd 4571 . . . . 5 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
5 id 22 . . . . . . . 8 (𝑤 = 𝑊𝑤 = 𝑊)
6 oveq1 7399 . . . . . . . . 9 (𝑤 = 𝑊 → (𝑤s 𝑠) = (𝑊s 𝑠))
76opeq2d 4837 . . . . . . . 8 (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩)
85, 7oveq12d 7410 . . . . . . 7 (𝑤 = 𝑊 → (𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩))
9 fveq2 6863 . . . . . . . 8 (𝑤 = 𝑊 → (.r𝑤) = (.r𝑊))
109opeq2d 4837 . . . . . . 7 (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩ = ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)
118, 10oveq12d 7410 . . . . . 6 (𝑤 = 𝑊 → ((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
129opeq2d 4837 . . . . . 6 (𝑤 = 𝑊 → ⟨(·𝑖‘ndx), (.r𝑤)⟩ = ⟨(·𝑖‘ndx), (.r𝑊)⟩)
1311, 12oveq12d 7410 . . . . 5 (𝑤 = 𝑊 → (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑤)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
144, 13mpteq12dv 5186 . . . 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 21220 . . . 4 subringAlg = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑤)⟩)))
16 fvex 6876 . . . . . 6 (Base‘𝑊) ∈ V
1716pwex 5336 . . . . 5 𝒫 (Base‘𝑊) ∈ V
1817mptex 7203 . . . 4 (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)) ∈ V
1914, 15, 18fvmpt 6971 . . 3 (𝑊 ∈ V → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
202, 19syl 17 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
21 simpr 488 . . . . . . 7 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
2221oveq2d 7408 . . . . . 6 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊s 𝑠) = (𝑊s 𝑆))
2322opeq2d 4837 . . . . 5 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)
2423oveq2d 7408 . . . 4 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩))
2524oveq1d 7407 . . 3 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
2625oveq1d 7407 . 2 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
2716elpw2 5289 . . 3 (𝑆 ∈ 𝒫 (Base‘𝑊) ↔ 𝑆 ⊆ (Base‘𝑊))
2827bilanri 510 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑆 ∈ 𝒫 (Base‘𝑊))
29 ovexd 7427 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩) ∈ V)
3020, 26, 28, 29fvmptd 6979 1 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  Vcvv 3453  wss 3904  𝒫 cpw 4554  cop 4587  cmpt 5180  cfv 6517  (class class class)co 7392   sSet csts 17182  ndxcnx 17212  Basecbs 17228  s cress 17249  .rcmulr 17270  Scalarcsca 17272   ·𝑠 cvsca 17273  ·𝑖cip 17274  subringAlg csra 21218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-sra 21220
This theorem is referenced by:  sralem  21223  srasca  21227  sravsca  21228  sraip  21229  rlmval2  21239  resssra  33845
  Copyright terms: Public domain W3C validator