Theorem irngnminplynz 34111

Description: Integral elements have nonzero minimal polynomials. (Contributed by Thierry Arnoux, 22-Mar-2025.)

Hypotheses

Ref	Expression
irngnminplynz.z	⊢ 𝑍 = (0g‘(Poly1‘𝐸))
irngnminplynz.e	⊢ (𝜑 → 𝐸 ∈ Field)
irngnminplynz.f	⊢ (𝜑 → 𝐹 ∈ (SubDRing‘𝐸))
irngnminplynz.m	⊢ 𝑀 = (𝐸 minPoly 𝐹)
irngnminplynz.a	⊢ (𝜑 → 𝐴 ∈ (𝐸 IntgRing 𝐹))

Assertion

Ref	Expression
irngnminplynz	⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)

Proof of Theorem irngnminplynz

Dummy variables 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		irngnminplynz.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (SubDRing‘𝐸))
2		sdrgsubrg 20903	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
3	1, 2	syl 18	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubRing‘𝐸))
4		eqid 2763	. . . . . 6 ⊢ (𝐸 ↾s 𝐹) = (𝐸 ↾s 𝐹)
5	4	subrgring 20682	. . . . 5 ⊢ (𝐹 ∈ (SubRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ Ring)
6	3, 5	syl 18	. . . 4 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Ring)
7		eqid 2763	. . . . 5 ⊢ (Poly1‘(𝐸 ↾s 𝐹)) = (Poly1‘(𝐸 ↾s 𝐹))
8	7	ply1ring 22416	. . . 4 ⊢ ((𝐸 ↾s 𝐹) ∈ Ring → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
9	6, 8	syl 18	. . 3 ⊢ (𝜑 → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
10		eqid 2763	. . . . . 6 ⊢ (𝐸 evalSub1 𝐹) = (𝐸 evalSub1 𝐹)
11		eqid 2763	. . . . . 6 ⊢ (Base‘𝐸) = (Base‘𝐸)
12		irngnminplynz.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ Field)
13	12	fldcrngd 20851	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ CRing)
14		eqid 2763	. . . . . . . 8 ⊢ (0g‘𝐸) = (0g‘𝐸)
15	10, 4, 11, 14, 13, 3	irngssv 34087	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) ⊆ (Base‘𝐸))
16		irngnminplynz.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝐸 IntgRing 𝐹))
17	15, 16	sseldd 3938	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐸))
18		eqid 2763	. . . . . 6 ⊢ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}
19	10, 7, 11, 13, 3, 17, 14, 18	ply1annidl 34101	. . . . 5 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))))
20		eqid 2763	. . . . . 6 ⊢ (Base‘(Poly1‘(𝐸 ↾s 𝐹))) = (Base‘(Poly1‘(𝐸 ↾s 𝐹)))
21		eqid 2763	. . . . . 6 ⊢ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))) = (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹)))
22	20, 21	lidlss 21345	. . . . 5 ⊢ ({𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ⊆ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
23	19, 22	syl 18	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ⊆ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
24	4	sdrgdrng 20902	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ DivRing)
25	1, 24	syl 18	. . . . 5 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ DivRing)
26		eqid 2763	. . . . . 6 ⊢ (idlGen1p‘(𝐸 ↾s 𝐹)) = (idlGen1p‘(𝐸 ↾s 𝐹))
27	7, 26, 21	ig1pcl 26345	. . . . 5 ⊢ (((𝐸 ↾s 𝐹) ∈ DivRing ∧ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹)))) → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
28	25, 19, 27	syl2anc 595	. . . 4 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
29	23, 28	sseldd 3938	. . 3 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
30		eqid 2763	. . . . 5 ⊢ (RSpan‘(Poly1‘(𝐸 ↾s 𝐹))) = (RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))
31	10, 7, 11, 12, 1, 17, 14, 18, 30, 26	ply1annig1p 34103	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}))
32		fveq2 6881	. . . . . . . . 9 ⊢ (𝑞 = 𝑝 → ((𝐸 evalSub1 𝐹)‘𝑞) = ((𝐸 evalSub1 𝐹)‘𝑝))
33	32	fveq1d 6883	. . . . . . . 8 ⊢ (𝑞 = 𝑝 → (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴))
34	33	eqeq1d 2765	. . . . . . 7 ⊢ (𝑞 = 𝑝 → ((((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸) ↔ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸)))
35		simplr 780	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}))
36	35	eldifad 3917	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ dom (𝐸 evalSub1 𝐹))
37	13	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐸 ∈ CRing)
38	3	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐹 ∈ (SubRing‘𝐸))
39	10, 7, 20, 13, 3	evls1dm 33860	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
40	39	ad2antrr 738	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
41	36, 40	eleqtrd 2865	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
42	10, 7, 20, 37, 38, 11, 41	evls1fvf 33861	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝):(Base‘𝐸)⟶(Base‘𝐸))
43	42	ffnd 6706	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸))
44		elpreima 7053	. . . . . . . . . 10 ⊢ (((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) → (𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ (𝐴 ∈ (Base‘𝐸) ∧ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})))
45	44	simplbda 504	. . . . . . . . 9 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
46	43, 45	sylancom 599	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
47		elsni 4606	. . . . . . . 8 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)} → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
48	46, 47	syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
49	34, 36, 48	elrabd 3652	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
50		eldifsni 4758	. . . . . . . . 9 ⊢ (𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}) → 𝑝 ≠ 𝑍)
51	35, 50	syl 18	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ 𝑍)
52		eqid 2763	. . . . . . . . . 10 ⊢ (Poly1‘𝐸) = (Poly1‘𝐸)
53		irngnminplynz.z	. . . . . . . . . 10 ⊢ 𝑍 = (0g‘(Poly1‘𝐸))
54	52, 4, 7, 20, 3, 53	ressply10g 33866	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
55	54	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
56	51, 55	neeqtrd 3027	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
57		nelsn 4632	. . . . . . 7 ⊢ (𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
58	56, 57	syl 18	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
59		nelne1 3055	. . . . . 6 ⊢ ((𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∧ ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))}) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
60	49, 58, 59	syl2anc 595	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
61	10, 53, 14, 12, 1	irngnzply1 34090	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) = ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
62	16, 61	eleqtrd 2865	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
63		eliun 4960	. . . . . 6 ⊢ (𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
64	62, 63	sylib 221	. . . . 5 ⊢ (𝜑 → ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
65	60, 64	r19.29a 3173	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
66	31, 65	eqnetrrd 3026	. . 3 ⊢ (𝜑 → ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
67		eqid 2763	. . . . 5 ⊢ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) = (0g‘(Poly1‘(𝐸 ↾s 𝐹)))
68	20, 67, 30	pidlnzb 33739	. . . 4 ⊢ (((Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring ∧ ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹)))) → (((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) ↔ ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))}))
69	68	biimpar 482	. . 3 ⊢ ((((Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring ∧ ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹)))) ∧ ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))}) → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
70	9, 29, 66, 69	syl21anc 850	. 2 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
71		irngnminplynz.m	. . 3 ⊢ 𝑀 = (𝐸 minPoly 𝐹)
72	10, 7, 11, 12, 1, 17, 14, 18, 30, 26, 71	minplyval 34104	. 2 ⊢ (𝜑 → (𝑀‘𝐴) = ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}))
73	70, 72, 54	3netr4d 3035	1 ⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∃wrex 3089  {crab 3416   ∖ cdif 3902   ⊆ wss 3905  {csn 4589  ∪ ciun 4956  ^◡ccnv 5660  dom cdm 5661   “ cima 5664   Fn wfn 6531  ‘cfv 6536  (class class class)co 7410  Basecbs 17273   ↾_s cress 17294  0_gc0g 17496  Ringcrg 20319  CRingccrg 20320  SubRingcsubrg 20677  DivRingcdr 20836  Fieldcfield 20837  SubDRingcsdrg 20898  LIdealclidl 21339  RSpancrsp 21340  Poly₁cpl1 22346   evalSub₁ ces1 22482  idlGen_1pcig1p 26296   IntgRing cirng 34082   minPoly cminply 34098

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181  ax-pre-sup 11182  ax-addf 11183

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-of 7674  df-ofr 7675  df-om 7859  df-1st 7982  df-2nd 7983  df-supp 8153  df-tpos 8218  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-er 8690  df-map 8822  df-pm 8823  df-ixp 8892  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-fsupp 9318  df-sup 9398  df-inf 9399  df-oi 9468  df-card 9930  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-nn 12238  df-2 12307  df-3 12308  df-4 12309  df-5 12310  df-6 12311  df-7 12312  df-8 12313  df-9 12314  df-n0 12509  df-z 12596  df-dec 12716  df-uz 12867  df-fz 13540  df-fzo 13688  df-seq 14043  df-hash 14372  df-struct 17211  df-sets 17228  df-slot 17246  df-ndx 17258  df-base 17274  df-ress 17295  df-plusg 17327  df-mulr 17328  df-starv 17329  df-sca 17330  df-vsca 17331  df-ip 17332  df-tset 17333  df-ple 17334  df-ds 17336  df-unif 17337  df-hom 17338  df-cco 17339  df-0g 17498  df-gsum 17499  df-prds 17504  df-pws 17506  df-mre 17642  df-mrc 17643  df-acs 17645  df-mgm 18702  df-sgrp 18781  df-mnd 18797  df-mhm 18845  df-submnd 18846  df-grp 19007  df-minusg 19008  df-sbg 19009  df-mulg 19138  df-subg 19193  df-ghm 19288  df-cntz 19391  df-cmn 19856  df-abl 19857  df-mgp 20221  df-rng 20235  df-ur 20268  df-srg 20273  df-ring 20321  df-cring 20322  df-oppr 20424  df-dvdsr 20444  df-unit 20445  df-invr 20475  df-rhm 20559  df-subrng 20654  df-subrg 20678  df-rlreg 20802  df-drng 20838  df-field 20839  df-sdrg 20899  df-lmod 20992  df-lss 21062  df-lsp 21102  df-sra 21303  df-rgmod 21304  df-lidl 21341  df-rsp 21342  df-cnfld 21532  df-assa 22012  df-asp 22013  df-ascl 22014  df-psr 22068  df-mvr 22069  df-mpl 22070  df-opsr 22072  df-evls 22234  df-evl 22235  df-psr1 22349  df-vr1 22350  df-ply1 22351  df-coe1 22352  df-evls1 22484  df-evl1 22485  df-mdeg 26221  df-deg1 26222  df-mon1 26297  df-uc1p 26298  df-q1p 26299  df-r1p 26300  df-ig1p 26301  df-irng 34083  df-minply 34099

This theorem is used by:  minplym1p  34112  irredminply  34115  algextdeglem4  34119  algextdeglem7  34122  algextdeglem8  34123