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

Theorem sralemg 14417
Description: Lemma for srabaseg 14418 and similar theorems. (Contributed by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by AV, 29-Oct-2024.)
Hypotheses
Ref Expression
srapart.a (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
srapart.s (𝜑𝑆 ⊆ (Base‘𝑊))
srapart.ex (𝜑𝑊𝑋)
sralemg.1 (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ)
sralem.2 (Scalar‘ndx) ≠ (𝐸‘ndx)
sralem.3 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
sralem.4 (·𝑖‘ndx) ≠ (𝐸‘ndx)
Assertion
Ref Expression
sralemg (𝜑 → (𝐸𝑊) = (𝐸𝐴))

Proof of Theorem sralemg
StepHypRef Expression
1 srapart.ex . . . 4 (𝜑𝑊𝑋)
2 basfn 13106 . . . . . . 7 Base Fn V
31elexd 2813 . . . . . . 7 (𝜑𝑊 ∈ V)
4 funfvex 5646 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
54funfni 5423 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
62, 3, 5sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑊) ∈ V)
7 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
86, 7ssexd 4224 . . . . 5 (𝜑𝑆 ∈ V)
9 ressex 13113 . . . . 5 ((𝑊𝑋𝑆 ∈ V) → (𝑊s 𝑆) ∈ V)
101, 8, 9syl2anc 411 . . . 4 (𝜑 → (𝑊s 𝑆) ∈ V)
11 sralemg.1 . . . . 5 (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ)
12 sralem.2 . . . . . 6 (Scalar‘ndx) ≠ (𝐸‘ndx)
1312necomi 2485 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
14 scaslid 13201 . . . . . 6 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
1514simpri 113 . . . . 5 (Scalar‘ndx) ∈ ℕ
1611, 13, 15setsslnid 13099 . . . 4 ((𝑊𝑋 ∧ (𝑊s 𝑆) ∈ V) → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
171, 10, 16syl2anc 411 . . 3 (𝜑 → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
1815a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
19 setsex 13079 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
201, 18, 10, 19syl3anc 1271 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
21 mulrslid 13180 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2221slotex 13074 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
231, 22syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
24 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
2524necomi 2485 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
26 vscaslid 13211 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
2726simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
2811, 25, 27setsslnid 13099 . . . 4 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ (.r𝑊) ∈ V) → (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)))
2920, 23, 28syl2anc 411 . . 3 (𝜑 → (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)))
3027a1i 9 . . . . 5 (𝜑 → ( ·𝑠 ‘ndx) ∈ ℕ)
31 setsex 13079 . . . . 5 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
3220, 30, 23, 31syl3anc 1271 . . . 4 (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
33 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
3433necomi 2485 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
35 ipslid 13219 . . . . . 6 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
3635simpri 113 . . . . 5 (·𝑖‘ndx) ∈ ℕ
3711, 34, 36setsslnid 13099 . . . 4 ((((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V ∧ (.r𝑊) ∈ V) → (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
3832, 23, 37syl2anc 411 . . 3 (𝜑 → (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
3917, 29, 383eqtrd 2266 . 2 (𝜑 → (𝐸𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
40 srapart.a . . . 4 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
41 sraval 14416 . . . . 5 ((𝑊𝑋𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
421, 7, 41syl2anc 411 . . . 4 (𝜑 → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
4340, 42eqtrd 2262 . . 3 (𝜑𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
4443fveq2d 5633 . 2 (𝜑 → (𝐸𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
4539, 44eqtr4d 2265 1 (𝜑 → (𝐸𝑊) = (𝐸𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wne 2400  Vcvv 2799  wss 3197  cop 3669   Fn wfn 5313  cfv 5318  (class class class)co 6007  cn 9121  ndxcnx 13044   sSet csts 13045  Slot cslot 13046  Basecbs 13047  s cress 13048  .rcmulr 13126  Scalarcsca 13128   ·𝑠 cvsca 13129  ·𝑖cip 13130  subringAlg csra 14412
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1re 8104  ax-addrcl 8107
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-5 9183  df-6 9184  df-7 9185  df-8 9186  df-ndx 13050  df-slot 13051  df-base 13053  df-sets 13054  df-iress 13055  df-mulr 13139  df-sca 13141  df-vsca 13142  df-ip 13143  df-sra 14414
This theorem is referenced by:  srabaseg  14418  sraaddgg  14419  sramulrg  14420  sratsetg  14424  sradsg  14427
  Copyright terms: Public domain W3C validator