Theorem mzpclval 43489

Description: Substitution lemma for mzPolyCld. (Contributed by Stefan O'Rear, 4-Oct-2014.)

Assertion

Ref	Expression
mzpclval	⊢ (𝑉 ∈ V → (mzPolyCld‘𝑉) = {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)) ∣ ((∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))})

Distinct variable groups:   𝑉,𝑝,𝑓,𝑔   𝑖,𝑉,𝑝   𝑗,𝑉,𝑥,𝑝

Proof of Theorem mzpclval

Dummy variables 𝑣 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7431	. . . . 5 ⊢ (𝑣 = 𝑉 → (ℤ ↑m 𝑣) = (ℤ ↑m 𝑉))
2	1	oveq2d 7439	. . . 4 ⊢ (𝑣 = 𝑉 → (ℤ ↑m (ℤ ↑m 𝑣)) = (ℤ ↑m (ℤ ↑m 𝑉)))
3	2	pweqd 4584	. . 3 ⊢ (𝑣 = 𝑉 → 𝒫 (ℤ ↑m (ℤ ↑m 𝑣)) = 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)))
4	1	xpeq1d 5695	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((ℤ ↑m 𝑣) × {𝑎}) = ((ℤ ↑m 𝑉) × {𝑎}))
5	4	eleq1d 2851	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ↔ ((ℤ ↑m 𝑉) × {𝑎}) ∈ 𝑝))
6	5	ralbidv 3191	. . . . . 6 ⊢ (𝑣 = 𝑉 → (∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ↔ ∀𝑎 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑎}) ∈ 𝑝))
7		sneq 4604	. . . . . . . . 9 ⊢ (𝑎 = 𝑖 → {𝑎} = {𝑖})
8	7	xpeq2d 5696	. . . . . . . 8 ⊢ (𝑎 = 𝑖 → ((ℤ ↑m 𝑉) × {𝑎}) = ((ℤ ↑m 𝑉) × {𝑖}))
9	8	eleq1d 2851	. . . . . . 7 ⊢ (𝑎 = 𝑖 → (((ℤ ↑m 𝑉) × {𝑎}) ∈ 𝑝 ↔ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝))
10	9	cbvralvw 3246	. . . . . 6 ⊢ (∀𝑎 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑎}) ∈ 𝑝 ↔ ∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝)
11	6, 10	bitrdi 290	. . . . 5 ⊢ (𝑣 = 𝑉 → (∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ↔ ∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝))
12	1	mpteq1d 5206	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) = (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)))
13	12	eleq1d 2851	. . . . . . 7 ⊢ (𝑣 = 𝑉 → ((𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) ∈ 𝑝))
14	13	raleqbi1dv 3336	. . . . . 6 ⊢ (𝑣 = 𝑉 → (∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ ∀𝑏 ∈ 𝑉 (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) ∈ 𝑝))
15		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑏 = 𝑗 → (𝑐‘𝑏) = (𝑐‘𝑗))
16	15	mpteq2dv 5210	. . . . . . . . 9 ⊢ (𝑏 = 𝑗 → (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) = (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑗)))
17	16	eleq1d 2851	. . . . . . . 8 ⊢ (𝑏 = 𝑗 → ((𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑗)) ∈ 𝑝))
18		fveq1 6887	. . . . . . . . . 10 ⊢ (𝑐 = 𝑥 → (𝑐‘𝑗) = (𝑥‘𝑗))
19	18	cbvmptv 5220	. . . . . . . . 9 ⊢ (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑗)) = (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗))
20	19	eleq1i 2857	. . . . . . . 8 ⊢ ((𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑗)) ∈ 𝑝 ↔ (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝)
21	17, 20	bitrdi 290	. . . . . . 7 ⊢ (𝑏 = 𝑗 → ((𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝))
22	21	cbvralvw 3246	. . . . . 6 ⊢ (∀𝑏 ∈ 𝑉 (𝑐 ∈ (ℤ ↑m 𝑉) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝)
23	14, 22	bitrdi 290	. . . . 5 ⊢ (𝑣 = 𝑉 → (∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝 ↔ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝))
24	11, 23	anbi12d 644	. . . 4 ⊢ (𝑣 = 𝑉 → ((∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ∧ ∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝) ↔ (∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝)))
25	24	anbi1d 643	. . 3 ⊢ (𝑣 = 𝑉 → (((∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ∧ ∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝)) ↔ ((∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))))
26	3, 25	rabeqbidv 3437	. 2 ⊢ (𝑣 = 𝑉 → {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑣)) ∣ ((∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ∧ ∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))} = {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)) ∣ ((∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))})
27		df-mzpcl 43487	. 2 ⊢ mzPolyCld = (𝑣 ∈ V ↦ {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑣)) ∣ ((∀𝑎 ∈ ℤ ((ℤ ↑m 𝑣) × {𝑎}) ∈ 𝑝 ∧ ∀𝑏 ∈ 𝑣 (𝑐 ∈ (ℤ ↑m 𝑣) ↦ (𝑐‘𝑏)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))})
28		ovex 7456	. . . 4 ⊢ (ℤ ↑m (ℤ ↑m 𝑉)) ∈ V
29	28	pwex 5356	. . 3 ⊢ 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)) ∈ V
30	29	rabex 5314	. 2 ⊢ {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)) ∣ ((∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))} ∈ V
31	26, 27, 30	fvmpt 6996	1 ⊢ (𝑉 ∈ V → (mzPolyCld‘𝑉) = {𝑝 ∈ 𝒫 (ℤ ↑m (ℤ ↑m 𝑉)) ∣ ((∀𝑖 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑖}) ∈ 𝑝 ∧ ∀𝑗 ∈ 𝑉 (𝑥 ∈ (ℤ ↑m 𝑉) ↦ (𝑥‘𝑗)) ∈ 𝑝) ∧ ∀𝑓 ∈ 𝑝 ∀𝑔 ∈ 𝑝 ((𝑓 ∘f + 𝑔) ∈ 𝑝 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑝))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082  {crab 3419  Vcvv 3458  𝒫 cpw 4567  {csn 4594   ↦ cmpt 5197   × cxp 5664  ‘cfv 6543  (class class class)co 7423   ∘_f cof 7685   ↑_m cmap 8833   + caddc 11121   · cmul 11123  ℤcz 12609  mzPolyCldcmzpcl 43485

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-mzpcl 43487

This theorem is used by:  elmzpcl  43490