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

Theorem sralemg 14517
Description: Lemma for srabaseg 14518 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 13204 . . . . . . 7 Base Fn V
31elexd 2817 . . . . . . 7 (𝜑𝑊 ∈ V)
4 funfvex 5665 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
54funfni 5439 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
62, 3, 5sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑊) ∈ V)
7 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
86, 7ssexd 4234 . . . . 5 (𝜑𝑆 ∈ V)
9 ressex 13211 . . . . 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 2488 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
14 scaslid 13299 . . . . . 6 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
1514simpri 113 . . . . 5 (Scalar‘ndx) ∈ ℕ
1611, 13, 15setsslnid 13197 . . . 4 ((𝑊𝑋 ∧ (𝑊s 𝑆) ∈ V) → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
171, 10, 16syl2anc 411 . . 3 (𝜑 → (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)))
1815a1i 9 . . . . 5 (𝜑 → (Scalar‘ndx) ∈ ℕ)
19 setsex 13177 . . . . 5 ((𝑊𝑋 ∧ (Scalar‘ndx) ∈ ℕ ∧ (𝑊s 𝑆) ∈ V) → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
201, 18, 10, 19syl3anc 1274 . . . 4 (𝜑 → (𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) ∈ V)
21 mulrslid 13278 . . . . . 6 (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
2221slotex 13172 . . . . 5 (𝑊𝑋 → (.r𝑊) ∈ V)
231, 22syl 14 . . . 4 (𝜑 → (.r𝑊) ∈ V)
24 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
2524necomi 2488 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
26 vscaslid 13309 . . . . . 6 ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
2726simpri 113 . . . . 5 ( ·𝑠 ‘ndx) ∈ ℕ
2811, 25, 27setsslnid 13197 . . . 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 13177 . . . . 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 2488 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
35 ipslid 13317 . . . . . 6 (·𝑖 = Slot (·𝑖‘ndx) ∧ (·𝑖‘ndx) ∈ ℕ)
3635simpri 113 . . . . 5 (·𝑖‘ndx) ∈ ℕ
3711, 34, 36setsslnid 13197 . . . 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 2268 . 2 (𝜑 → (𝐸𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
40 srapart.a . . . 4 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
41 sraval 14516 . . . . 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 2264 . . 3 (𝜑𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
4443fveq2d 5652 . 2 (𝜑 → (𝐸𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
4539, 44eqtr4d 2267 1 (𝜑 → (𝐸𝑊) = (𝐸𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  wne 2403  Vcvv 2803  wss 3201  cop 3676   Fn wfn 5328  cfv 5333  (class class class)co 6028  cn 9185  ndxcnx 13142   sSet csts 13143  Slot cslot 13144  Basecbs 13145  s cress 13146  .rcmulr 13224  Scalarcsca 13226   ·𝑠 cvsca 13227  ·𝑖cip 13228  subringAlg csra 14512
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 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
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 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-mulr 13237  df-sca 13239  df-vsca 13240  df-ip 13241  df-sra 14514
This theorem is referenced by:  srabaseg  14518  sraaddgg  14519  sramulrg  14520  sratsetg  14524  sradsg  14527
  Copyright terms: Public domain W3C validator