Theorem irngnminplynz 33905

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 20764	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubRing‘𝐸))
4		eqid 2739	. . . . . 6 ⊢ (𝐸 ↾s 𝐹) = (𝐸 ↾s 𝐹)
5	4	subrgring 20547	. . . . 5 ⊢ (𝐹 ∈ (SubRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ Ring)
6	3, 5	syl 17	. . . 4 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Ring)
7		eqid 2739	. . . . 5 ⊢ (Poly1‘(𝐸 ↾s 𝐹)) = (Poly1‘(𝐸 ↾s 𝐹))
8	7	ply1ring 22233	. . . 4 ⊢ ((𝐸 ↾s 𝐹) ∈ Ring → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
9	6, 8	syl 17	. . 3 ⊢ (𝜑 → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
10		eqid 2739	. . . . . 6 ⊢ (𝐸 evalSub1 𝐹) = (𝐸 evalSub1 𝐹)
11		eqid 2739	. . . . . 6 ⊢ (Base‘𝐸) = (Base‘𝐸)
12		irngnminplynz.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ Field)
13	12	fldcrngd 20715	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ CRing)
14		eqid 2739	. . . . . . . 8 ⊢ (0g‘𝐸) = (0g‘𝐸)
15	10, 4, 11, 14, 13, 3	irngssv 33881	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) ⊆ (Base‘𝐸))
16		irngnminplynz.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝐸 IntgRing 𝐹))
17	15, 16	sseldd 3916	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐸))
18		eqid 2739	. . . . . 6 ⊢ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}
19	10, 7, 11, 13, 3, 17, 14, 18	ply1annidl 33895	. . . . 5 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))))
20		eqid 2739	. . . . . 6 ⊢ (Base‘(Poly1‘(𝐸 ↾s 𝐹))) = (Base‘(Poly1‘(𝐸 ↾s 𝐹)))
21		eqid 2739	. . . . . 6 ⊢ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))) = (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹)))
22	20, 21	lidlss 21206	. . . . 5 ⊢ ({𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ⊆ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
23	19, 22	syl 17	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ⊆ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
24	4	sdrgdrng 20763	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ DivRing)
25	1, 24	syl 17	. . . . 5 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ DivRing)
26		eqid 2739	. . . . . 6 ⊢ (idlGen1p‘(𝐸 ↾s 𝐹)) = (idlGen1p‘(𝐸 ↾s 𝐹))
27	7, 26, 21	ig1pcl 26163	. . . . 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 590	. . . 4 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
29	23, 28	sseldd 3916	. . 3 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
30		eqid 2739	. . . . 5 ⊢ (RSpan‘(Poly1‘(𝐸 ↾s 𝐹))) = (RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))
31	10, 7, 11, 12, 1, 17, 14, 18, 30, 26	ply1annig1p 33897	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}))
32		fveq2 6828	. . . . . . . . 9 ⊢ (𝑞 = 𝑝 → ((𝐸 evalSub1 𝐹)‘𝑞) = ((𝐸 evalSub1 𝐹)‘𝑝))
33	32	fveq1d 6830	. . . . . . . 8 ⊢ (𝑞 = 𝑝 → (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴))
34	33	eqeq1d 2741	. . . . . . 7 ⊢ (𝑞 = 𝑝 → ((((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸) ↔ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸)))
35		simplr 774	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}))
36	35	eldifad 3895	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ dom (𝐸 evalSub1 𝐹))
37	13	ad2antrr 732	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐸 ∈ CRing)
38	3	ad2antrr 732	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐹 ∈ (SubRing‘𝐸))
39	10, 7, 20, 13, 3	evls1dm 33653	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
40	39	ad2antrr 732	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
41	36, 40	eleqtrd 2841	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
42	10, 7, 20, 37, 38, 11, 41	evls1fvf 33654	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝):(Base‘𝐸)⟶(Base‘𝐸))
43	42	ffnd 6657	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸))
44		elpreima 7000	. . . . . . . . . 10 ⊢ (((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) → (𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ (𝐴 ∈ (Base‘𝐸) ∧ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})))
45	44	simplbda 500	. . . . . . . . 9 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
46	43, 45	sylancom 594	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
47		elsni 4573	. . . . . . . 8 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)} → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
48	46, 47	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
49	34, 36, 48	elrabd 3631	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
50		eldifsni 4724	. . . . . . . . 9 ⊢ (𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}) → 𝑝 ≠ 𝑍)
51	35, 50	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ 𝑍)
52		eqid 2739	. . . . . . . . . 10 ⊢ (Poly1‘𝐸) = (Poly1‘𝐸)
53		irngnminplynz.z	. . . . . . . . . 10 ⊢ 𝑍 = (0g‘(Poly1‘𝐸))
54	52, 4, 7, 20, 3, 53	ressply10g 33659	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
55	54	ad2antrr 732	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
56	51, 55	neeqtrd 3003	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
57		nelsn 4599	. . . . . . 7 ⊢ (𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
58	56, 57	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
59		nelne1 3031	. . . . . 6 ⊢ ((𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∧ ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))}) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
60	49, 58, 59	syl2anc 590	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
61	10, 53, 14, 12, 1	irngnzply1 33884	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) = ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
62	16, 61	eleqtrd 2841	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
63		eliun 4926	. . . . . 6 ⊢ (𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
64	62, 63	sylib 219	. . . . 5 ⊢ (𝜑 → ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
65	60, 64	r19.29a 3147	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
66	31, 65	eqnetrrd 3002	. . 3 ⊢ (𝜑 → ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
67		eqid 2739	. . . . 5 ⊢ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) = (0g‘(Poly1‘(𝐸 ↾s 𝐹)))
68	20, 67, 30	pidlnzb 33506	. . . 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 478	. . 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 843	. 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 33898	. 2 ⊢ (𝜑 → (𝑀‘𝐴) = ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}))
73	70, 72, 54	3netr4d 3011	1 ⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119   ≠ wne 2934  ∃wrex 3063  {crab 3391   ∖ cdif 3880   ⊆ wss 3883  {csn 4556  ∪ ciun 4922  ^◡ccnv 5618  dom cdm 5619   “ cima 5622   Fn wfn 6481  ‘cfv 6486  (class class class)co 7357  Basecbs 17171   ↾_s cress 17192  0_gc0g 17394  Ringcrg 20206  CRingccrg 20207  SubRingcsubrg 20542  DivRingcdr 20702  Fieldcfield 20703  SubDRingcsdrg 20759  LIdealclidl 21200  RSpancrsp 21201  Poly₁cpl1 22163   evalSub₁ ces1 22300  idlGen_1pcig1p 26114   IntgRing cirng 33876   minPoly cminply 33892

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5200  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107  ax-pre-sup 11108  ax-addf 11109

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-tp 4561  df-op 4563  df-uni 4840  df-int 4879  df-iun 4924  df-iin 4925  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-isom 6495  df-riota 7314  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7621  df-ofr 7622  df-om 7808  df-1st 7932  df-2nd 7933  df-supp 8102  df-tpos 8167  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-2o 8397  df-er 8634  df-map 8766  df-pm 8767  df-ixp 8837  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-fsupp 9266  df-sup 9346  df-inf 9347  df-oi 9416  df-card 9855  df-pnf 11173  df-mnf 11174  df-xr 11175  df-ltxr 11176  df-le 11177  df-sub 11371  df-neg 11372  df-nn 12167  df-2 12236  df-3 12237  df-4 12238  df-5 12239  df-6 12240  df-7 12241  df-8 12242  df-9 12243  df-n0 12430  df-z 12517  df-dec 12637  df-uz 12781  df-fz 13454  df-fzo 13601  df-seq 13956  df-hash 14285  df-struct 17109  df-sets 17126  df-slot 17144  df-ndx 17156  df-base 17172  df-ress 17193  df-plusg 17225  df-mulr 17226  df-starv 17227  df-sca 17228  df-vsca 17229  df-ip 17230  df-tset 17231  df-ple 17232  df-ds 17234  df-unif 17235  df-hom 17236  df-cco 17237  df-0g 17396  df-gsum 17397  df-prds 17402  df-pws 17404  df-mre 17540  df-mrc 17541  df-acs 17543  df-mgm 18600  df-sgrp 18679  df-mnd 18695  df-mhm 18743  df-submnd 18744  df-grp 18904  df-minusg 18905  df-sbg 18906  df-mulg 19036  df-subg 19091  df-ghm 19180  df-cntz 19284  df-cmn 19749  df-abl 19750  df-mgp 20114  df-rng 20126  df-ur 20155  df-srg 20160  df-ring 20208  df-cring 20209  df-oppr 20309  df-dvdsr 20329  df-unit 20330  df-invr 20360  df-rhm 20444  df-subrng 20519  df-subrg 20543  df-rlreg 20667  df-drng 20704  df-field 20705  df-sdrg 20760  df-lmod 20853  df-lss 20923  df-lsp 20963  df-sra 21164  df-rgmod 21165  df-lidl 21202  df-rsp 21203  df-cnfld 21349  df-assa 21829  df-asp 21830  df-ascl 21831  df-psr 21885  df-mvr 21886  df-mpl 21887  df-opsr 21889  df-evls 22051  df-evl 22052  df-psr1 22166  df-vr1 22167  df-ply1 22168  df-coe1 22169  df-evls1 22302  df-evl1 22303  df-mdeg 26039  df-deg1 26040  df-mon1 26115  df-uc1p 26116  df-q1p 26117  df-r1p 26118  df-ig1p 26119  df-irng 33877  df-minply 33893

This theorem is referenced by:  minplym1p  33906  irredminply  33909  algextdeglem4  33913  algextdeglem7  33916  algextdeglem8  33917