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

Theorem sralem 21431
Description: Lemma for srabase 21432 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 3010 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
41, 3setsnid 17366 . . . 4 (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩))
5 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
65necomi 3010 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
71, 6setsnid 17366 . . . 4 (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
8 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
98necomi 3010 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
101, 9setsnid 17366 . . . 4 (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
114, 7, 103eqtri 2788 . . 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 21430 . . . . . 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 2796 . . . 4 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
1817fveq2d 6881 . . 3 ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
1911, 18eqtr4id 2815 . 2 ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴))
201str0 17347 . . 3 ∅ = (𝐸‘∅)
21 fvprc 6869 . . . 4 (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅)
2221adantr 486 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅)
23 fv2prc 6919 . . . . 5 (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅)
2412, 23sylan9eqr 2818 . . . 4 ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅)
2524fveq2d 6881 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅))
2620, 22, 253eqtr4a 2822 . 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 2145   ≠ wne 2956  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  ⟨cop 4590  ‘cfv 6531  (class class class)co 7412   sSet csts 17321  Slot cslot 17339  ndxcnx 17351  Basecbs 17367   ↾s cress 17388  .rcmulr 17409  Scalarcsca 17411   ·𝑠 cvsca 17412  ·𝑖cip 17413  subringAlg csra 21426
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-sets 17322  df-slot 17340  df-sra 21428
This theorem is used by:  srabase  21432  sraaddg  21433  sramulr  21434  sratset  21438  srads  21440  cchhllem  29446
  Copyright terms: Public domain W3C validator