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

Theorem cntzval 19588
Description: Definition substitution for a centralizer. (Contributed by Stefan O'Rear, 5-Sep-2015.)
Hypotheses
Ref Expression
cntzfval.b 𝐵 = (Base‘𝑀)
cntzfval.p + = (+g‘𝑀)
cntzfval.z 𝑍 = (Cntz‘𝑀)
Assertion
Ref Expression
cntzval (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
Distinct variable groups:   𝑥,𝑦, +   𝑥,𝐵   𝑥,𝑀,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐵(𝑦)   𝑍(𝑥, 𝑦)

Proof of Theorem cntzval
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 cntzfval.b . . . . 5 𝐵 = (Base‘𝑀)
2 cntzfval.p . . . . 5 + = (+g‘𝑀)
3 cntzfval.z . . . . 5 𝑍 = (Cntz‘𝑀)
41, 2, 3cntzfval 19587 . . . 4 (𝑀 ∈ V → 𝑍 = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}))
54fveq1d 6917 . . 3 (𝑀 ∈ V → (𝑍‘𝑆) = ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆))
61fvexi 6929 . . . . 5 𝐵 ∈ V
76elpw2 5302 . . . 4 (𝑆 ∈ 𝒫 𝐵 ↔ 𝑆 ⊆ 𝐵)
8 raleq 3320 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
98rabbidv 3422 . . . . 5 (𝑠 = 𝑆 → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
10 eqid 2766 . . . . 5 (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}) = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
116rabex 5306 . . . . 5 {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ∈ V
129, 10, 11fvmpt 7023 . . . 4 (𝑆 ∈ 𝒫 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
137, 12sylbir 238 . . 3 (𝑆 ⊆ 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
145, 13sylan9eq 2821 . 2 ((𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
15 0fv 6956 . . . 4 (∅‘𝑆) = ∅
16 fvprc 6907 . . . . . 6 (¬ 𝑀 ∈ V → (Cntz‘𝑀) = ∅)
173, 16eqtrid 2813 . . . . 5 (¬ 𝑀 ∈ V → 𝑍 = ∅)
1817fveq1d 6917 . . . 4 (¬ 𝑀 ∈ V → (𝑍‘𝑆) = (∅‘𝑆))
19 ssrab2 4007 . . . . . 6 {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ 𝐵
20 fvprc 6907 . . . . . . 7 (¬ 𝑀 ∈ V → (Base‘𝑀) = ∅)
211, 20eqtrid 2813 . . . . . 6 (¬ 𝑀 ∈ V → 𝐵 = ∅)
2219, 21sseqtrid 3954 . . . . 5 (¬ 𝑀 ∈ V → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ ∅)
23 ss0 4354 . . . . 5 ({𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ ∅ → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = ∅)
2422, 23syl 18 . . . 4 (¬ 𝑀 ∈ V → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = ∅)
2515, 18, 243eqtr4a 2827 . . 3 (¬ 𝑀 ∈ V → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
2625adantr 486 . 2 ((¬ 𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
2714, 26pm2.61ian 824 1 (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1572   ∈ wcel 2150  ∀wral 3083  {crab 3415  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  𝒫 cpw 4559   ↦ cmpt 5191  ‘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-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:  elcntz  19589  cntzsnval  19591  sscntz  19593  cntzssv  19595  cntziinsn  19604  cmnbascntr  20072
  Copyright terms: Public domain W3C validator