ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sraval GIF version

Theorem sraval 14697
Description: Lemma for srabaseg 14699 through sravscag 14703. (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 2827 . . . 4 (𝑊𝑉𝑊 ∈ V)
21adantr 276 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑊 ∈ V)
3 df-sra 14695 . . . 4 subringAlg = (𝑤 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑤)⟩)))
4 fveq2 5675 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
54pweqd 3679 . . . . 5 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 (Base‘𝑊))
6 id 19 . . . . . . . 8 (𝑤 = 𝑊𝑤 = 𝑊)
7 oveq1 6065 . . . . . . . . 9 (𝑤 = 𝑊 → (𝑤s 𝑠) = (𝑊s 𝑠))
87opeq2d 3895 . . . . . . . 8 (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩)
96, 8oveq12d 6076 . . . . . . 7 (𝑤 = 𝑊 → (𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩))
10 fveq2 5675 . . . . . . . 8 (𝑤 = 𝑊 → (.r𝑤) = (.r𝑊))
1110opeq2d 3895 . . . . . . 7 (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩ = ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)
129, 11oveq12d 6076 . . . . . 6 (𝑤 = 𝑊 → ((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
1310opeq2d 3895 . . . . . 6 (𝑤 = 𝑊 → ⟨(·𝑖‘ndx), (.r𝑤)⟩ = ⟨(·𝑖‘ndx), (.r𝑊)⟩)
1412, 13oveq12d 6076 . . . . 5 (𝑤 = 𝑊 → (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑤)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
155, 14mpteq12dv 4197 . . . 4 (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ (((𝑤 sSet ⟨(Scalar‘ndx), (𝑤s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑤)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑤)⟩)) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
16 elex 2827 . . . 4 (𝑊 ∈ V → 𝑊 ∈ V)
17 basfn 13355 . . . . . . 7 Base Fn V
18 funfvex 5692 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
1918funfni 5463 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
2017, 19mpan 424 . . . . . 6 (𝑊 ∈ V → (Base‘𝑊) ∈ V)
2120pwexd 4299 . . . . 5 (𝑊 ∈ V → 𝒫 (Base‘𝑊) ∈ V)
2221mptexd 5918 . . . 4 (𝑊 ∈ V → (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)) ∈ V)
233, 15, 16, 22fvmptd3 5776 . . 3 (𝑊 ∈ V → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
242, 23syl 14 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (subringAlg ‘𝑊) = (𝑠 ∈ 𝒫 (Base‘𝑊) ↦ (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
25 simpr 110 . . . . . . 7 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
2625oveq2d 6074 . . . . . 6 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊s 𝑠) = (𝑊s 𝑆))
2726opeq2d 3895 . . . . 5 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩ = ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)
2827oveq2d 6074 . . . 4 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩))
2928oveq1d 6073 . . 3 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) = ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
3029oveq1d 6073 . 2 (((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) ∧ 𝑠 = 𝑆) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑠)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
31 simpr 110 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑆 ⊆ (Base‘𝑊))
32 elpw2g 4273 . . . 4 ((Base‘𝑊) ∈ V → (𝑆 ∈ 𝒫 (Base‘𝑊) ↔ 𝑆 ⊆ (Base‘𝑊)))
332, 20, 323syl 17 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (𝑆 ∈ 𝒫 (Base‘𝑊) ↔ 𝑆 ⊆ (Base‘𝑊)))
3431, 33mpbird 167 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑆 ∈ 𝒫 (Base‘𝑊))
35 simpl 109 . . . . 5 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑊𝑉)
36 scaslid 13450 . . . . . . 7 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
3736simpri 113 . . . . . 6 (Scalar‘ndx) ∈ ℕ
3837a1i 9 . . . . 5 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (Scalar‘ndx) ∈ ℕ)
3934elexd 2829 . . . . . 6 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → 𝑆 ∈ V)
40 ressex 13362 . . . . . 6 ((𝑊𝑉𝑆 ∈ V) → (𝑊s 𝑆) ∈ V)
4139, 40syldan 282 . . . . 5 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (𝑊s 𝑆) ∈ V)
42 setsex 13328 . . . . 5 ((𝑊𝑉 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
4335, 38, 41, 42syl3anc 1274 . . . 4 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
44 vscaslid 13460 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
4544simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
4645a1i 9 . . . 4 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → ( ·𝑠 ‘ndx) ∈ ℕ)
47 mulrslid 13429 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
4847slotex 13323 . . . . 5 (𝑊𝑉 → (.r𝑊) ∈ V)
4948adantr 276 . . . 4 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (.r𝑊) ∈ V)
50 setsex 13328 . . . 4 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
5143, 46, 49, 50syl3anc 1274 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
52 ipslid 13468 . . . . 5 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
5352simpri 113 . . . 4 (·𝑖‘ndx) ∈ ℕ
5453a1i 9 . . 3 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (·𝑖‘ndx) ∈ ℕ)
55 setsex 13328 . . 3 ((((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V ∧ (·𝑖‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩) ∈ V)
5651, 54, 49, 55syl3anc 1274 . 2 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩) ∈ V)
5724, 30, 34, 56fvmptd 5763 1 ((𝑊𝑉𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2205  Vcvv 2815  wss 3214  𝒫 cpw 3674  cop 3697  cmpt 4176   Fn wfn 5352  cfv 5357  (class class class)co 6058  cn 9254  ndxcnx 13293   sSet csts 13294  Slot cslot 13295  Basecbs 13296  s cress 13297  .rcmulr 13375  Scalarcsca 13377   ·𝑠 cvsca 13378  ·𝑖cip 13379  subringAlg csra 14693
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-mulr 13388  df-sca 13390  df-vsca 13391  df-ip 13392  df-sra 14695
This theorem is referenced by:  sralemg  14698  srascag  14702  sravscag  14703  sraipg  14704  sraex  14706
  Copyright terms: Public domain W3C validator