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

Theorem sralemg 14712
Description: Lemma for srabaseg 14713 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 13355 . . . . . . 7 Base Fn V
31elexd 2829 . . . . . . 7 (𝜑𝑊 ∈ V)
4 funfvex 5692 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
54funfni 5463 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
62, 3, 5sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑊) ∈ V)
7 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
86, 7ssexd 4255 . . . . 5 (𝜑𝑆 ∈ V)
9 ressex 13362 . . . . 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 2499 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
14 scaslid 13450 . . . . . 6 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
1514simpri 113 . . . . 5 (Scalar‘ndx) ∈ ℕ
1611, 13, 15setsslnid 13348 . . . 4 ((𝑊𝑋 ∧ (𝑊s 𝑆) ∈ V) → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
171, 10, 16syl2anc 411 . . 3 (𝜑 → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
1815a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
19 setsex 13328 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
201, 18, 10, 19syl3anc 1274 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
21 mulrslid 13429 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2221slotex 13323 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
231, 22syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
24 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
2524necomi 2499 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
26 vscaslid 13460 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
2726simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
2811, 25, 27setsslnid 13348 . . . 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 13328 . . . . 5 (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V ∧ ( ·𝑠 ‘ndx) ∈ ℕ ∧ (.r𝑊) ∈ V) → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
3220, 30, 23, 31syl3anc 1274 . . . 4 (𝜑 → ((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) ∈ V)
33 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
3433necomi 2499 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
35 ipslid 13468 . . . . . 6 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
3635simpri 113 . . . . 5 (·𝑖‘ndx) ∈ ℕ
3711, 34, 36setsslnid 13348 . . . 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 2271 . 2 (𝜑 → (𝐸𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
40 srapart.a . . . 4 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
41 sraval 14711 . . . . 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 2267 . . 3 (𝜑𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
4443fveq2d 5679 . 2 (𝜑 → (𝐸𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
4539, 44eqtr4d 2270 1 (𝜑 → (𝐸𝑊) = (𝐸𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wne 2414  Vcvv 2815  wss 3214  cop 3697   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 14707
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-nul 3513  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 14709
This theorem is referenced by:  srabaseg  14713  sraaddgg  14714  sramulrg  14715  sratsetg  14719  sradsg  14722
  Copyright terms: Public domain W3C validator