Theorem mzpcl2 41458

Description: Defining property 2 of a polynomially closed function set 𝑃: it contains all projections. (Contributed by Stefan O'Rear, 4-Oct-2014.)

Assertion

Ref	Expression
mzpcl2	⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝐹)) ∈ 𝑃)

Distinct variable groups:   𝑔,𝑉   𝑃,𝑔   𝑔,𝐹

Proof of Theorem mzpcl2

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 485	. 2 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → 𝐹 ∈ 𝑉)
2		simpl 483	. . . 4 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → 𝑃 ∈ (mzPolyCld‘𝑉))
3		elfvex 6929	. . . . . 6 ⊢ (𝑃 ∈ (mzPolyCld‘𝑉) → 𝑉 ∈ V)
4	3	adantr 481	. . . . 5 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → 𝑉 ∈ V)
5		elmzpcl 41454	. . . . 5 ⊢ (𝑉 ∈ V → (𝑃 ∈ (mzPolyCld‘𝑉) ↔ (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃) ∧ ∀𝑓 ∈ 𝑃 ∀𝑔 ∈ 𝑃 ((𝑓 ∘f + 𝑔) ∈ 𝑃 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑃)))))
6	4, 5	syl 17	. . . 4 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → (𝑃 ∈ (mzPolyCld‘𝑉) ↔ (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃) ∧ ∀𝑓 ∈ 𝑃 ∀𝑔 ∈ 𝑃 ((𝑓 ∘f + 𝑔) ∈ 𝑃 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑃)))))
7	2, 6	mpbid 231	. . 3 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃) ∧ ∀𝑓 ∈ 𝑃 ∀𝑔 ∈ 𝑃 ((𝑓 ∘f + 𝑔) ∈ 𝑃 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑃))))
8		simprlr 778	. . 3 ⊢ ((𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃) ∧ ∀𝑓 ∈ 𝑃 ∀𝑔 ∈ 𝑃 ((𝑓 ∘f + 𝑔) ∈ 𝑃 ∧ (𝑓 ∘f · 𝑔) ∈ 𝑃))) → ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃)
9	7, 8	syl 17	. 2 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃)
10		fveq2 6891	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑔‘𝑓) = (𝑔‘𝐹))
11	10	mpteq2dv 5250	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) = (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝐹)))
12	11	eleq1d 2818	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃 ↔ (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝐹)) ∈ 𝑃))
13	12	rspcva 3610	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ ∀𝑓 ∈ 𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝑓)) ∈ 𝑃) → (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝐹)) ∈ 𝑃)
14	1, 9, 13	syl2anc 584	1 ⊢ ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ 𝑉) → (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔‘𝐹)) ∈ 𝑃)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061  Vcvv 3474   ⊆ wss 3948  {csn 4628   ↦ cmpt 5231   × cxp 5674  ‘cfv 6543  (class class class)co 7408   ∘_f cof 7667   ↑_m cmap 8819   + caddc 11112   · cmul 11114  ℤcz 12557  mzPolyCldcmzpcl 41449

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-iota 6495  df-fun 6545  df-fv 6551  df-ov 7411  df-mzpcl 41451

This theorem is referenced by:  mzpincl  41462  mzpproj  41465