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

Theorem sraipg 14540
Description: The inner product operation of a subring algebra. (Contributed by Thierry Arnoux, 16-Jun-2019.)
Hypotheses
Ref Expression
srapart.a (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
srapart.s (𝜑𝑆 ⊆ (Base‘𝑊))
srapart.ex (𝜑𝑊𝑋)
Assertion
Ref Expression
sraipg (𝜑 → (.r𝑊) = (·𝑖𝐴))

Proof of Theorem sraipg
StepHypRef Expression
1 srapart.ex . . . . 5 (𝜑𝑊𝑋)
2 scaslid 13316 . . . . . . 7 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
32simpri 113 . . . . . 6 (Scalar‘ndx) ∈ ℕ
43a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
5 basfn 13221 . . . . . . . 8 Base Fn V
61elexd 2817 . . . . . . . 8 (𝜑𝑊 ∈ V)
7 funfvex 5665 . . . . . . . . 9 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
87funfni 5439 . . . . . . . 8 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
95, 6, 8sylancr 414 . . . . . . 7 (𝜑 → (Base‘𝑊) ∈ V)
10 srapart.s . . . . . . 7 (𝜑𝑆 ⊆ (Base‘𝑊))
119, 10ssexd 4234 . . . . . 6 (𝜑𝑆 ∈ V)
12 ressex 13228 . . . . . 6 ((𝑊𝑋𝑆 ∈ V) → (𝑊s 𝑆) ∈ V)
131, 11, 12syl2anc 411 . . . . 5 (𝜑 → (𝑊s 𝑆) ∈ V)
14 setsex 13194 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
151, 4, 13, 14syl3anc 1274 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
16 vscaslid 13326 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
1716simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
1817a1i 9 . . . 4 (𝜑 → ( ·𝑠 ‘ndx) ∈ ℕ)
19 mulrslid 13295 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2019slotex 13189 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
211, 20syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
22 setsex 13194 . . . 4 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
2315, 18, 21, 22syl3anc 1274 . . 3 (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
24 ipslid 13334 . . . 4 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
2524setsslid 13213 . . 3 ((((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V ∧ (.r𝑊) ∈ V) → (.r𝑊) = (·𝑖‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
2623, 21, 25syl2anc 411 . 2 (𝜑 → (.r𝑊) = (·𝑖‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
27 srapart.a . . . 4 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
28 sraval 14533 . . . . 5 ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
296, 10, 28syl2anc 411 . . . 4 (𝜑 → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
3027, 29eqtrd 2264 . . 3 (𝜑𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
3130fveq2d 5652 . 2 (𝜑 → (·𝑖𝐴) = (·𝑖‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
3226, 31eqtr4d 2267 1 (𝜑 → (.r𝑊) = (·𝑖𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2202  Vcvv 2803  wss 3201  cop 3676   Fn wfn 5328  cfv 5333  (class class class)co 6028  cn 9202  ndxcnx 13159   sSet csts 13160  Slot cslot 13161  Basecbs 13162  s cress 13163  .rcmulr 13241  Scalarcsca 13243   ·𝑠 cvsca 13244  ·𝑖cip 13245  subringAlg csra 14529
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-7 9266  df-8 9267  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-iress 13170  df-mulr 13254  df-sca 13256  df-vsca 13257  df-ip 13258  df-sra 14531
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator