Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mzpcl1 Structured version   Visualization version   GIF version

Theorem mzpcl1 41452
Description: Defining property 1 of a polynomially closed function set 𝑃: it contains all constant functions. (Contributed by Stefan O'Rear, 4-Oct-2014.)
Assertion
Ref Expression
mzpcl1 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → ((ℤ ↑m 𝑉) × {𝐹}) ∈ 𝑃)

Proof of Theorem mzpcl1
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 485 . 2 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → 𝐹 ∈ ℤ)
2 simpl 483 . . . 4 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → 𝑃 ∈ (mzPolyCld‘𝑉))
3 elfvex 6926 . . . . . 6 (𝑃 ∈ (mzPolyCld‘𝑉) → 𝑉 ∈ V)
43adantr 481 . . . . 5 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → 𝑉 ∈ V)
5 elmzpcl 41449 . . . . 5 (𝑉 ∈ V → (𝑃 ∈ (mzPolyCld‘𝑉) ↔ (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔𝑓)) ∈ 𝑃) ∧ ∀𝑓𝑃𝑔𝑃 ((𝑓f + 𝑔) ∈ 𝑃 ∧ (𝑓f · 𝑔) ∈ 𝑃)))))
64, 5syl 17 . . . 4 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → (𝑃 ∈ (mzPolyCld‘𝑉) ↔ (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔𝑓)) ∈ 𝑃) ∧ ∀𝑓𝑃𝑔𝑃 ((𝑓f + 𝑔) ∈ 𝑃 ∧ (𝑓f · 𝑔) ∈ 𝑃)))))
72, 6mpbid 231 . . 3 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → (𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔𝑓)) ∈ 𝑃) ∧ ∀𝑓𝑃𝑔𝑃 ((𝑓f + 𝑔) ∈ 𝑃 ∧ (𝑓f · 𝑔) ∈ 𝑃))))
8 simprll 777 . . 3 ((𝑃 ⊆ (ℤ ↑m (ℤ ↑m 𝑉)) ∧ ((∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ∧ ∀𝑓𝑉 (𝑔 ∈ (ℤ ↑m 𝑉) ↦ (𝑔𝑓)) ∈ 𝑃) ∧ ∀𝑓𝑃𝑔𝑃 ((𝑓f + 𝑔) ∈ 𝑃 ∧ (𝑓f · 𝑔) ∈ 𝑃))) → ∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃)
97, 8syl 17 . 2 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → ∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃)
10 sneq 4637 . . . . 5 (𝑓 = 𝐹 → {𝑓} = {𝐹})
1110xpeq2d 5705 . . . 4 (𝑓 = 𝐹 → ((ℤ ↑m 𝑉) × {𝑓}) = ((ℤ ↑m 𝑉) × {𝐹}))
1211eleq1d 2818 . . 3 (𝑓 = 𝐹 → (((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃 ↔ ((ℤ ↑m 𝑉) × {𝐹}) ∈ 𝑃))
1312rspcva 3610 . 2 ((𝐹 ∈ ℤ ∧ ∀𝑓 ∈ ℤ ((ℤ ↑m 𝑉) × {𝑓}) ∈ 𝑃) → ((ℤ ↑m 𝑉) × {𝐹}) ∈ 𝑃)
141, 9, 13syl2anc 584 1 ((𝑃 ∈ (mzPolyCld‘𝑉) ∧ 𝐹 ∈ ℤ) → ((ℤ ↑m 𝑉) × {𝐹}) ∈ 𝑃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3061  Vcvv 3474  wss 3947  {csn 4627  cmpt 5230   × cxp 5673  cfv 6540  (class class class)co 7405  f cof 7664  m cmap 8816   + caddc 11109   · cmul 11111  cz 12554  mzPolyCldcmzpcl 41444
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 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426
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 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-iota 6492  df-fun 6542  df-fv 6548  df-ov 7408  df-mzpcl 41446
This theorem is referenced by:  mzpincl  41457  mzpconst  41458
  Copyright terms: Public domain W3C validator