Theorem cntzval 19390

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.

Step	Hyp	Ref	Expression
1		cntzfval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑀)
2		cntzfval.p	. . . . 5 ⊢ + = (+g‘𝑀)
3		cntzfval.z	. . . . 5 ⊢ 𝑍 = (Cntz‘𝑀)
4	1, 2, 3	cntzfval 19389	. . . 4 ⊢ (𝑀 ∈ V → 𝑍 = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}))
5	4	fveq1d 6884	. . 3 ⊢ (𝑀 ∈ V → (𝑍‘𝑆) = ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆))
6	1	fvexi 6896	. . . . 5 ⊢ 𝐵 ∈ V
7	6	elpw2 5305	. . . 4 ⊢ (𝑆 ∈ 𝒫 𝐵 ↔ 𝑆 ⊆ 𝐵)
8		raleq 3326	. . . . . 6 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥) ↔ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)))
9	8	rabbidv 3430	. . . . 5 ⊢ (𝑠 = 𝑆 → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
10		eqid 2769	. . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)}) = (𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
11	6	rabex 5310	. . . . 5 ⊢ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ∈ V
12	9, 10, 11	fvmpt 6990	. . . 4 ⊢ (𝑆 ∈ 𝒫 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
13	7, 12	sylbir 238	. . 3 ⊢ (𝑆 ⊆ 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑠 (𝑥 + 𝑦) = (𝑦 + 𝑥)})‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
14	5, 13	sylan9eq 2824	. 2 ⊢ ((𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
15		0fv 6923	. . . 4 ⊢ (∅‘𝑆) = ∅
16		fvprc 6874	. . . . . 6 ⊢ (¬ 𝑀 ∈ V → (Cntz‘𝑀) = ∅)
17	3, 16	eqtrid 2816	. . . . 5 ⊢ (¬ 𝑀 ∈ V → 𝑍 = ∅)
18	17	fveq1d 6884	. . . 4 ⊢ (¬ 𝑀 ∈ V → (𝑍‘𝑆) = (∅‘𝑆))
19		ssrab2 4042	. . . . . 6 ⊢ {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ 𝐵
20		fvprc 6874	. . . . . . 7 ⊢ (¬ 𝑀 ∈ V → (Base‘𝑀) = ∅)
21	1, 20	eqtrid 2816	. . . . . 6 ⊢ (¬ 𝑀 ∈ V → 𝐵 = ∅)
22	19, 21	sseqtrid 3987	. . . . 5 ⊢ (¬ 𝑀 ∈ V → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ ∅)
23		ss0 4366	. . . . 5 ⊢ ({𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} ⊆ ∅ → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = ∅)
24	22, 23	syl 18	. . . 4 ⊢ (¬ 𝑀 ∈ V → {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)} = ∅)
25	15, 18, 24	3eqtr4a 2830	. . 3 ⊢ (¬ 𝑀 ∈ V → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
26	25	adantr 485	. 2 ⊢ ((¬ 𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})
27	14, 26	pm2.61ian 823	1 ⊢ (𝑆 ⊆ 𝐵 → (𝑍‘𝑆) = {𝑥 ∈ 𝐵 ∣ ∀𝑦 ∈ 𝑆 (𝑥 + 𝑦) = (𝑦 + 𝑥)})

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1567   ∈ wcel 2149  ∀wral 3085  {crab 3423  Vcvv 3463   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4567   ↦ cmpt 5196  ‘cfv 6537  (class class class)co 7411  Basecbs 17268  +_gcplusg 17309  Cntzccntz 19384

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-cntz 19386

This theorem is referenced by:  elcntz  19391  cntzsnval  19393  sscntz  19395  cntzssv  19397  cntziinsn  19406  cmnbascntr  19874