Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > asclpropd | Structured version Visualization version GIF version |
Description: If two structures have the same components (properties), one is an associative algebra iff the other one is. The last hypotheses on 1r can be discharged either by letting 𝑊 = V (if strong equality is known on ·𝑠) or assuming 𝐾 is a ring. (Contributed by Mario Carneiro, 5-Jul-2015.) |
Ref | Expression |
---|---|
asclpropd.f | ⊢ 𝐹 = (Scalar‘𝐾) |
asclpropd.g | ⊢ 𝐺 = (Scalar‘𝐿) |
asclpropd.1 | ⊢ (𝜑 → 𝑃 = (Base‘𝐹)) |
asclpropd.2 | ⊢ (𝜑 → 𝑃 = (Base‘𝐺)) |
asclpropd.3 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝑊)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦)) |
asclpropd.4 | ⊢ (𝜑 → (1r‘𝐾) = (1r‘𝐿)) |
asclpropd.5 | ⊢ (𝜑 → (1r‘𝐾) ∈ 𝑊) |
Ref | Expression |
---|---|
asclpropd | ⊢ (𝜑 → (algSc‘𝐾) = (algSc‘𝐿)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | asclpropd.5 | . . . . . 6 ⊢ (𝜑 → (1r‘𝐾) ∈ 𝑊) | |
2 | asclpropd.3 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝑊)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦)) | |
3 | 2 | oveqrspc2v 7302 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑃 ∧ (1r‘𝐾) ∈ 𝑊)) → (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐾))) |
4 | 3 | anassrs 468 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑃) ∧ (1r‘𝐾) ∈ 𝑊) → (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐾))) |
5 | 1, 4 | mpidan 686 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑃) → (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐾))) |
6 | asclpropd.4 | . . . . . . 7 ⊢ (𝜑 → (1r‘𝐾) = (1r‘𝐿)) | |
7 | 6 | oveq2d 7291 | . . . . . 6 ⊢ (𝜑 → (𝑧( ·𝑠 ‘𝐿)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿))) |
8 | 7 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑃) → (𝑧( ·𝑠 ‘𝐿)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿))) |
9 | 5, 8 | eqtrd 2778 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑃) → (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾)) = (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿))) |
10 | 9 | mpteq2dva 5174 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝑃 ↦ (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾))) = (𝑧 ∈ 𝑃 ↦ (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿)))) |
11 | asclpropd.1 | . . . 4 ⊢ (𝜑 → 𝑃 = (Base‘𝐹)) | |
12 | 11 | mpteq1d 5169 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝑃 ↦ (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾))) = (𝑧 ∈ (Base‘𝐹) ↦ (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾)))) |
13 | asclpropd.2 | . . . 4 ⊢ (𝜑 → 𝑃 = (Base‘𝐺)) | |
14 | 13 | mpteq1d 5169 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝑃 ↦ (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿))) = (𝑧 ∈ (Base‘𝐺) ↦ (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿)))) |
15 | 10, 12, 14 | 3eqtr3d 2786 | . 2 ⊢ (𝜑 → (𝑧 ∈ (Base‘𝐹) ↦ (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾))) = (𝑧 ∈ (Base‘𝐺) ↦ (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿)))) |
16 | eqid 2738 | . . 3 ⊢ (algSc‘𝐾) = (algSc‘𝐾) | |
17 | asclpropd.f | . . 3 ⊢ 𝐹 = (Scalar‘𝐾) | |
18 | eqid 2738 | . . 3 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
19 | eqid 2738 | . . 3 ⊢ ( ·𝑠 ‘𝐾) = ( ·𝑠 ‘𝐾) | |
20 | eqid 2738 | . . 3 ⊢ (1r‘𝐾) = (1r‘𝐾) | |
21 | 16, 17, 18, 19, 20 | asclfval 21083 | . 2 ⊢ (algSc‘𝐾) = (𝑧 ∈ (Base‘𝐹) ↦ (𝑧( ·𝑠 ‘𝐾)(1r‘𝐾))) |
22 | eqid 2738 | . . 3 ⊢ (algSc‘𝐿) = (algSc‘𝐿) | |
23 | asclpropd.g | . . 3 ⊢ 𝐺 = (Scalar‘𝐿) | |
24 | eqid 2738 | . . 3 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
25 | eqid 2738 | . . 3 ⊢ ( ·𝑠 ‘𝐿) = ( ·𝑠 ‘𝐿) | |
26 | eqid 2738 | . . 3 ⊢ (1r‘𝐿) = (1r‘𝐿) | |
27 | 22, 23, 24, 25, 26 | asclfval 21083 | . 2 ⊢ (algSc‘𝐿) = (𝑧 ∈ (Base‘𝐺) ↦ (𝑧( ·𝑠 ‘𝐿)(1r‘𝐿))) |
28 | 15, 21, 27 | 3eqtr4g 2803 | 1 ⊢ (𝜑 → (algSc‘𝐾) = (algSc‘𝐿)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 Scalarcsca 16965 ·𝑠 cvsca 16966 1rcur 19737 algSccascl 21059 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-1cn 10929 ax-addcl 10931 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-nn 11974 df-slot 16883 df-ndx 16895 df-base 16913 df-ascl 21062 |
This theorem is referenced by: ply1ascl 21429 |
Copyright terms: Public domain | W3C validator |