Theorem minplyirred 33861

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 2737	. . 3 ⊢ (0g‘𝐸) = (0g‘𝐸)
8		eqid 2737	. . 3 ⊢ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} = {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}
9		eqid 2737	. . 3 ⊢ (RSpan‘𝑃) = (RSpan‘𝑃)
10		eqid 2737	. . 3 ⊢ (idlGen1p‘(𝐸 ↾s 𝐹)) = (idlGen1p‘(𝐸 ↾s 𝐹))
11		minplyirred.1	. . 3 ⊢ 𝑀 = (𝐸 minPoly 𝐹)
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	minplycl 33856	. 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ (Base‘𝑃))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	minplyval 33855	. . 3 ⊢ (𝜑 → (𝑀‘𝐴) = ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}))
14		eqid 2737	. . . 4 ⊢ (Base‘𝑃) = (Base‘𝑃)
15		eqid 2737	. . . . . 6 ⊢ (𝐸 ↾s 𝐹) = (𝐸 ↾s 𝐹)
16	15	sdrgdrng 20725	. . . . 5 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → (𝐸 ↾s 𝐹) ∈ DivRing)
17	5, 16	syl 17	. . . 4 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ DivRing)
18	4	fldcrngd 20677	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ CRing)
19		sdrgsubrg 20726	. . . . . 6 ⊢ (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
20	5, 19	syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubRing‘𝐸))
21	1, 2, 3, 18, 20, 6, 7, 8	ply1annidl 33852	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘𝑃))
22	4	flddrngd 20676	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ DivRing)
23		drngnzr 20683	. . . . . 6 ⊢ (𝐸 ∈ DivRing → 𝐸 ∈ NzRing)
24	22, 23	syl 17	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ NzRing)
25	1, 2, 3, 18, 20, 6, 7, 8, 14, 24	ply1annnr 33853	. . . 4 ⊢ (𝜑 → {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ≠ (Base‘𝑃))
26	2, 10, 14, 17, 21, 25	ig1pnunit 33666	. . 3 ⊢ (𝜑 → ¬ ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ (Unit‘𝑃))
27	13, 26	eqneltrd 2857	. 2 ⊢ (𝜑 → ¬ (𝑀‘𝐴) ∈ (Unit‘𝑃))
28		fldidom 20706	. . . . . . . . . . 11 ⊢ (𝐸 ∈ Field → 𝐸 ∈ IDomn)
29	4, 28	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ IDomn)
30	29	idomdomd 20661	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ Domn)
31	30	ad3antrrr 731	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐸 ∈ Domn)
32	18	ad3antrrr 731	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐸 ∈ CRing)
33	20	ad3antrrr 731	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐹 ∈ (SubRing‘𝐸))
34	6	ad3antrrr 731	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝐴 ∈ 𝐵)
35		simpllr 776	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑓 ∈ (Base‘𝑃))
36	1, 2, 3, 14, 32, 33, 34, 35	evls1fvcl 22318	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘𝑓)‘𝐴) ∈ 𝐵)
37		simplr 769	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑔 ∈ (Base‘𝑃))
38	1, 2, 3, 14, 32, 33, 34, 37	evls1fvcl 22318	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘𝑔)‘𝐴) ∈ 𝐵)
39		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
40	39	fveq2d 6836	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑂‘(𝑓(.r‘𝑃)𝑔)) = (𝑂‘(𝑀‘𝐴)))
41	40	fveq1d 6834	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑓(.r‘𝑃)𝑔))‘𝐴) = ((𝑂‘(𝑀‘𝐴))‘𝐴))
42		eqid 2737	. . . . . . . . . 10 ⊢ (.r‘𝑃) = (.r‘𝑃)
43		eqid 2737	. . . . . . . . . 10 ⊢ (.r‘𝐸) = (.r‘𝐸)
44	1, 3, 2, 15, 14, 42, 43, 32, 33, 35, 37, 34	evls1muld 22315	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑓(.r‘𝑃)𝑔))‘𝐴) = (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)))
45		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ (LIdeal‘𝑃) = (LIdeal‘𝑃)
46	2, 10, 45	ig1pcl 26125	. . . . . . . . . . . . . 14 ⊢ (((𝐸 ↾s 𝐹) ∈ DivRing ∧ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ∈ (LIdeal‘𝑃)) → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
47	17, 21, 46	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((idlGen1p‘(𝐸 ↾s 𝐹))‘{𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)}) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
48	13, 47	eqeltrd 2837	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑀‘𝐴) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)})
49		fveq2 6832	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = (𝑀‘𝐴) → (𝑂‘𝑞) = (𝑂‘(𝑀‘𝐴)))
50	49	fveq1d 6834	. . . . . . . . . . . . . 14 ⊢ (𝑞 = (𝑀‘𝐴) → ((𝑂‘𝑞)‘𝐴) = ((𝑂‘(𝑀‘𝐴))‘𝐴))
51	50	eqeq1d 2739	. . . . . . . . . . . . 13 ⊢ (𝑞 = (𝑀‘𝐴) → (((𝑂‘𝑞)‘𝐴) = (0g‘𝐸) ↔ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
52	51	elrab 3635	. . . . . . . . . . . 12 ⊢ ((𝑀‘𝐴) ∈ {𝑞 ∈ dom 𝑂 ∣ ((𝑂‘𝑞)‘𝐴) = (0g‘𝐸)} ↔ ((𝑀‘𝐴) ∈ dom 𝑂 ∧ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
53	48, 52	sylib 218	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ dom 𝑂 ∧ ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸)))
54	53	simprd 495	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸))
55	54	ad3antrrr 731	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((𝑂‘(𝑀‘𝐴))‘𝐴) = (0g‘𝐸))
56	41, 44, 55	3eqtr3d 2780	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸))
57	3, 43, 7	domneq0 20643	. . . . . . . . 9 ⊢ ((𝐸 ∈ Domn ∧ ((𝑂‘𝑓)‘𝐴) ∈ 𝐵 ∧ ((𝑂‘𝑔)‘𝐴) ∈ 𝐵) → ((((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸) ↔ (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸))))
58	57	biimpa 476	. . . . . . . 8 ⊢ (((𝐸 ∈ Domn ∧ ((𝑂‘𝑓)‘𝐴) ∈ 𝐵 ∧ ((𝑂‘𝑔)‘𝐴) ∈ 𝐵) ∧ (((𝑂‘𝑓)‘𝐴)(.r‘𝐸)((𝑂‘𝑔)‘𝐴)) = (0g‘𝐸)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)))
59	31, 36, 38, 56, 58	syl31anc 1376	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)))
60	4	ad4antr 733	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐸 ∈ Field)
61	5	ad4antr 733	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐹 ∈ (SubDRing‘𝐸))
62	34	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝐴 ∈ 𝐵)
63		minplyirred.2	. . . . . . . . . 10 ⊢ 𝑍 = (0g‘𝑃)
64		minplyirred.3	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑀‘𝐴) ≠ 𝑍)
65	64	ad3antrrr 731	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑀‘𝐴) ≠ 𝑍)
66	65	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → (𝑀‘𝐴) ≠ 𝑍)
67	35	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Base‘𝑃))
68		simpllr 776	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Base‘𝑃))
69		simplr 769	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
70		simpr 484	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸))
71		fldsdrgfld 20733	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐸 ∈ Field ∧ 𝐹 ∈ (SubDRing‘𝐸)) → (𝐸 ↾s 𝐹) ∈ Field)
72	4, 5, 71	syl2anc 585	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Field)
73		fldidom 20706	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸 ↾s 𝐹) ∈ Field → (𝐸 ↾s 𝐹) ∈ IDomn)
74	72, 73	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ IDomn)
75	74	idomdomd 20661	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ Domn)
76	2	ply1domn 26070	. . . . . . . . . . . . . . . 16 ⊢ ((𝐸 ↾s 𝐹) ∈ Domn → 𝑃 ∈ Domn)
77	75, 76	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 ∈ Domn)
78	77	ad3antrrr 731	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑃 ∈ Domn)
79	39, 65	eqnetrd 3000	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓(.r‘𝑃)𝑔) ≠ 𝑍)
80	14, 42, 63	domneq0 20643	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) = 𝑍 ↔ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍)))
81	80	necon3abid 2969	. . . . . . . . . . . . . . 15 ⊢ ((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) ≠ 𝑍 ↔ ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍)))
82	81	biimpa 476	. . . . . . . . . . . . . 14 ⊢ (((𝑃 ∈ Domn ∧ 𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) ≠ 𝑍) → ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
83	78, 35, 37, 79, 82	syl31anc 1376	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
84		neanior 3026	. . . . . . . . . . . . 13 ⊢ ((𝑓 ≠ 𝑍 ∧ 𝑔 ≠ 𝑍) ↔ ¬ (𝑓 = 𝑍 ∨ 𝑔 = 𝑍))
85	83, 84	sylibr 234	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓 ≠ 𝑍 ∧ 𝑔 ≠ 𝑍))
86	85	simpld 494	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑓 ≠ 𝑍)
87	86	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑓 ≠ 𝑍)
88	85	simprd 495	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → 𝑔 ≠ 𝑍)
89	88	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ≠ 𝑍)
90	1, 2, 3, 60, 61, 62, 11, 63, 66, 67, 68, 69, 70, 87, 89	minplyirredlem 33860	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑓)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Unit‘𝑃))
91	90	ex 412	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) → 𝑔 ∈ (Unit‘𝑃)))
92	4	ad4antr 733	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐸 ∈ Field)
93	5	ad4antr 733	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐹 ∈ (SubDRing‘𝐸))
94	34	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝐴 ∈ 𝐵)
95	65	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑀‘𝐴) ≠ 𝑍)
96		simpllr 776	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑔 ∈ (Base‘𝑃))
97	35	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Base‘𝑃))
98	72	fldcrngd 20677	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐸 ↾s 𝐹) ∈ CRing)
99	2	ply1crng 22140	. . . . . . . . . . . . . 14 ⊢ ((𝐸 ↾s 𝐹) ∈ CRing → 𝑃 ∈ CRing)
100	98, 99	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ CRing)
101	100	ad4antr 733	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑃 ∈ CRing)
102	14, 42	crngcom 20190	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ CRing ∧ 𝑔 ∈ (Base‘𝑃) ∧ 𝑓 ∈ (Base‘𝑃)) → (𝑔(.r‘𝑃)𝑓) = (𝑓(.r‘𝑃)𝑔))
103	101, 96, 97, 102	syl3anc 1374	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔(.r‘𝑃)𝑓) = (𝑓(.r‘𝑃)𝑔))
104		simplr 769	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴))
105	103, 104	eqtrd 2772	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔(.r‘𝑃)𝑓) = (𝑀‘𝐴))
106		simpr 484	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸))
107	88	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑔 ≠ 𝑍)
108	86	adantr 480	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ≠ 𝑍)
109	1, 2, 3, 92, 93, 94, 11, 63, 95, 96, 97, 105, 106, 107, 108	minplyirredlem 33860	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) ∧ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → 𝑓 ∈ (Unit‘𝑃))
110	109	ex 412	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (((𝑂‘𝑔)‘𝐴) = (0g‘𝐸) → 𝑓 ∈ (Unit‘𝑃)))
111	91, 110	orim12d 967	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → ((((𝑂‘𝑓)‘𝐴) = (0g‘𝐸) ∨ ((𝑂‘𝑔)‘𝐴) = (0g‘𝐸)) → (𝑔 ∈ (Unit‘𝑃) ∨ 𝑓 ∈ (Unit‘𝑃))))
112	59, 111	mpd 15	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑔 ∈ (Unit‘𝑃) ∨ 𝑓 ∈ (Unit‘𝑃)))
113	112	orcomd 872	. . . . 5 ⊢ ((((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) ∧ (𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴)) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃)))
114	113	ex 412	. . . 4 ⊢ (((𝜑 ∧ 𝑓 ∈ (Base‘𝑃)) ∧ 𝑔 ∈ (Base‘𝑃)) → ((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
115	114	anasss 466	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ (Base‘𝑃) ∧ 𝑔 ∈ (Base‘𝑃))) → ((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
116	115	ralrimivva 3181	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (Base‘𝑃)∀𝑔 ∈ (Base‘𝑃)((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃))))
117		eqid 2737	. . 3 ⊢ (Unit‘𝑃) = (Unit‘𝑃)
118		eqid 2737	. . 3 ⊢ (Irred‘𝑃) = (Irred‘𝑃)
119	14, 117, 118, 42	isirred2 20359	. 2 ⊢ ((𝑀‘𝐴) ∈ (Irred‘𝑃) ↔ ((𝑀‘𝐴) ∈ (Base‘𝑃) ∧ ¬ (𝑀‘𝐴) ∈ (Unit‘𝑃) ∧ ∀𝑓 ∈ (Base‘𝑃)∀𝑔 ∈ (Base‘𝑃)((𝑓(.r‘𝑃)𝑔) = (𝑀‘𝐴) → (𝑓 ∈ (Unit‘𝑃) ∨ 𝑔 ∈ (Unit‘𝑃)))))
120	12, 27, 116, 119	syl3anbrc 1345	1 ⊢ (𝜑 → (𝑀‘𝐴) ∈ (Irred‘𝑃))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  {crab 3390  dom cdm 5622  ‘cfv 6490  (class class class)co 7358  Basecbs 17137   ↾_s cress 17158  ._rcmulr 17179  0_gc0g 17360  CRingccrg 20173  Unitcui 20293  Irredcir 20294  NzRingcnzr 20447  SubRingcsubrg 20504  Domncdomn 20627  IDomncidom 20628  DivRingcdr 20664  Fieldcfield 20665  SubDRingcsdrg 20721  LIdealclidl 21163  RSpancrsp 21164  Poly₁cpl1 22118   evalSub₁ ces1 22256  idlGen_1pcig1p 26076   minPoly cminply 33849

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-cnex 11083  ax-resscn 11084  ax-1cn 11085  ax-icn 11086  ax-addcl 11087  ax-addrcl 11088  ax-mulcl 11089  ax-mulrcl 11090  ax-mulcom 11091  ax-addass 11092  ax-mulass 11093  ax-distr 11094  ax-i2m1 11095  ax-1ne0 11096  ax-1rid 11097  ax-rnegex 11098  ax-rrecex 11099  ax-cnre 11100  ax-pre-lttri 11101  ax-pre-lttrn 11102  ax-pre-ltadd 11103  ax-pre-mulgt0 11104  ax-pre-sup 11105  ax-addf 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-isom 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-of 7622  df-ofr 7623  df-om 7809  df-1st 7933  df-2nd 7934  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 9852  df-pnf 11169  df-mnf 11170  df-xr 11171  df-ltxr 11172  df-le 11173  df-sub 11367  df-neg 11368  df-nn 12147  df-2 12209  df-3 12210  df-4 12211  df-5 12212  df-6 12213  df-7 12214  df-8 12215  df-9 12216  df-n0 12403  df-z 12490  df-dec 12609  df-uz 12753  df-fz 13425  df-fzo 13572  df-seq 13926  df-hash 14255  df-struct 17075  df-sets 17092  df-slot 17110  df-ndx 17122  df-base 17138  df-ress 17159  df-plusg 17191  df-mulr 17192  df-starv 17193  df-sca 17194  df-vsca 17195  df-ip 17196  df-tset 17197  df-ple 17198  df-ds 17200  df-unif 17201  df-hom 17202  df-cco 17203  df-0g 17362  df-gsum 17363  df-prds 17368  df-pws 17370  df-mre 17506  df-mrc 17507  df-acs 17509  df-mgm 18566  df-sgrp 18645  df-mnd 18661  df-mhm 18709  df-submnd 18710  df-grp 18870  df-minusg 18871  df-sbg 18872  df-mulg 19002  df-subg 19057  df-ghm 19146  df-cntz 19250  df-cmn 19715  df-abl 19716  df-mgp 20080  df-rng 20092  df-ur 20121  df-srg 20126  df-ring 20174  df-cring 20175  df-oppr 20275  df-dvdsr 20295  df-unit 20296  df-irred 20297  df-invr 20326  df-rhm 20410  df-nzr 20448  df-subrng 20481  df-subrg 20505  df-rlreg 20629  df-domn 20630  df-idom 20631  df-drng 20666  df-field 20667  df-sdrg 20722  df-lmod 20815  df-lss 20885  df-lsp 20925  df-sra 21127  df-rgmod 21128  df-lidl 21165  df-cnfld 21312  df-assa 21810  df-asp 21811  df-ascl 21812  df-psr 21866  df-mvr 21867  df-mpl 21868  df-opsr 21870  df-evls 22030  df-evl 22031  df-psr1 22121  df-vr1 22122  df-ply1 22123  df-coe1 22124  df-evls1 22258  df-evl1 22259  df-mdeg 26001  df-deg1 26002  df-mon1 26077  df-uc1p 26078  df-ig1p 26081  df-minply 33850

This theorem is referenced by:  irredminply  33866  algextdeglem4  33870