Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ismhp | Structured version Visualization version GIF version |
Description: Property of being a homogeneous polynomial. (Contributed by Steven Nguyen, 25-Aug-2023.) |
Ref | Expression |
---|---|
mhpfval.h | ⊢ 𝐻 = (𝐼 mHomP 𝑅) |
mhpfval.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
mhpfval.b | ⊢ 𝐵 = (Base‘𝑃) |
mhpfval.0 | ⊢ 0 = (0g‘𝑅) |
mhpfval.d | ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
mhpfval.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
mhpfval.r | ⊢ (𝜑 → 𝑅 ∈ 𝑊) |
mhpval.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
Ref | Expression |
---|---|
ismhp | ⊢ (𝜑 → (𝑋 ∈ (𝐻‘𝑁) ↔ (𝑋 ∈ 𝐵 ∧ (𝑋 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mhpfval.h | . . . 4 ⊢ 𝐻 = (𝐼 mHomP 𝑅) | |
2 | mhpfval.p | . . . 4 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
3 | mhpfval.b | . . . 4 ⊢ 𝐵 = (Base‘𝑃) | |
4 | mhpfval.0 | . . . 4 ⊢ 0 = (0g‘𝑅) | |
5 | mhpfval.d | . . . 4 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} | |
6 | mhpfval.i | . . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
7 | mhpfval.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑊) | |
8 | mhpval.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | mhpval 21330 | . . 3 ⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}}) |
10 | 9 | eleq2d 2824 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝐻‘𝑁) ↔ 𝑋 ∈ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})) |
11 | oveq1 7282 | . . . 4 ⊢ (𝑓 = 𝑋 → (𝑓 supp 0 ) = (𝑋 supp 0 )) | |
12 | 11 | sseq1d 3952 | . . 3 ⊢ (𝑓 = 𝑋 → ((𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁} ↔ (𝑋 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})) |
13 | 12 | elrab 3624 | . 2 ⊢ (𝑋 ∈ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}} ↔ (𝑋 ∈ 𝐵 ∧ (𝑋 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})) |
14 | 10, 13 | bitrdi 287 | 1 ⊢ (𝜑 → (𝑋 ∈ (𝐻‘𝑁) ↔ (𝑋 ∈ 𝐵 ∧ (𝑋 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {crab 3068 ⊆ wss 3887 ◡ccnv 5588 “ cima 5592 ‘cfv 6433 (class class class)co 7275 supp csupp 7977 ↑m cmap 8615 Fincfn 8733 ℕcn 11973 ℕ0cn0 12233 Basecbs 16912 ↾s cress 16941 0gc0g 17150 Σg cgsu 17151 ℂfldccnfld 20597 mPoly cmpl 21109 mHomP cmhp 21319 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-1cn 10929 ax-addcl 10931 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-nn 11974 df-n0 12234 df-mhp 21323 |
This theorem is referenced by: ismhp2 21332 ismhp3 21333 mhpmpl 21334 mhpdeg 21335 |
Copyright terms: Public domain | W3C validator |