Theorem minplyirred 34101

Description: A nonzero minimal polynomial is irreducible. (Contributed by Thierry Arnoux, 22-Mar-2025.)

Hypotheses

Ref	Expression
ply1annig1p.o	⊢ 𝑂 = (𝐸 evalSub1 𝐹)
ply1annig1p.p	⊢ 𝑃 = (Poly1‘(𝐸 ↾s 𝐹))
ply1annig1p.b	⊢ 𝐵 = (Base‘𝐸)
ply1annig1p.e	⊢ (𝜑 → 𝐸 ∈ Field)
ply1annig1p.f	⊢ (𝜑 → 𝐹 ∈ (SubDRing‘𝐸))
ply1annig1p.a	⊢ (𝜑 → 𝐴 ∈ 𝐵)
minplyirred.1	⊢ 𝑀 = (𝐸 minPoly 𝐹)
minplyirred.2	⊢ 𝑍 = (0g‘𝑃)
minplyirred.3	⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)

Assertion

Ref	Expression
minplyirred	⊢ (𝜑 → (𝑀‘𝐴) ∈ (Irred‘𝑃))

Proof of Theorem minplyirred

Dummy variables 𝑞 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ply1annig1p.o	. . 3 ⊢ 𝑂 = (𝐸 evalSub1 𝐹)
2		ply1annig1p.p	. . 3 ⊢ 𝑃 = (Poly1‘(𝐸 ↾s 𝐹))
3		ply1annig1p.b	. . 3 ⊢ 𝐵 = (Base‘𝐸)
4		ply1annig1p.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ Field)
5		ply1annig1p.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (SubDRing‘𝐸))
6		ply1annig1p.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
7		eqid 2763	. . 3 ⊢ (0g‘𝐸) = (0g‘𝐸)
8		eqid 2763	. . 3 ⊢ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} = {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}
9		eqid 2763	. . 3 ⊢ (RSpan‘𝑃) = (RSpan‘𝑃)
10		eqid 2763	. . 3 ⊢ (idlGen1p‘(𝐸 ↾s 𝐹)) = (idlGen1p‘(𝐸 ↾s 𝐹))
11		minplyirred.1	. . 3 ⊢ 𝑀 = (𝐸 minPoly 𝐹)
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	minplycl 34096	. 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ (Base‘𝑃))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	minplyval 34095	. . 3 ⊢ (𝜑 → (𝑀‘𝐴) = ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}))
14		eqid 2763	. . . 4 ⊢ (Base‘𝑃) = (Base‘𝑃)
15		eqid 2763	. . . . . 6 ⊢ (𝐸 ↾s 𝐹) = (𝐸 ↾s 𝐹)
16	15	sdrgdrng 20893	. . . . 5 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ DivRing)
17	5, 16	syl 18	. . . 4 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ DivRing)
18	4	fldcrngd 20842	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ CRing)
19		sdrgsubrg 20894	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
20	5, 19	syl 18	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubRing‘𝐸))
21	1, 2, 3, 18, 20, 6, 7, 8	ply1annidl 34092	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘𝑃))
22	4	flddrngd 20841	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ DivRing)
23		drngnzr 20848	. . . . . 6 ⊢ (𝐸 ∈ DivRing → 𝐸 ∈ NzRing)
24	22, 23	syl 18	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ NzRing)
25	1, 2, 3, 18, 20, 6, 7, 8, 14, 24	ply1annnr 34093	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ (Base‘𝑃))
26	2, 10, 14, 17, 21, 25	ig1pnunit 33891	. . 3 ⊢ (𝜑 → ¬ ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Unit‘𝑃))
27	13, 26	eqneltrd 2883	. 2 ⊢ (𝜑 → ¬ (𝑀‘𝐴) ∈ (Unit‘𝑃))
28		fldidom 20875	. . . . . . . . . . 11 ⊢ (𝐸 ∈ Field → 𝐸 ∈ IDomn)
29	4, 28	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ IDomn)
30	29	idomdomd 20824	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ Domn)
31	30	ad3antrrr 742	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐸 ∈ Domn)
32	18	ad3antrrr 742	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐸 ∈ CRing)
33	20	ad3antrrr 742	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐹 ∈ (SubRing‘𝐸))
34	6	ad3antrrr 742	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐴 ∈ 𝐵)
35		simpllr 787	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑓 ∈ (Base‘𝑃))
36	1, 2, 3, 14, 32, 33, 34, 35	evls1fvcl 22535	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘𝑓)‘𝐴) ∈ 𝐵)
37		simplr 780	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑔 ∈ (Base‘𝑃))
38	1, 2, 3, 14, 32, 33, 34, 37	evls1fvcl 22535	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘𝑔)‘𝐴) ∈ 𝐵)
39		simpr 489	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
40	39	fveq2d 6885	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑂‘(𝑓(.r‘𝑃)𝑔)) = (𝑂‘(𝑀‘𝐴)))
41	40	fveq1d 6883	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑓(.r‘𝑃)𝑔))‘𝐴) = ((𝑂‘(𝑀‘𝐴))‘𝐴))
42		eqid 2763	. . . . . . . . . 10 ⊢ (.r‘𝑃) = (.r‘𝑃)
43		eqid 2763	. . . . . . . . . 10 ⊢ (.r‘𝐸) = (.r‘𝐸)
44	1, 3, 2, 15, 14, 42, 43, 32, 33, 35, 37, 34	evls1muld 22532	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑓(.r‘𝑃)𝑔))‘𝐴) = (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)))
45		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ (LIdeal‘𝑃) = (LIdeal‘𝑃)
46	2, 10, 45	ig1pcl 26336	. . . . . . . . . . . . . 14 ⊢ (((𝐸 ↾s 𝐹) ∈ DivRing ∧ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘𝑃)) → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
47	17, 21, 46	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
48	13, 47	eqeltrd 2863	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑀‘𝐴) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
49		fveq2 6881	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = (𝑀‘𝐴) → (𝑂‘𝑞) = (𝑂‘(𝑀‘𝐴)))
50	49	fveq1d 6883	. . . . . . . . . . . . . 14 ⊢ (𝑞 = (𝑀‘𝐴) → ((𝑂‘𝑞)‘𝐴) = ((𝑂‘(𝑀‘𝐴))‘𝐴))
51	50	eqeq1d 2765	. . . . . . . . . . . . 13 ⊢ (𝑞 = (𝑀‘𝐴) → (((𝑂‘𝑞)‘𝐴) = (0g‘𝐸) ↔ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
52	51	elrab 3650	. . . . . . . . . . . 12 ⊢ ((𝑀‘𝐴) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ↔ ((𝑀‘𝐴) ∈ dom 𝑂 ∧ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
53	48, 52	sylib 221	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ dom 𝑂 ∧ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
54	53	simprd 500	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸))
55	54	ad3antrrr 742	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸))
56	41, 44, 55	3eqtr3d 2806	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸))
57	3, 43, 7	domneq0 20807	. . . . . . . . 9 ⊢ ((𝐸 ∈ Domn ∧ ((𝑂‘𝑓)‘𝐴) ∈ 𝐵 ∧ ((𝑂‘𝑔)‘𝐴) ∈ 𝐵) → ((((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸) ↔ (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸))))
58	57	biimpa 481	. . . . . . . 8 ⊢ (((𝐸 ∈ Domn ∧ ((𝑂‘𝑓)‘𝐴) ∈ 𝐵 ∧ ((𝑂‘𝑔)‘𝐴) ∈ 𝐵) ∧ (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)))
59	31, 36, 38, 56, 58	syl31anc 1400	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)))
60	4	ad4antr 744	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐸 ∈ Field)
61	5	ad4antr 744	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐹 ∈ (SubDRing‘𝐸))
62	34	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐴 ∈ 𝐵)
63		minplyirred.2	. . . . . . . . . 10 ⊢ 𝑍 = (0g‘𝑃)
64		minplyirred.3	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)
65	64	ad3antrrr 742	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑀‘𝐴) ≠ 𝑍)
66	65	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → (𝑀‘𝐴) ≠ 𝑍)
67	35	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Base‘𝑃))
68		simpllr 787	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Base‘𝑃))
69		simplr 780	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
70		simpr 489	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸))
71		fldsdrgfld 20901	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐸 ∈ Field ∧ 𝐹 ∈ (SubDRing‘𝐸)) → (𝐸 ↾s 𝐹) ∈ Field)
72	4, 5, 71	syl2anc 595	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Field)
73		fldidom 20875	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸 ↾s 𝐹) ∈ Field → (𝐸 ↾s 𝐹) ∈ IDomn)
74	72, 73	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ IDomn)
75	74	idomdomd 20824	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Domn)
76	2	ply1domn 26281	. . . . . . . . . . . . . . . 16 ⊢ ((𝐸 ↾s 𝐹) ∈ Domn → 𝑃 ∈ Domn)
77	75, 76	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 ∈ Domn)
78	77	ad3antrrr 742	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑃 ∈ Domn)
79	39, 65	eqnetrd 3025	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓(.r‘𝑃)𝑔) ≠ 𝑍)
80	14, 42, 63	domneq0 20807	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) = 𝑍 ↔ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍)))
81	80	necon3abid 2994	. . . . . . . . . . . . . . 15 ⊢ ((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) ≠ 𝑍 ↔ ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍)))
82	81	biimpa 481	. . . . . . . . . . . . . 14 ⊢ (((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) ≠ 𝑍) → ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
83	78, 35, 37, 79, 82	syl31anc 1400	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
84		neanior 3051	. . . . . . . . . . . . 13 ⊢ ((𝑓 ≠ 𝑍 ∧ 𝑔 ≠ 𝑍) ↔ ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
85	83, 84	sylibr 237	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓 ≠ 𝑍 ∧ 𝑔 ≠ 𝑍))
86	85	simpld 499	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑓 ≠ 𝑍)
87	86	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑓 ≠ 𝑍)
88	85	simprd 500	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑔 ≠ 𝑍)
89	88	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ≠ 𝑍)
90	1, 2, 3, 60, 61, 62, 11, 63, 66, 67, 68, 69, 70, 87, 89	minplyirredlem 34100	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Unit‘𝑃))
91	90	ex 417	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) → 𝑔 ∈ (Unit‘𝑃)))
92	4	ad4antr 744	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐸 ∈ Field)
93	5	ad4antr 744	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐹 ∈ (SubDRing‘𝐸))
94	34	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐴 ∈ 𝐵)
95	65	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑀‘𝐴) ≠ 𝑍)
96		simpllr 787	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Base‘𝑃))
97	35	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Base‘𝑃))
98	72	fldcrngd 20842	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ CRing)
99	2	ply1crng 22358	. . . . . . . . . . . . . 14 ⊢ ((𝐸 ↾s 𝐹) ∈ CRing → 𝑃 ∈ CRing)
100	98, 99	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ CRing)
101	100	ad4antr 744	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑃 ∈ CRing)
102	14, 42	crngcom 20328	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ CRing ∧ 𝑔 ∈ (Base‘𝑃) ∧ 𝑓 ∈ (Base‘𝑃)) → (𝑔(.r‘𝑃)𝑓) = (𝑓(.r‘𝑃)𝑔))
103	101, 96, 97, 102	syl3anc 1398	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔(.r‘𝑃)𝑓) = (𝑓(.r‘𝑃)𝑔))
104		simplr 780	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
105	103, 104	eqtrd 2798	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔(.r‘𝑃)𝑓) = (𝑀‘𝐴))
106		simpr 489	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸))
107	88	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑔 ≠ 𝑍)
108	86	adantr 485	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ≠ 𝑍)
109	1, 2, 3, 92, 93, 94, 11, 63, 95, 96, 97, 105, 106, 107, 108	minplyirredlem 34100	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Unit‘𝑃))
110	109	ex 417	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑔)‘𝐴) = (0g‘𝐸) → 𝑓 ∈ (Unit‘𝑃)))
111	91, 110	orim12d 979	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔 ∈ (Unit‘𝑃) ∨ 𝑓 ∈ (Unit‘𝑃))))
112	59, 111	mpd 16	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑔 ∈ (Unit‘𝑃) ∨ 𝑓 ∈ (Unit‘𝑃)))
113	112	orcomd 884	. . . . 5 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃)))
114	113	ex 417	. . . 4 ⊢ (((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
115	114	anasss 471	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃))) → ((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
116	115	ralrimivva 3208	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (Base‘𝑃)∀𝑔 ∈ (Base‘𝑃)((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
117		eqid 2763	. . 3 ⊢ (Unit‘𝑃) = (Unit‘𝑃)
118		eqid 2763	. . 3 ⊢ (Irred‘𝑃) = (Irred‘𝑃)
119	14, 117, 118, 42	isirred2 20499	. 2 ⊢ ((𝑀‘𝐴) ∈ (Irred‘𝑃) ↔ ((𝑀‘𝐴) ∈ (Base‘𝑃) ∧ ¬ (𝑀‘𝐴) ∈ (Unit‘𝑃) ∧ ∀𝑓 ∈ (Base‘𝑃)∀𝑔 ∈ (Base‘𝑃)((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃)))))
120	12, 27, 116, 119	syl3anbrc 1362	1 ⊢ (𝜑 → (𝑀‘𝐴) ∈ (Irred‘𝑃))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  {crab 3416  dom cdm 5661  ‘cfv 6536  (class class class)co 7410  Basecbs 17264   ↾_s cress 17285  ._rcmulr 17306  0_gc0g 17487  CRingccrg 20311  Unitcui 20433  Irredcir 20434  NzRingcnzr 20609  SubRingcsubrg 20668  Domncdomn 20791  IDomncidom 20792  DivRingcdr 20827  Fieldcfield 20828  SubDRingcsdrg 20889  LIdealclidl 21330  RSpancrsp 21331  Poly₁cpl1 22337   evalSub₁ ces1 22473  idlGen_1pcig1p 26287   minPoly cminply 34089

This theorem was proved from 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 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172  ax-pre-sup 11173  ax-addf 11174

This theorem 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 9921  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-2 12298  df-3 12299  df-4 12300  df-5 12301  df-6 12302  df-7 12303  df-8 12304  df-9 12305  df-n0 12500  df-z 12587  df-dec 12707  df-uz 12858  df-fz 13531  df-fzo 13679  df-seq 14034  df-hash 14363  df-struct 17202  df-sets 17219  df-slot 17237  df-ndx 17249  df-base 17265  df-ress 17286  df-plusg 17318  df-mulr 17319  df-starv 17320  df-sca 17321  df-vsca 17322  df-ip 17323  df-tset 17324  df-ple 17325  df-ds 17327  df-unif 17328  df-hom 17329  df-cco 17330  df-0g 17489  df-gsum 17490  df-prds 17495  df-pws 17497  df-mre 17633  df-mrc 17634  df-acs 17636  df-mgm 18693  df-sgrp 18772  df-mnd 18788  df-mhm 18836  df-submnd 18837  df-grp 18998  df-minusg 18999  df-sbg 19000  df-mulg 19129  df-subg 19184  df-ghm 19279  df-cntz 19382  df-cmn 19847  df-abl 19848  df-mgp 20212  df-rng 20226  df-ur 20259  df-srg 20264  df-ring 20312  df-cring 20313  df-oppr 20415  df-dvdsr 20435  df-unit 20436  df-irred 20437  df-invr 20466  df-rhm 20550  df-nzr 20610  df-subrng 20645  df-subrg 20669  df-rlreg 20793  df-domn 20794  df-idom 20795  df-drng 20829  df-field 20830  df-sdrg 20890  df-lmod 20983  df-lss 21053  df-lsp 21093  df-sra 21294  df-rgmod 21295  df-lidl 21332  df-cnfld 21523  df-assa 22003  df-asp 22004  df-ascl 22005  df-psr 22059  df-mvr 22060  df-mpl 22061  df-opsr 22063  df-evls 22225  df-evl 22226  df-psr1 22340  df-vr1 22341  df-ply1 22342  df-coe1 22343  df-evls1 22475  df-evl1 22476  df-mdeg 26212  df-deg1 26213  df-mon1 26288  df-uc1p 26289  df-ig1p 26292  df-minply 34090

This theorem is referenced by:  irredminply  34106  algextdeglem4  34110