Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cntzfval | Structured version Visualization version GIF version |
Description: First level substitution for a centralizer. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
Ref | Expression |
---|---|
cntzfval.b | ⊢ 𝐵 = (Base‘𝑀) |
cntzfval.p | ⊢ + = (+g‘𝑀) |
cntzfval.z | ⊢ 𝑍 = (Cntz‘𝑀) |
Ref | Expression |
---|---|
cntzfval | ⊢ (𝑀 ∈ 𝑉 → 𝑍 = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cntzfval.z | . 2 ⊢ 𝑍 = (Cntz‘𝑀) | |
2 | elex 3512 | . . 3 ⊢ (𝑀 ∈ 𝑉 → 𝑀 ∈ V) | |
3 | fveq2 6669 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀)) | |
4 | cntzfval.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑀) | |
5 | 3, 4 | syl6eqr 2874 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = 𝐵) |
6 | 5 | pweqd 4557 | . . . . 5 ⊢ (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 𝐵) |
7 | fveq2 6669 | . . . . . . . . . 10 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀)) | |
8 | cntzfval.p | . . . . . . . . . 10 ⊢ + = (+g‘𝑀) | |
9 | 7, 8 | syl6eqr 2874 | . . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = + ) |
10 | 9 | oveqd 7172 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑥(+g‘𝑚)𝑦) = (𝑥 + 𝑦)) |
11 | 9 | oveqd 7172 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑦(+g‘𝑚)𝑥) = (𝑦 + 𝑥)) |
12 | 10, 11 | eqeq12d 2837 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → ((𝑥(+g‘𝑚)𝑦) = (𝑦(+g‘𝑚)𝑥) ↔ (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
13 | 12 | ralbidv 3197 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (∀𝑦 ∈ 𝑠 (𝑥(+g‘𝑚)𝑦) = (𝑦(+g‘𝑚)𝑥) ↔ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥))) |
14 | 5, 13 | rabeqbidv 3485 | . . . . 5 ⊢ (𝑚 = 𝑀 → {𝑥 ∈ (Base‘𝑚) ∣ ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝑚)𝑦) = (𝑦(+g‘𝑚)𝑥)} = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}) |
15 | 6, 14 | mpteq12dv 5150 | . . . 4 ⊢ (𝑚 = 𝑀 → (𝑠 ∈ 𝒫 (Base‘𝑚) ↦ {𝑥 ∈ (Base‘𝑚) ∣ ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝑚)𝑦) = (𝑦(+g‘𝑚)𝑥)}) = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})) |
16 | df-cntz 18446 | . . . 4 ⊢ Cntz = (𝑚 ∈ V ↦ (𝑠 ∈ 𝒫 (Base‘𝑚) ↦ {𝑥 ∈ (Base‘𝑚) ∣ ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝑚)𝑦) = (𝑦(+g‘𝑚)𝑥)})) | |
17 | 4 | fvexi 6683 | . . . . . 6 ⊢ 𝐵 ∈ V |
18 | 17 | pwex 5280 | . . . . 5 ⊢ 𝒫 𝐵 ∈ V |
19 | 18 | mptex 6985 | . . . 4 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}) ∈ V |
20 | 15, 16, 19 | fvmpt 6767 | . . 3 ⊢ (𝑀 ∈ V → (Cntz‘𝑀) = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})) |
21 | 2, 20 | syl 17 | . 2 ⊢ (𝑀 ∈ 𝑉 → (Cntz‘𝑀) = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})) |
22 | 1, 21 | syl5eq 2868 | 1 ⊢ (𝑀 ∈ 𝑉 → 𝑍 = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∀wral 3138 {crab 3142 Vcvv 3494 𝒫 cpw 4538 ↦ cmpt 5145 ‘cfv 6354 (class class class)co 7155 Basecbs 16482 +gcplusg 16564 Cntzccntz 18444 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-ov 7158 df-cntz 18446 |
This theorem is referenced by: cntzval 18450 cntzrcl 18456 |
Copyright terms: Public domain | W3C validator |