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

Theorem sralem 21278
Description: Lemma for srabase 21279 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 3012 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
41, 3setsnid 17269 . . . 4 (𝐸𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩))
5 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
65necomi 3012 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
71, 6setsnid 17269 . . . 4 (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩))
8 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
98necomi 3012 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
101, 9setsnid 17269 . . . 4 (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
114, 7, 103eqtri 2790 . . 3 (𝐸𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
12 srapart.a . . . . . 6 (𝜑𝐴 = ((subringAlg ‘𝑊)‘𝑆))
1312adantl 486 . . . . 5 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
14 srapart.s . . . . . 6 (𝜑𝑆 ⊆ (Base‘𝑊))
15 sraval 21277 . . . . . 6 ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1614, 15sylan2 604 . . . . 5 ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1713, 16eqtrd 2798 . . . 4 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩))
1817fveq2d 6887 . . 3 ((𝑊 ∈ V ∧ 𝜑) → (𝐸𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r𝑊)⟩)))
1911, 18eqtr4id 2817 . 2 ((𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = (𝐸𝐴))
201str0 17250 . . 3 ∅ = (𝐸‘∅)
21 fvprc 6875 . . . 4 𝑊 ∈ V → (𝐸𝑊) = ∅)
2221adantr 485 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = ∅)
23 fv2prc 6925 . . . . 5 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅)
2412, 23sylan9eqr 2820 . . . 4 ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅)
2524fveq2d 6887 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝐴) = (𝐸‘∅))
2620, 22, 253eqtr4a 2824 . 2 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸𝑊) = (𝐸𝐴))
2719, 26pm2.61ian 823 1 (𝜑 → (𝐸𝑊) = (𝐸𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400   = wceq 1570  wcel 2143  wne 2958  Vcvv 3455  wss 3906  c0 4287  cop 4596  cfv 6538  (class class class)co 7412   sSet csts 17224  Slot cslot 17242  ndxcnx 17254  Basecbs 17270  s cress 17291  .rcmulr 17312  Scalarcsca 17314   ·𝑠 cvsca 17315  ·𝑖cip 17316  subringAlg csra 21273
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-sets 17225  df-slot 17243  df-sra 21275
This theorem is referenced by:  srabase  21279  sraaddg  21280  sramulr  21281  sratset  21285  srads  21287  cchhllem  29217
  Copyright terms: Public domain W3C validator