Theorem irngnminplynz 33725

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 20706	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubRing‘𝐸))
4		eqid 2731	. . . . . 6 ⊢ (𝐸 ↾s 𝐹) = (𝐸 ↾s 𝐹)
5	4	subrgring 20489	. . . . 5 ⊢ (𝐹 ∈ (SubRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ Ring)
6	3, 5	syl 17	. . . 4 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Ring)
7		eqid 2731	. . . . 5 ⊢ (Poly1‘(𝐸 ↾s 𝐹)) = (Poly1‘(𝐸 ↾s 𝐹))
8	7	ply1ring 22160	. . . 4 ⊢ ((𝐸 ↾s 𝐹) ∈ Ring → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
9	6, 8	syl 17	. . 3 ⊢ (𝜑 → (Poly1‘(𝐸 ↾s 𝐹)) ∈ Ring)
10		eqid 2731	. . . . . 6 ⊢ (𝐸 evalSub1 𝐹) = (𝐸 evalSub1 𝐹)
11		eqid 2731	. . . . . 6 ⊢ (Base‘𝐸) = (Base‘𝐸)
12		irngnminplynz.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ Field)
13	12	fldcrngd 20657	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ CRing)
14		eqid 2731	. . . . . . . 8 ⊢ (0g‘𝐸) = (0g‘𝐸)
15	10, 4, 11, 14, 13, 3	irngssv 33701	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) ⊆ (Base‘𝐸))
16		irngnminplynz.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝐸 IntgRing 𝐹))
17	15, 16	sseldd 3930	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (Base‘𝐸))
18		eqid 2731	. . . . . 6 ⊢ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}
19	10, 7, 11, 13, 3, 17, 14, 18	ply1annidl 33715	. . . . 5 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))))
20		eqid 2731	. . . . . 6 ⊢ (Base‘(Poly1‘(𝐸 ↾s 𝐹))) = (Base‘(Poly1‘(𝐸 ↾s 𝐹)))
21		eqid 2731	. . . . . 6 ⊢ (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹))) = (LIdeal‘(Poly1‘(𝐸 ↾s 𝐹)))
22	20, 21	lidlss 21149	. . . . 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 20705	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ DivRing)
25	1, 24	syl 17	. . . . 5 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ DivRing)
26		eqid 2731	. . . . . 6 ⊢ (idlGen1p‘(𝐸 ↾s 𝐹)) = (idlGen1p‘(𝐸 ↾s 𝐹))
27	7, 26, 21	ig1pcl 26111	. . . . 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 584	. . . 4 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
29	23, 28	sseldd 3930	. . 3 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
30		eqid 2731	. . . . 5 ⊢ (RSpan‘(Poly1‘(𝐸 ↾s 𝐹))) = (RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))
31	10, 7, 11, 12, 1, 17, 14, 18, 30, 26	ply1annig1p 33717	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} = ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}))
32		fveq2 6822	. . . . . . . . 9 ⊢ (𝑞 = 𝑝 → ((𝐸 evalSub1 𝐹)‘𝑞) = ((𝐸 evalSub1 𝐹)‘𝑝))
33	32	fveq1d 6824	. . . . . . . 8 ⊢ (𝑞 = 𝑝 → (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴))
34	33	eqeq1d 2733	. . . . . . 7 ⊢ (𝑞 = 𝑝 → ((((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸) ↔ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸)))
35		simplr 768	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}))
36	35	eldifad 3909	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ dom (𝐸 evalSub1 𝐹))
37	13	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐸 ∈ CRing)
38	3	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝐹 ∈ (SubRing‘𝐸))
39	10, 7, 20, 13, 3	evls1dm 33524	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
40	39	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
41	36, 40	eleqtrd 2833	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ (Base‘(Poly1‘(𝐸 ↾s 𝐹))))
42	10, 7, 20, 37, 38, 11, 41	evls1fvf 33525	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝):(Base‘𝐸)⟶(Base‘𝐸))
43	42	ffnd 6652	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸))
44		elpreima 6991	. . . . . . . . . 10 ⊢ (((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) → (𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ (𝐴 ∈ (Base‘𝐸) ∧ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})))
45	44	simplbda 499	. . . . . . . . 9 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
46	43, 45	sylancom 588	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)})
47		elsni 4590	. . . . . . . 8 ⊢ ((((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g‘𝐸)} → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
48	46, 47	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g‘𝐸))
49	34, 36, 48	elrabd 3644	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})
50		eldifsni 4739	. . . . . . . . 9 ⊢ (𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}) → 𝑝 ≠ 𝑍)
51	35, 50	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ 𝑍)
52		eqid 2731	. . . . . . . . . 10 ⊢ (Poly1‘𝐸) = (Poly1‘𝐸)
53		irngnminplynz.z	. . . . . . . . . 10 ⊢ 𝑍 = (0g‘(Poly1‘𝐸))
54	52, 4, 7, 20, 3, 53	ressply10g 33530	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
55	54	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑍 = (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
56	51, 55	neeqtrd 2997	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → 𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))))
57		nelsn 4616	. . . . . . 7 ⊢ (𝑝 ≠ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
58	56, 57	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
59		nelne1 3025	. . . . . 6 ⊢ ((𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ∧ ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))}) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
60	49, 58, 59	syl2anc 584	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)})) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
61	10, 53, 14, 12, 1	irngnzply1 33704	. . . . . . 7 ⊢ (𝜑 → (𝐸 IntgRing 𝐹) = ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
62	16, 61	eleqtrd 2833	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
63		eliun 4943	. . . . . 6 ⊢ (𝐴 ∈ ∪ 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}) ↔ ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
64	62, 63	sylib 218	. . . . 5 ⊢ (𝜑 → ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (◡((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g‘𝐸)}))
65	60, 64	r19.29a 3140	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
66	31, 65	eqnetrrd 2996	. . 3 ⊢ (𝜑 → ((RSpan‘(Poly1‘(𝐸 ↾s 𝐹)))‘{((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸 ↾s 𝐹)))})
67		eqid 2731	. . . . 5 ⊢ (0g‘(Poly1‘(𝐸 ↾s 𝐹))) = (0g‘(Poly1‘(𝐸 ↾s 𝐹)))
68	20, 67, 30	pidlnzb 33387	. . . 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 477	. . 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 837	. 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 33718	. 2 ⊢ (𝜑 → (𝑀‘𝐴) = ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g‘𝐸)}))
73	70, 72, 54	3netr4d 3005	1 ⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111   ≠ wne 2928  ∃wrex 3056  {crab 3395   ∖ cdif 3894   ⊆ wss 3897  {csn 4573  ∪ ciun 4939  ^◡ccnv 5613  dom cdm 5614   “ cima 5617   Fn wfn 6476  ‘cfv 6481  (class class class)co 7346  Basecbs 17120   ↾_s cress 17141  0_gc0g 17343  Ringcrg 20151  CRingccrg 20152  SubRingcsubrg 20484  DivRingcdr 20644  Fieldcfield 20645  SubDRingcsdrg 20701  LIdealclidl 21143  RSpancrsp 21144  Poly₁cpl1 22089   evalSub₁ ces1 22228  idlGen_1pcig1p 26062   IntgRing cirng 33696   minPoly cminply 33712

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668  ax-cnex 11062  ax-resscn 11063  ax-1cn 11064  ax-icn 11065  ax-addcl 11066  ax-addrcl 11067  ax-mulcl 11068  ax-mulrcl 11069  ax-mulcom 11070  ax-addass 11071  ax-mulass 11072  ax-distr 11073  ax-i2m1 11074  ax-1ne0 11075  ax-1rid 11076  ax-rnegex 11077  ax-rrecex 11078  ax-cnre 11079  ax-pre-lttri 11080  ax-pre-lttrn 11081  ax-pre-ltadd 11082  ax-pre-mulgt0 11083  ax-pre-sup 11084  ax-addf 11085

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-tp 4578  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-se 5568  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-isom 6490  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-of 7610  df-ofr 7611  df-om 7797  df-1st 7921  df-2nd 7922  df-supp 8091  df-tpos 8156  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-2o 8386  df-er 8622  df-map 8752  df-pm 8753  df-ixp 8822  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873  df-fsupp 9246  df-sup 9326  df-inf 9327  df-oi 9396  df-card 9832  df-pnf 11148  df-mnf 11149  df-xr 11150  df-ltxr 11151  df-le 11152  df-sub 11346  df-neg 11347  df-nn 12126  df-2 12188  df-3 12189  df-4 12190  df-5 12191  df-6 12192  df-7 12193  df-8 12194  df-9 12195  df-n0 12382  df-z 12469  df-dec 12589  df-uz 12733  df-fz 13408  df-fzo 13555  df-seq 13909  df-hash 14238  df-struct 17058  df-sets 17075  df-slot 17093  df-ndx 17105  df-base 17121  df-ress 17142  df-plusg 17174  df-mulr 17175  df-starv 17176  df-sca 17177  df-vsca 17178  df-ip 17179  df-tset 17180  df-ple 17181  df-ds 17183  df-unif 17184  df-hom 17185  df-cco 17186  df-0g 17345  df-gsum 17346  df-prds 17351  df-pws 17353  df-mre 17488  df-mrc 17489  df-acs 17491  df-mgm 18548  df-sgrp 18627  df-mnd 18643  df-mhm 18691  df-submnd 18692  df-grp 18849  df-minusg 18850  df-sbg 18851  df-mulg 18981  df-subg 19036  df-ghm 19125  df-cntz 19229  df-cmn 19694  df-abl 19695  df-mgp 20059  df-rng 20071  df-ur 20100  df-srg 20105  df-ring 20153  df-cring 20154  df-oppr 20255  df-dvdsr 20275  df-unit 20276  df-invr 20306  df-rhm 20390  df-subrng 20461  df-subrg 20485  df-rlreg 20609  df-drng 20646  df-field 20647  df-sdrg 20702  df-lmod 20795  df-lss 20865  df-lsp 20905  df-sra 21107  df-rgmod 21108  df-lidl 21145  df-rsp 21146  df-cnfld 21292  df-assa 21790  df-asp 21791  df-ascl 21792  df-psr 21846  df-mvr 21847  df-mpl 21848  df-opsr 21850  df-evls 22009  df-evl 22010  df-psr1 22092  df-vr1 22093  df-ply1 22094  df-coe1 22095  df-evls1 22230  df-evl1 22231  df-mdeg 25987  df-deg1 25988  df-mon1 26063  df-uc1p 26064  df-q1p 26065  df-r1p 26066  df-ig1p 26067  df-irng 33697  df-minply 33713

This theorem is referenced by:  minplym1p  33726  irredminply  33729  algextdeglem4  33733  algextdeglem7  33736  algextdeglem8  33737