Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mplrcl | Structured version Visualization version GIF version |
Description: Reverse closure for the polynomial index set. (Contributed by Stefan O'Rear, 19-Mar-2015.) (Revised by Mario Carneiro, 30-Aug-2015.) |
Ref | Expression |
---|---|
mplrcl.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
mplrcl.b | ⊢ 𝐵 = (Base‘𝑃) |
Ref | Expression |
---|---|
mplrcl | ⊢ (𝑋 ∈ 𝐵 → 𝐼 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mplrcl.p | . 2 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
2 | mplrcl.b | . 2 ⊢ 𝐵 = (Base‘𝑃) | |
3 | reldmmpl 19427 | . 2 ⊢ Rel dom mPoly | |
4 | 1, 2, 3 | strov2rcl 15922 | 1 ⊢ (𝑋 ∈ 𝐵 → 𝐼 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 mPoly cmpl 19353 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-slot 15861 df-base 15863 df-mpl 19358 |
This theorem is referenced by: mdegleb 23824 mdeglt 23825 mdegldg 23826 mdegxrcl 23827 mdegcl 23829 mdegnn0cl 23831 |
Copyright terms: Public domain | W3C validator |