MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sralem Structured version   Visualization version   GIF version

Theorem sralem 21334
Description: Lemma for srabase 21335 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‘𝑊))
sralem.1 𝐸 = Slot (𝐸‘ndx)
sralem.2 (Scalar‘ndx) ≠ (𝐸‘ndx)
sralem.3 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
sralem.4 (·𝑖‘ndx) ≠ (𝐸‘ndx)
Assertion
Ref Expression
sralem (𝜑 → (𝐸𝑊) = (𝐸𝐴))

Proof of Theorem sralem
StepHypRef Expression
1 sralem.1 . . . . 5 𝐸 = Slot (𝐸‘ndx)
2 sralem.2 . . . . . 6 (Scalar‘ndx) ≠ (𝐸‘ndx)
32necomi 3015 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
41, 3setsnid 17293 . . . 4 (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩))
5 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
65necomi 3015 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
71, 6setsnid 17293 . . . 4 (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
8 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
98necomi 3015 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
101, 9setsnid 17293 . . . 4 (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
114, 7, 103eqtri 2793 . . 3 (𝐸𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
12 srapart.a . . . . . 6 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
1312adantl 487 . . . . 5 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
14 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
15 sraval 21333 . . . . . 6 ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1614, 15sylan2 605 . . . . 5 ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1713, 16eqtrd 2801 . . . 4 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1817fveq2d 6892 . . 3 ((𝑊 ∈ V ∧ 𝜑) → (𝐸𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
1911, 18eqtr4id 2820 . 2 ((𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = (𝐸𝐴))
201str0 17274 . . 3 ∅ = (𝐸‘∅)
21 fvprc 6880 . . . 4 𝑊 ∈ V → (𝐸𝑊) = ∅)
2221adantr 486 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = ∅)
23 fv2prc 6930 . . . . 5 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅)
2412, 23sylan9eqr 2823 . . . 4 ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅)
2524fveq2d 6892 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝐴) = (𝐸‘∅))
2620, 22, 253eqtr4a 2827 . 2 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = (𝐸𝐴))
2719, 26pm2.61ian 824 1 (𝜑 → (𝐸𝑊) = (𝐸𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2146  wne 2961  Vcvv 3458  wss 3908  c0 4289  cop 4600  cfv 6543  (class class class)co 7423   sSet csts 17248  Slot cslot 17266  ndxcnx 17278  Basecbs 17294  s cress 17315  .rcmulr 17336  Scalarcsca 17338   ·𝑠 cvsca 17339  ·𝑖cip 17340  subringAlg csra 21329
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-sets 17249  df-slot 17267  df-sra 21331
This theorem is used by:  srabase  21335  sraaddg  21336  sramulr  21337  sratset  21341  srads  21343  cchhllem  29273
  Copyright terms: Public domain W3C validator