mdegle0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mdegle0		Structured version Visualization version GIF version

Theorem mdegle0 25586

Description: A polynomial has nonpositive degree iff it is a constant. (Contributed by Stefan O'Rear, 29-Mar-2015.)

**Hypotheses**
Ref	Expression
mdegaddle.y	⊢ 𝑌 = (𝐼 mPoly 𝑅)
mdegaddle.d	⊢ 𝐷 = (𝐼 mDeg 𝑅)
mdegaddle.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
mdegaddle.r	⊢ (𝜑 → 𝑅 ∈ Ring)
mdegle0.b	⊢ 𝐵 = (Base‘𝑌)
mdegle0.a	⊢ 𝐴 = (algSc‘𝑌)
mdegle0.f	⊢ (𝜑 → 𝐹 ∈ 𝐵)

**Assertion**
Ref	Expression
mdegle0	⊢ (𝜑 → ((𝐷‘𝐹) ≤ 0 ↔ 𝐹 = (𝐴‘(𝐹‘(𝐼 × {0})))))

Proof of Theorem mdegle0 Dummy variables 𝑥 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mdegle0.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
2		0xr 11257	. . 3 ⊢ 0 ∈ ℝ^*
3		mdegaddle.d	. . . 4 ⊢ 𝐷 = (𝐼 mDeg 𝑅)
4		mdegaddle.y	. . . 4 ⊢ 𝑌 = (𝐼 mPoly 𝑅)
5		mdegle0.b	. . . 4 ⊢ 𝐵 = (Base‘𝑌)
6		eqid 2732	. . . 4 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
7		eqid 2732	. . . 4 ⊢ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} = {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}
8		eqid 2732	. . . 4 ⊢ (𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏)) = (𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))
9	3, 4, 5, 6, 7, 8	mdegleb 25573	. . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 0 ∈ ℝ^*) → ((𝐷‘𝐹) ≤ 0 ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅))))
10	1, 2, 9	sylancl 586	. 2 ⊢ (𝜑 → ((𝐷‘𝐹) ≤ 0 ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅))))
11	7, 8	tdeglem1 25564	. . . . . . . . . 10 ⊢ (𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏)):{𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}⟶ℕ₀
12	11	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏)):{𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}⟶ℕ₀)
13	12	ffvelcdmda 7083	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℕ₀)
14		nn0re 12477	. . . . . . . . 9 ⊢ (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℕ₀ → ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℝ)
15		nn0ge0 12493	. . . . . . . . 9 ⊢ (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℕ₀ → 0 ≤ ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥))
16	14, 15	jca 512	. . . . . . . 8 ⊢ (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℕ₀ → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℝ ∧ 0 ≤ ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥)))
17		ne0gt0 11315	. . . . . . . 8 ⊢ ((((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ∈ ℝ ∧ 0 ≤ ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥)) → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ≠ 0 ↔ 0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥)))
18	13, 16, 17	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ≠ 0 ↔ 0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥)))
19	7, 8	tdeglem4 25568	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) = 0 ↔ 𝑥 = (𝐼 × {0})))
20	19	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) = 0 ↔ 𝑥 = (𝐼 × {0})))
21	20	necon3abid 2977	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → (((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ≠ 0 ↔ ¬ 𝑥 = (𝐼 × {0})))
22	18, 21	bitr3d 280	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → (0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) ↔ ¬ 𝑥 = (𝐼 × {0})))
23	22	imbi1d 341	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → ((0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅)) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
24		eqeq2 2744	. . . . . . . 8 ⊢ ((𝐹‘(𝐼 × {0})) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) → ((𝐹‘𝑥) = (𝐹‘(𝐼 × {0})) ↔ (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
25	24	bibi1d 343	. . . . . . 7 ⊢ ((𝐹‘(𝐼 × {0})) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) → (((𝐹‘𝑥) = (𝐹‘(𝐼 × {0})) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))) ↔ ((𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅)))))
26		eqeq2 2744	. . . . . . . 8 ⊢ ((0_g‘𝑅) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) → ((𝐹‘𝑥) = (0_g‘𝑅) ↔ (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
27	26	bibi1d 343	. . . . . . 7 ⊢ ((0_g‘𝑅) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) → (((𝐹‘𝑥) = (0_g‘𝑅) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))) ↔ ((𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅)))))
28		fveq2 6888	. . . . . . . . 9 ⊢ (𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (𝐹‘(𝐼 × {0})))
29		pm2.24 124	. . . . . . . . 9 ⊢ (𝑥 = (𝐼 × {0}) → (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅)))
30	28, 29	2thd 264	. . . . . . . 8 ⊢ (𝑥 = (𝐼 × {0}) → ((𝐹‘𝑥) = (𝐹‘(𝐼 × {0})) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
31	30	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = (𝐼 × {0})) → ((𝐹‘𝑥) = (𝐹‘(𝐼 × {0})) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
32		biimt 360	. . . . . . . 8 ⊢ (¬ 𝑥 = (𝐼 × {0}) → ((𝐹‘𝑥) = (0_g‘𝑅) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
33	32	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑥 = (𝐼 × {0})) → ((𝐹‘𝑥) = (0_g‘𝑅) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
34	25, 27, 31, 33	ifbothda 4565	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
35	34	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → ((𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)) ↔ (¬ 𝑥 = (𝐼 × {0}) → (𝐹‘𝑥) = (0_g‘𝑅))))
36	23, 35	bitr4d 281	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}) → ((0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅)) ↔ (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
37	36	ralbidva 3175	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅)) ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
38		eqid 2732	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅)
39	4, 38, 5, 7, 1	mplelf 21548	. . . . . 6 ⊢ (𝜑 → 𝐹:{𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin}⟶(Base‘𝑅))
40	39	feqmptd 6957	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (𝐹‘𝑥)))
41		mdegle0.a	. . . . . 6 ⊢ 𝐴 = (algSc‘𝑌)
42		mdegaddle.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
43		mdegaddle.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Ring)
44	7	psrbag0 21614	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → (𝐼 × {0}) ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin})
45	42, 44	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐼 × {0}) ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin})
46	39, 45	ffvelcdmd 7084	. . . . . 6 ⊢ (𝜑 → (𝐹‘(𝐼 × {0})) ∈ (Base‘𝑅))
47	4, 7, 6, 38, 41, 42, 43, 46	mplascl 21616	. . . . 5 ⊢ (𝜑 → (𝐴‘(𝐹‘(𝐼 × {0}))) = (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
48	40, 47	eqeq12d 2748	. . . 4 ⊢ (𝜑 → (𝐹 = (𝐴‘(𝐹‘(𝐼 × {0}))) ↔ (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (𝐹‘𝑥)) = (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅)))))
49		fvex 6901	. . . . . 6 ⊢ (𝐹‘𝑥) ∈ V
50	49	rgenw 3065	. . . . 5 ⊢ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) ∈ V
51		mpteqb 7014	. . . . 5 ⊢ (∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) ∈ V → ((𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (𝐹‘𝑥)) = (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))) ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
52	50, 51	mp1i 13	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (𝐹‘𝑥)) = (𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))) ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
53	48, 52	bitrd 278	. . 3 ⊢ (𝜑 → (𝐹 = (𝐴‘(𝐹‘(𝐼 × {0}))) ↔ ∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (𝐹‘𝑥) = if(𝑥 = (𝐼 × {0}), (𝐹‘(𝐼 × {0})), (0_g‘𝑅))))
54	37, 53	bitr4d 281	. 2 ⊢ (𝜑 → (∀𝑥 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} (0 < ((𝑏 ∈ {𝑎 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑎 “ ℕ) ∈ Fin} ↦ (ℂ_fld Σ_g 𝑏))‘𝑥) → (𝐹‘𝑥) = (0_g‘𝑅)) ↔ 𝐹 = (𝐴‘(𝐹‘(𝐼 × {0})))))
55	10, 54	bitrd 278	1 ⊢ (𝜑 → ((𝐷‘𝐹) ≤ 0 ↔ 𝐹 = (𝐴‘(𝐹‘(𝐼 × {0})))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 {crab 3432 Vcvv 3474 ifcif 4527 {csn 4627 class class class wbr 5147 ↦ cmpt 5230 × cxp 5673 ^◡ccnv 5674 “ cima 5678 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ↑_m cmap 8816 Fincfn 8935 ℝcr 11105 0cc0 11106 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 ℕcn 12208 ℕ₀cn0 12468 Basecbs 17140 0_gc0g 17381 Σ_g cgsu 17382 Ringcrg 20049 ℂ_fldccnfld 20936 algSccascl 21398 mPoly cmpl 21450 mDeg cmdg 25559

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 ax-mulf 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-ofr 7667 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-pm 8819 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-sup 9433 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-hom 17217 df-cco 17218 df-0g 17383 df-gsum 17384 df-prds 17389 df-pws 17391 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-submnd 18668 df-grp 18818 df-minusg 18819 df-mulg 18945 df-subg 18997 df-ghm 19084 df-cntz 19175 df-cmn 19644 df-abl 19645 df-mgp 19982 df-ur 19999 df-ring 20051 df-cring 20052 df-subrg 20353 df-cnfld 20937 df-ascl 21401 df-psr 21453 df-mpl 21455 df-mdeg 25561

This theorem is referenced by: deg1le0 25620

W3C validator