| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cntziinsn | Structured version Visualization version GIF version | ||
| Description: Express any centralizer as an intersection of singleton centralizers. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| cntzrec.b | ⊢ 𝐵 = (Base‘𝑀) |
| cntzrec.z | ⊢ 𝑍 = (Cntz‘𝑀) |
| Ref | Expression |
|---|---|
| cntziinsn | ⊢ (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cntzrec.b | . . 3 ⊢ 𝐵 = (Base‘𝑀) | |
| 2 | eqid 2766 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 3 | cntzrec.z | . . 3 ⊢ 𝑍 = (Cntz‘𝑀) | |
| 4 | 1, 2, 3 | cntzval 19588 | . 2 ⊢ (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) |
| 5 | ssel2 3907 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵) | |
| 6 | 1, 2, 3 | cntzsnval 19591 | . . . . . 6 ⊢ (𝑥 ∈ 𝐵 → (𝑍‘{𝑥}) = {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) |
| 7 | 5, 6 | syl 18 | . . . . 5 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝑆) → (𝑍‘{𝑥}) = {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) |
| 8 | 7 | iineq2dv 4981 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥}) = ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) |
| 9 | 8 | ineq2d 4119 | . . 3 ⊢ (𝑆 ⊆ 𝐵 → (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})) |
| 10 | riinrab 5048 | . . 3 ⊢ (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)} | |
| 11 | 9, 10 | eqtrdi 2817 | . 2 ⊢ (𝑆 ⊆ 𝐵 → (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) |
| 12 | 4, 11 | eqtr4d 2804 | 1 ⊢ (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 {crab 3415 ⊆ wss 3899 ∩ cin 4091 {csn 4587 ∩ ciin 4956 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 +gcplusg 17474 Cntzccntz 19582 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-cntz 19584 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |