Metamath Proof Explorer


Theorem selvply1rhmlem1

Description: Lemma for selvply1rhm . (Contributed by Thierry Arnoux, 4-May-2026)

Ref Expression
Hypotheses selvply1rhm.1 ⊢ B = Base P
selvply1rhm.2 ⊢ P = I mPoly R
selvply1rhm.3 ⊢ U = I ∖ X mPoly R
selvply1rhm.4 ⊢ Q = Poly 1 ⁡ U
selvply1rhm.5 ⊢ H = f ∈ B ⟼ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅
selvply1rhm.6 ⊢ φ → I ∈ V
selvply1rhm.7 ⊢ φ → X ∈ I
selvply1rhm.8 ⊢ φ → R ∈ CRing
Assertion selvply1rhmlem1 ⊢ φ → H : B ⟶ Base Q

Proof

Step Hyp Ref Expression
1 selvply1rhm.1 ⊢ B = Base P
2 selvply1rhm.2 ⊢ P = I mPoly R
3 selvply1rhm.3 ⊢ U = I ∖ X mPoly R
4 selvply1rhm.4 ⊢ Q = Poly 1 ⁡ U
5 selvply1rhm.5 ⊢ H = f ∈ B ⟼ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅
6 selvply1rhm.6 ⊢ φ → I ∈ V
7 selvply1rhm.7 ⊢ φ → X ∈ I
8 selvply1rhm.8 ⊢ φ → R ∈ CRing
9 fvexd ⊢ φ ∧ f ∈ B → Base U ∈ V
10 ovexd ⊢ φ ∧ f ∈ B → ℕ 0 1 𝑜 ∈ V
11 eqid ⊢ X mPoly U = X mPoly U
12 eqid ⊢ Base U = Base U
13 eqid ⊢ Base X mPoly U = Base X mPoly U
14 eqid ⊢ h ∈ ℕ 0 X | finSupp 0 ⁡ h = h ∈ ℕ 0 X | finSupp 0 ⁡ h
15 14 psrbasfsupp ⊢ h ∈ ℕ 0 X | finSupp 0 ⁡ h = h ∈ ℕ 0 X | h -1 ℕ ∈ Fin
16 8 adantr ⊢ φ ∧ f ∈ B → R ∈ CRing
17 7 snssd ⊢ φ → X ⊆ I
18 17 adantr ⊢ φ ∧ f ∈ B → X ⊆ I
19 simpr ⊢ φ ∧ f ∈ B → f ∈ B
20 2 1 3 11 13 16 18 19 selvcl ⊢ φ ∧ f ∈ B → I selectVars R ⁡ X ⁡ f ∈ Base X mPoly U
21 11 12 13 15 20 mplelf ⊢ φ ∧ f ∈ B → I selectVars R ⁡ X ⁡ f : h ∈ ℕ 0 X | finSupp 0 ⁡ h ⟶ Base U
22 21 adantr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → I selectVars R ⁡ X ⁡ f : h ∈ ℕ 0 X | finSupp 0 ⁡ h ⟶ Base U
23 breq1 ⊢ h = X n ⁡ ∅ → finSupp 0 ⁡ h ↔ finSupp 0 ⁡ X n ⁡ ∅
24 nn0ex ⊢ ℕ 0 ∈ V
25 24 a1i ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → ℕ 0 ∈ V
26 snex ⊢ X ∈ V
27 26 a1i ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → X ∈ V
28 7 ad2antrr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → X ∈ I
29 simpr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → n ∈ ℕ 0 1 𝑜
30 29 elmaprd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → n : 1 𝑜 ⟶ ℕ 0
31 0lt1o ⊢ ∅ ∈ 1 𝑜
32 31 a1i ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → ∅ ∈ 1 𝑜
33 30 32 ffvelcdmd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → n ⁡ ∅ ∈ ℕ 0
34 28 33 fsnd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → X n ⁡ ∅ : X ⟶ ℕ 0
35 25 27 34 elmapdd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → X n ⁡ ∅ ∈ ℕ 0 X
36 c0ex ⊢ 0 ∈ V
37 36 a1i ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → 0 ∈ V
38 snopfsupp ⊢ X ∈ I ∧ n ⁡ ∅ ∈ ℕ 0 ∧ 0 ∈ V → finSupp 0 ⁡ X n ⁡ ∅
39 28 33 37 38 syl3anc ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → finSupp 0 ⁡ X n ⁡ ∅
40 23 35 39 elrabd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → X n ⁡ ∅ ∈ h ∈ ℕ 0 X | finSupp 0 ⁡ h
41 22 40 ffvelcdmd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 → I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base U
42 41 fmpttd ⊢ φ ∧ f ∈ B → n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ : ℕ 0 1 𝑜 ⟶ Base U
43 9 10 42 elmapdd ⊢ φ ∧ f ∈ B → n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base U ℕ 0 1 𝑜
44 eqid ⊢ 1 𝑜 mPwSer U = 1 𝑜 mPwSer U
45 psr1baslem ⊢ ℕ 0 1 𝑜 = h ∈ ℕ 0 1 𝑜 | h -1 ℕ ∈ Fin
46 eqid ⊢ Base 1 𝑜 mPwSer U = Base 1 𝑜 mPwSer U
47 1oex ⊢ 1 𝑜 ∈ V
48 47 a1i ⊢ φ ∧ f ∈ B → 1 𝑜 ∈ V
49 44 12 45 46 48 psrbas ⊢ φ ∧ f ∈ B → Base 1 𝑜 mPwSer U = Base U ℕ 0 1 𝑜
50 43 49 eleqtrrd ⊢ φ ∧ f ∈ B → n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base 1 𝑜 mPwSer U
51 21 40 cofmpt ⊢ φ ∧ f ∈ B → I selectVars R ⁡ X ⁡ f ∘ n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅ = n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅
52 eqid ⊢ 0 U = 0 U
53 11 13 52 20 mplelsfi ⊢ φ ∧ f ∈ B → finSupp 0 U⁡ I selectVars R ⁡ X ⁡ f
54 35 ralrimiva ⊢ φ ∧ f ∈ B → ∀ n ∈ ℕ 0 1 𝑜 X n ⁡ ∅ ∈ ℕ 0 X
55 28 ad2antrr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → X ∈ I
56 fvexd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n ⁡ ∅ ∈ V
57 opex ⊢ X n ⁡ ∅ ∈ V
58 57 sneqr ⊢ X n ⁡ ∅ = X m ⁡ ∅ → X n ⁡ ∅ = X m ⁡ ∅
59 58 adantl ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → X n ⁡ ∅ = X m ⁡ ∅
60 opthg ⊢ X ∈ I ∧ n ⁡ ∅ ∈ V → X n ⁡ ∅ = X m ⁡ ∅ ↔ X = X ∧ n ⁡ ∅ = m ⁡ ∅
61 60 simplbda ⊢ X ∈ I ∧ n ⁡ ∅ ∈ V ∧ X n ⁡ ∅ = X m ⁡ ∅ → n ⁡ ∅ = m ⁡ ∅
62 55 56 59 61 syl21anc ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n ⁡ ∅ = m ⁡ ∅
63 0ex ⊢ ∅ ∈ V
64 63 a1i ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → ∅ ∈ V
65 df1o2 ⊢ 1 𝑜 = ∅
66 30 ad2antrr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n : 1 𝑜 ⟶ ℕ 0
67 66 ffnd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n Fn 1 𝑜
68 simplr ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → m ∈ ℕ 0 1 𝑜
69 68 elmaprd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → m : 1 𝑜 ⟶ ℕ 0
70 69 ffnd ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → m Fn 1 𝑜
71 64 65 67 70 fsneq ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n = m ↔ n ⁡ ∅ = m ⁡ ∅
72 62 71 mpbird ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 ∧ X n ⁡ ∅ = X m ⁡ ∅ → n = m
73 72 ex ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 → X n ⁡ ∅ = X m ⁡ ∅ → n = m
74 73 anasss ⊢ φ ∧ f ∈ B ∧ n ∈ ℕ 0 1 𝑜 ∧ m ∈ ℕ 0 1 𝑜 → X n ⁡ ∅ = X m ⁡ ∅ → n = m
75 74 ralrimivva ⊢ φ ∧ f ∈ B → ∀ n ∈ ℕ 0 1 𝑜 ∀ m ∈ ℕ 0 1 𝑜 X n ⁡ ∅ = X m ⁡ ∅ → n = m
76 eqid ⊢ n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅ = n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅
77 fveq1 ⊢ n = m → n ⁡ ∅ = m ⁡ ∅
78 77 opeq2d ⊢ n = m → X n ⁡ ∅ = X m ⁡ ∅
79 78 sneqd ⊢ n = m → X n ⁡ ∅ = X m ⁡ ∅
80 76 79 f1mpt ⊢ n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅ : ℕ 0 1 𝑜 ⟶ 1-1 ℕ 0 X ↔ ∀ n ∈ ℕ 0 1 𝑜 X n ⁡ ∅ ∈ ℕ 0 X ∧ ∀ n ∈ ℕ 0 1 𝑜 ∀ m ∈ ℕ 0 1 𝑜 X n ⁡ ∅ = X m ⁡ ∅ → n = m
81 54 75 80 sylanbrc ⊢ φ ∧ f ∈ B → n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅ : ℕ 0 1 𝑜 ⟶ 1-1 ℕ 0 X
82 fvexd ⊢ φ ∧ f ∈ B → 0 U ∈ V
83 53 81 82 20 fsuppco ⊢ φ ∧ f ∈ B → finSupp 0 U⁡ I selectVars R ⁡ X ⁡ f ∘ n ∈ ℕ 0 1 𝑜 ⟼ X n ⁡ ∅
84 51 83 eqbrtrrd ⊢ φ ∧ f ∈ B → finSupp 0 U⁡ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅
85 eqid ⊢ 1 𝑜 mPoly U = 1 𝑜 mPoly U
86 eqid ⊢ Base Q = Base Q
87 4 86 ply1bas ⊢ Base Q = Base 1 𝑜 mPoly U
88 85 44 46 52 87 mplelbas ⊢ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base Q ↔ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base 1 𝑜 mPwSer U ∧ finSupp 0 U⁡ n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅
89 50 84 88 sylanbrc ⊢ φ ∧ f ∈ B → n ∈ ℕ 0 1 𝑜 ⟼ I selectVars R ⁡ X ⁡ f ⁡ X n ⁡ ∅ ∈ Base Q
90 89 5 fmptd ⊢ φ → H : B ⟶ Base Q