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

Theorem itgocn 40108
Description: All integral elements are complex numbers. (Contributed by Stefan O'Rear, 27-Nov-2014.)
Assertion
Ref Expression
itgocn (IntgOver‘𝑆) ⊆ ℂ

Proof of Theorem itgocn
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-itgo 40103 . . . . 5 IntgOver = (𝑎 ∈ 𝒫 ℂ ↦ {𝑏 ∈ ℂ ∣ ∃𝑐 ∈ (Poly‘𝑎)((𝑐𝑏) = 0 ∧ ((coeff‘𝑐)‘(deg‘𝑐)) = 1)})
21dmmptss 6062 . . . 4 dom IntgOver ⊆ 𝒫 ℂ
32sseli 3911 . . 3 (𝑆 ∈ dom IntgOver → 𝑆 ∈ 𝒫 ℂ)
4 cnex 10607 . . . . 5 ℂ ∈ V
54elpw2 5212 . . . 4 (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
6 itgoval 40105 . . . . 5 (𝑆 ⊆ ℂ → (IntgOver‘𝑆) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
7 ssrab2 4007 . . . . 5 {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘𝑆)((𝑏𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ⊆ ℂ
86, 7eqsstrdi 3969 . . . 4 (𝑆 ⊆ ℂ → (IntgOver‘𝑆) ⊆ ℂ)
95, 8sylbi 220 . . 3 (𝑆 ∈ 𝒫 ℂ → (IntgOver‘𝑆) ⊆ ℂ)
103, 9syl 17 . 2 (𝑆 ∈ dom IntgOver → (IntgOver‘𝑆) ⊆ ℂ)
11 ndmfv 6675 . . 3 𝑆 ∈ dom IntgOver → (IntgOver‘𝑆) = ∅)
12 0ss 4304 . . 3 ∅ ⊆ ℂ
1311, 12eqsstrdi 3969 . 2 𝑆 ∈ dom IntgOver → (IntgOver‘𝑆) ⊆ ℂ)
1410, 13pm2.61i 185 1 (IntgOver‘𝑆) ⊆ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1538  wcel 2111  wrex 3107  {crab 3110  wss 3881  c0 4243  𝒫 cpw 4497  dom cdm 5519  cfv 6324  cc 10524  0cc0 10526  1c1 10527  Polycply 24781  coeffccoe 24783  degcdgr 24784  IntgOvercitgo 40101
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-cnex 10582
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fv 6332  df-itgo 40103
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator