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

Theorem sralem 21484
Description: Lemma for srabase 21485 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 3013 . . . . 5 (𝐸‘ndx) ≠ (Scalar‘ndx)
41, 3setsnid 17418 . . . 4 (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩))
5 sralem.3 . . . . . 6 ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
65necomi 3013 . . . . 5 (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
71, 6setsnid 17418 . . . 4 (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
8 sralem.4 . . . . . 6 (·𝑖‘ndx) ≠ (𝐸‘ndx)
98necomi 3013 . . . . 5 (𝐸‘ndx) ≠ (·𝑖‘ndx)
101, 9setsnid 17418 . . . 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 487 . . . . 5 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
14 srapart.s . . . . . 6 (𝜑 → 𝑆 ⊆ (Base‘𝑊))
15 sraval 21483 . . . . . 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 2798 . . . 4 ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
1817fveq2d 6915 . . 3 ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
1911, 18eqtr4id 2817 . 2 ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴))
201str0 17399 . . 3 ∅ = (𝐸‘∅)
21 fvprc 6903 . . . 4 (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅)
2221adantr 486 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅)
23 fv2prc 6953 . . . . 5 (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅)
2412, 23sylan9eqr 2820 . . . 4 ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅)
2524fveq2d 6915 . . 3 ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅))
2620, 22, 253eqtr4a 2824 . 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 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ⟨cop 4838  ‘cfv 6561  (class class class)co 7446   sSet csts 17373  Slot cslot 17391  ndxcnx 17403  Basecbs 17419   ↾s cress 17440  .rcmulr 17461  Scalarcsca 17463   ·𝑠 cvsca 17464  ·𝑖cip 17465  subringAlg csra 21479
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-sets 17374  df-slot 17392  df-sra 21481
This theorem is used by:  srabase  21485  sraaddg  21486  sramulr  21487  sratset  21491  srads  21493  cchhllem  29497
  Copyright terms: Public domain W3C validator