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

Theorem cntziinsn 19578
Description: Express any centralizer as an intersection of singleton centralizers. (Contributed by Stefan O'Rear, 5-Sep-2015.)
Hypotheses
Ref Expression
cntzrec.b 𝐵 = (Base‘𝑀)
cntzrec.z 𝑍 = (Cntz‘𝑀)
Assertion
Ref Expression
cntziinsn (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})))
Distinct variable groups:   𝑥,𝐵   𝑥,𝑀   𝑥,𝑆   𝑥,𝑍

Proof of Theorem cntziinsn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cntzrec.b . . 3 𝐵 = (Base‘𝑀)
2 eqid 2763 . . 3 (+g‘𝑀) = (+g‘𝑀)
3 cntzrec.z . . 3 𝑍 = (Cntz‘𝑀)
41, 2, 3cntzval 19562 . 2 (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})
5 ssel2 3908 . . . . . 6 ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝐵)
61, 2, 3cntzsnval 19565 . . . . . 6 (𝑥 ∈ 𝐵 → (𝑍‘{𝑥}) = {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})
75, 6syl 18 . . . . 5 ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝑆) → (𝑍‘{𝑥}) = {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})
87iineq2dv 4980 . . . 4 (𝑆 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥}) = ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})
98ineq2d 4120 . . 3 (𝑆 ⊆ 𝐵 → (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}))
10 riinrab 5047 . . 3 (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 {𝑦 ∈ 𝐵 ∣ (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)}
119, 10eqtrdi 2814 . 2 (𝑆 ⊆ 𝐵 → (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝑆 (𝑦(+g‘𝑀)𝑥) = (𝑥(+g‘𝑀)𝑦)})
124, 11eqtr4d 2801 1 (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = (𝐵 ∩ ∩ 𝑥 ∈ 𝑆 (𝑍‘{𝑥})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900   ∩ cin 4092  {csn 4588  ∩ ciin 4955  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  +gcplusg 17454  Cntzccntz 19556
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
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-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-cntz 19558
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator