Theorem sralem 21366

Description: Lemma for srabase 21367 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

Step	Hyp	Ref	Expression
1		sralem.1	. . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx)
2		sralem.2	. . . . . 6 ⊢ (Scalar‘ndx) ≠ (𝐸‘ndx)
3	2	necomi 3011	. . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx)
4	1, 3	setsnid 17306	. . . 4 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩))
5		sralem.3	. . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx)
6	5	necomi 3011	. . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx)
7	1, 6	setsnid 17306	. . . 4 ⊢ (𝐸‘(𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩)) = (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩))
8		sralem.4	. . . . . 6 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx)
9	8	necomi 3011	. . . . 5 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx)
10	1, 9	setsnid 17306	. . . 4 ⊢ (𝐸‘((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩)) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
11	4, 7, 10	3eqtri 2789	. . 3 ⊢ (𝐸‘𝑊) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
12		srapart.a	. . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
13	12	adantl 487	. . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
14		srapart.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊))
15		sraval 21365	. . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
16	14, 15	sylan2 605	. . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
17	13, 16	eqtrd 2797	. . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩))
18	17	fveq2d 6886	. . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet ⟨(Scalar‘ndx), (𝑊 ↾s 𝑆)⟩) sSet ⟨( ·𝑠 ‘ndx), (.r‘𝑊)⟩) sSet ⟨(·𝑖‘ndx), (.r‘𝑊)⟩)))
19	11, 18	eqtr4id 2816	. 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴))
20	1	str0 17287	. . 3 ⊢ ∅ = (𝐸‘∅)
21		fvprc 6874	. . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅)
22	21	adantr 486	. . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅)
23		fv2prc 6924	. . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅)
24	12, 23	sylan9eqr 2819	. . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅)
25	24	fveq2d 6886	. . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅))
26	20, 22, 25	3eqtr4a 2823	. 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴))
27	19, 26	pm2.61ian 824	1 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  ⟨cop 4593  ‘cfv 6537  (class class class)co 7417   sSet csts 17261  Slot cslot 17279  ndxcnx 17291  Basecbs 17307   ↾_s cress 17328  ._rcmulr 17349  Scalarcsca 17351   ·_𝑠 cvsca 17352  ·_𝑖cip 17353  subringAlg csra 21361

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-sets 17262  df-slot 17280  df-sra 21363

This theorem is used by:  srabase  21367  sraaddg  21368  sramulr  21369  sratset  21373  srads  21375  cchhllem  29351