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

Theorem sralemg 14442
Description: Lemma for srabaseg 14443 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 13131 . . . . . . 7 Base Fn V
31elexd 2814 . . . . . . 7 (𝜑𝑊 ∈ V)
4 funfvex 5652 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
54funfni 5429 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
62, 3, 5sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑊) ∈ V)
7 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
86, 7ssexd 4227 . . . . 5 (𝜑𝑆 ∈ V)
9 ressex 13138 . . . . 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 13226 . . . . . 6 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
1514simpri 113 . . . . 5 (Scalar‘ndx) ∈ ℕ
1611, 13, 15setsslnid 13124 . . . 4 ((𝑊𝑋 ∧ (𝑊s 𝑆) ∈ V) → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
171, 10, 16syl2anc 411 . . 3 (𝜑 → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
1815a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
19 setsex 13104 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
201, 18, 10, 19syl3anc 1271 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
21 mulrslid 13205 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2221slotex 13099 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
231, 22syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
24 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
2524necomi 2485 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
26 vscaslid 13236 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
2726simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
2811, 25, 27setsslnid 13124 . . . 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 13104 . . . . 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 13244 . . . . . 6 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
3635simpri 113 . . . . 5 (·𝑖‘ndx) ∈ ℕ
3711, 34, 36setsslnid 13124 . . . 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 14441 . . . . 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 5639 . 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 2800  wss 3198  cop 3670   Fn wfn 5319  cfv 5324  (class class class)co 6013  cn 9133  ndxcnx 13069   sSet csts 13070  Slot cslot 13071  Basecbs 13072  s cress 13073  .rcmulr 13151  Scalarcsca 13153   ·𝑠 cvsca 13154  ·𝑖cip 13155  subringAlg csra 14437
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 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119
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 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-5 9195  df-6 9196  df-7 9197  df-8 9198  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-mulr 13164  df-sca 13166  df-vsca 13167  df-ip 13168  df-sra 14439
This theorem is referenced by:  srabaseg  14443  sraaddgg  14444  sramulrg  14445  sratsetg  14449  sradsg  14452
  Copyright terms: Public domain W3C validator