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

Theorem sraipg 14753
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 13484 . . . . . . 7 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
32simpri 113 . . . . . 6 (Scalar‘ndx) ∈ ℕ
43a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
5 basfn 13389 . . . . . . . 8 Base Fn V
61elexd 2835 . . . . . . . 8 (𝜑𝑊 ∈ V)
7 funfvex 5707 . . . . . . . . 9 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
87funfni 5478 . . . . . . . 8 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
95, 6, 8sylancr 418 . . . . . . 7 (𝜑 → (Base‘𝑊) ∈ V)
10 srapart.s . . . . . . 7 (𝜑𝑆 ⊆ (Base‘𝑊))
119, 10ssexd 4268 . . . . . 6 (𝜑𝑆 ∈ V)
12 ressex 13396 . . . . . 6 ((𝑊𝑋𝑆 ∈ V) → (𝑊s 𝑆) ∈ V)
131, 11, 12syl2anc 415 . . . . 5 (𝜑 → (𝑊s 𝑆) ∈ V)
14 setsex 13362 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
151, 4, 13, 14syl3anc 1278 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
16 vscaslid 13494 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
1716simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
1817a1i 9 . . . 4 (𝜑 → ( ·𝑠 ‘ndx) ∈ ℕ)
19 mulrslid 13463 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2019slotex 13357 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
211, 20syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
22 setsex 13362 . . . 4 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
2315, 18, 21, 22syl3anc 1278 . . 3 (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
24 ipslid 13502 . . . 4 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
2524setsslid 13381 . . 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 415 . 2 (𝜑 → (.r𝑊) = (·𝑖‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
27 srapart.a . . . 4 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
28 sraval 14746 . . . . 5 ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
296, 10, 28syl2anc 415 . . . 4 (𝜑 → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
3027, 29eqtrd 2271 . . 3 (𝜑𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
3130fveq2d 5694 . 2 (𝜑 → (·𝑖𝐴) = (·𝑖‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
3226, 31eqtr4d 2274 1 (𝜑 → (.r𝑊) = (·𝑖𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  wcel 2209  Vcvv 2821  wss 3220  cop 3708   Fn wfn 5367  cfv 5372  (class class class)co 6075  cn 9283  ndxcnx 13327   sSet csts 13328  Slot cslot 13329  Basecbs 13330  s cress 13331  .rcmulr 13409  Scalarcsca 13411   ·𝑠 cvsca 13412  ·𝑖cip 13413  subringAlg csra 14742
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-mulr 13422  df-sca 13424  df-vsca 13425  df-ip 13426  df-sra 14744
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator