![]() |
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 21992 | . . 3 ⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}}) |
10 | 9 | eleq2d 2818 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝐻‘𝑁) ↔ 𝑋 ∈ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})) |
11 | oveq1 7419 | . . . 4 ⊢ (𝑓 = 𝑋 → (𝑓 supp 0 ) = (𝑋 supp 0 )) | |
12 | 11 | sseq1d 4013 | . . 3 ⊢ (𝑓 = 𝑋 → ((𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁} ↔ (𝑋 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})) |
13 | 12 | elrab 3683 | . 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 395 = wceq 1540 ∈ wcel 2105 {crab 3431 ⊆ wss 3948 ◡ccnv 5675 “ cima 5679 ‘cfv 6543 (class class class)co 7412 supp csupp 8151 ↑m cmap 8826 Fincfn 8945 ℕcn 12219 ℕ0cn0 12479 Basecbs 17151 ↾s cress 17180 0gc0g 17392 Σg cgsu 17393 ℂfldccnfld 21233 mPoly cmpl 21769 mHomP cmhp 21983 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-1cn 11174 ax-addcl 11176 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-nn 12220 df-n0 12480 df-mhp 21990 |
This theorem is referenced by: ismhp2 21994 ismhp3 21995 mhpmpl 21996 mhpdeg 21997 |
Copyright terms: Public domain | W3C validator |