Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  irngnminplynz Structured version   Visualization version   GIF version

Theorem irngnminplynz 34225
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.
StepHypRef Expression
1 irngnminplynz.f . . . . . 6 (𝜑𝐹 ∈ (SubDRing‘𝐸))
2 sdrgsubrg 20960 . . . . . 6 (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
31, 2syl 18 . . . . 5 (𝜑𝐹 ∈ (SubRing‘𝐸))
4 eqid 2760 . . . . . 6 (𝐸s 𝐹) = (𝐸s 𝐹)
54subrgring 20739 . . . . 5 (𝐹 ∈ (SubRing‘𝐸) → (𝐸s 𝐹) ∈ Ring)
63, 5syl 18 . . . 4 (𝜑 → (𝐸s 𝐹) ∈ Ring)
7 eqid 2760 . . . . 5 (Poly1‘(𝐸s 𝐹)) = (Poly1‘(𝐸s 𝐹))
87ply1ring 22475 . . . 4 ((𝐸s 𝐹) ∈ Ring → (Poly1‘(𝐸s 𝐹)) ∈ Ring)
96, 8syl 18 . . 3 (𝜑 → (Poly1‘(𝐸s 𝐹)) ∈ Ring)
10 eqid 2760 . . . . . 6 (𝐸 evalSub1 𝐹) = (𝐸 evalSub1 𝐹)
11 eqid 2760 . . . . . 6 (Base‘𝐸) = (Base‘𝐸)
12 irngnminplynz.e . . . . . . 7 (𝜑𝐸 ∈ Field)
1312fldcrngd 20908 . . . . . 6 (𝜑𝐸 ∈ CRing)
14 eqid 2760 . . . . . . . 8 (0g𝐸) = (0g𝐸)
1510, 4, 11, 14, 13, 3irngssv 34201 . . . . . . 7 (𝜑 → (𝐸 IntgRing 𝐹) ⊆ (Base‘𝐸))
16 irngnminplynz.a . . . . . . 7 (𝜑𝐴 ∈ (𝐸 IntgRing 𝐹))
1715, 16sseldd 3932 . . . . . 6 (𝜑𝐴 ∈ (Base‘𝐸))
18 eqid 2760 . . . . . 6 {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} = {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}
1910, 7, 11, 13, 3, 17, 14, 18ply1annidl 34215 . . . . 5 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸s 𝐹))))
20 eqid 2760 . . . . . 6 (Base‘(Poly1‘(𝐸s 𝐹))) = (Base‘(Poly1‘(𝐸s 𝐹)))
21 eqid 2760 . . . . . 6 (LIdeal‘(Poly1‘(𝐸s 𝐹))) = (LIdeal‘(Poly1‘(𝐸s 𝐹)))
2220, 21lidlss 21402 . . . . 5 ({𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸s 𝐹))) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ⊆ (Base‘(Poly1‘(𝐸s 𝐹))))
2319, 22syl 18 . . . 4 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ⊆ (Base‘(Poly1‘(𝐸s 𝐹))))
244sdrgdrng 20959 . . . . . 6 (𝐹 ∈ (SubDRing‘𝐸) → (𝐸s 𝐹) ∈ DivRing)
251, 24syl 18 . . . . 5 (𝜑 → (𝐸s 𝐹) ∈ DivRing)
26 eqid 2760 . . . . . 6 (idlGen1p‘(𝐸s 𝐹)) = (idlGen1p‘(𝐸s 𝐹))
277, 26, 21ig1pcl 26407 . . . . 5 (((𝐸s 𝐹) ∈ DivRing ∧ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸s 𝐹)))) → ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})
2825, 19, 27syl2anc 596 . . . 4 (𝜑 → ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}) ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})
2923, 28sseldd 3932 . . 3 (𝜑 → ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}) ∈ (Base‘(Poly1‘(𝐸s 𝐹))))
30 eqid 2760 . . . . 5 (RSpan‘(Poly1‘(𝐸s 𝐹))) = (RSpan‘(Poly1‘(𝐸s 𝐹)))
3110, 7, 11, 12, 1, 17, 14, 18, 30, 26ply1annig1p 34217 . . . 4 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} = ((RSpan‘(Poly1‘(𝐸s 𝐹)))‘{((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})}))
32 fveq2 6879 . . . . . . . . 9 (𝑞 = 𝑝 → ((𝐸 evalSub1 𝐹)‘𝑞) = ((𝐸 evalSub1 𝐹)‘𝑝))
3332fveq1d 6881 . . . . . . . 8 (𝑞 = 𝑝 → (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴))
3433eqeq1d 2762 . . . . . . 7 (𝑞 = 𝑝 → ((((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸) ↔ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸)))
35 simplr 781 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}))
3635eldifad 3911 . . . . . . 7 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ dom (𝐸 evalSub1 𝐹))
3713ad2antrr 739 . . . . . . . . . . 11 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝐸 ∈ CRing)
383ad2antrr 739 . . . . . . . . . . 11 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝐹 ∈ (SubRing‘𝐸))
3910, 7, 20, 13, 3evls1dm 33974 . . . . . . . . . . . . 13 (𝜑 → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸s 𝐹))))
4039ad2antrr 739 . . . . . . . . . . . 12 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸s 𝐹))))
4136, 40eleqtrd 2862 . . . . . . . . . . 11 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ (Base‘(Poly1‘(𝐸s 𝐹))))
4210, 7, 20, 37, 38, 11, 41evls1fvf 33975 . . . . . . . . . 10 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝):(Base‘𝐸)⟶(Base‘𝐸))
4342ffnd 6704 . . . . . . . . 9 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸))
44 elpreima 7051 . . . . . . . . . 10 (((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) → (𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}) ↔ (𝐴 ∈ (Base‘𝐸) ∧ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g𝐸)})))
4544simplbda 505 . . . . . . . . 9 ((((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g𝐸)})
4643, 45sylancom 600 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g𝐸)})
47 elsni 4601 . . . . . . . 8 ((((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g𝐸)} → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸))
4846, 47syl 18 . . . . . . 7 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸))
4934, 36, 48elrabd 3647 . . . . . 6 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})
50 eldifsni 4753 . . . . . . . . 9 (𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}) → 𝑝𝑍)
5135, 50syl 18 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝𝑍)
52 eqid 2760 . . . . . . . . . 10 (Poly1𝐸) = (Poly1𝐸)
53 irngnminplynz.z . . . . . . . . . 10 𝑍 = (0g‘(Poly1𝐸))
5452, 4, 7, 20, 3, 53ressply10g 33980 . . . . . . . . 9 (𝜑𝑍 = (0g‘(Poly1‘(𝐸s 𝐹))))
5554ad2antrr 739 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑍 = (0g‘(Poly1‘(𝐸s 𝐹))))
5651, 55neeqtrd 3024 . . . . . . 7 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ≠ (0g‘(Poly1‘(𝐸s 𝐹))))
57 nelsn 4627 . . . . . . 7 (𝑝 ≠ (0g‘(Poly1‘(𝐸s 𝐹))) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸s 𝐹)))})
5856, 57syl 18 . . . . . 6 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸s 𝐹)))})
59 nelne1 3052 . . . . . 6 ((𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ∧ ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸s 𝐹)))}) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
6049, 58, 59syl2anc 596 . . . . 5 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
6110, 53, 14, 12, 1irngnzply1 34204 . . . . . . 7 (𝜑 → (𝐸 IntgRing 𝐹) = 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6216, 61eleqtrd 2862 . . . . . 6 (𝜑𝐴 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
63 eliun 4955 . . . . . 6 (𝐴 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}) ↔ ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6462, 63sylib 221 . . . . 5 (𝜑 → ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6560, 64r19.29a 3170 . . . 4 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
6631, 65eqnetrrd 3023 . . 3 (𝜑 → ((RSpan‘(Poly1‘(𝐸s 𝐹)))‘{((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
67 eqid 2760 . . . . 5 (0g‘(Poly1‘(𝐸s 𝐹))) = (0g‘(Poly1‘(𝐸s 𝐹)))
6820, 67, 30pidlnzb 33853 . . . 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 𝐹)))}))
6968biimpar 483 . . 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 𝐹))))
709, 29, 66, 69syl21anc 851 . 2 (𝜑 → ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}) ≠ (0g‘(Poly1‘(𝐸s 𝐹))))
71 irngnminplynz.m . . 3 𝑀 = (𝐸 minPoly 𝐹)
7210, 7, 11, 12, 1, 17, 14, 18, 30, 26, 71minplyval 34218 . 2 (𝜑 → (𝑀𝐴) = ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}))
7370, 72, 543netr4d 3032 1 (𝜑 → (𝑀𝐴) ≠ 𝑍)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2955  wrex 3086  {crab 3412  cdif 3896  wss 3899  {csn 4584   ciun 4951  ccnv 5654  dom cdm 5655  cima 5658   Fn wfn 6528  cfv 6533  (class class class)co 7414  Basecbs 17304  s cress 17325  0gc0g 17527  Ringcrg 20375  CRingccrg 20376  SubRingcsubrg 20734  DivRingcdr 20893  Fieldcfield 20894  SubDRingcsdrg 20955  LIdealclidl 21396  RSpancrsp 21397  Poly1cpl1 22405   evalSub1 ces1 22541  idlGen1pcig1p 26358   IntgRing cirng 34196   minPoly cminply 34212
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204  ax-pre-sup 11205  ax-addf 11206
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-of 7679  df-ofr 7680  df-om 7864  df-1st 7987  df-2nd 7988  df-supp 8160  df-tpos 8225  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-2o 8459  df-er 8699  df-map 8831  df-pm 8832  df-ixp 8908  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-fsupp 9335  df-sup 9415  df-inf 9416  df-oi 9485  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12532  df-z 12619  df-dec 12740  df-uz 12891  df-fz 13565  df-fzo 13713  df-seq 14069  df-hash 14398  df-struct 17242  df-sets 17259  df-slot 17277  df-ndx 17289  df-base 17305  df-ress 17326  df-plusg 17358  df-mulr 17359  df-starv 17360  df-sca 17361  df-vsca 17362  df-ip 17363  df-tset 17364  df-ple 17365  df-ds 17367  df-unif 17368  df-hom 17369  df-cco 17370  df-0g 17529  df-gsum 17530  df-prds 17535  df-pws 17537  df-mre 17673  df-mrc 17674  df-acs 17676  df-mgm 18733  df-sgrp 18824  df-mnd 18840  df-mhm 18894  df-submnd 18895  df-grp 19063  df-minusg 19064  df-sbg 19065  df-mulg 19194  df-subg 19249  df-ghm 19344  df-cntz 19447  df-cmn 19912  df-abl 19913  df-mgp 20277  df-rng 20291  df-ur 20324  df-srg 20329  df-ring 20377  df-cring 20378  df-oppr 20481  df-dvdsr 20501  df-unit 20502  df-invr 20532  df-rhm 20616  df-subrng 20711  df-subrg 20735  df-rlreg 20859  df-drng 20895  df-field 20896  df-sdrg 20956  df-lmod 21049  df-lss 21119  df-lsp 21159  df-sra 21360  df-rgmod 21361  df-lidl 21398  df-rsp 21399  df-cnfld 21589  df-assa 22071  df-asp 22072  df-ascl 22073  df-psr 22127  df-mvr 22128  df-mpl 22129  df-opsr 22131  df-evls 22293  df-evl 22294  df-psr1 22408  df-vr1 22409  df-ply1 22410  df-coe1 22411  df-evls1 22543  df-evl1 22544  df-mdeg 26283  df-deg1 26284  df-mon1 26359  df-uc1p 26360  df-q1p 26361  df-r1p 26362  df-ig1p 26363  df-irng 34197  df-minply 34213
This theorem is used by:  minplym1p  34226  irredminply  34229  algextdeglem4  34233  algextdeglem7  34236  algextdeglem8  34237
  Copyright terms: Public domain W3C validator