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 34170
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 20948 . . . . . 6 (𝐹 ∈ (SubDRing‘𝐸) → 𝐹 ∈ (SubRing‘𝐸))
31, 2syl 18 . . . . 5 (𝜑𝐹 ∈ (SubRing‘𝐸))
4 eqid 2765 . . . . . 6 (𝐸s 𝐹) = (𝐸s 𝐹)
54subrgring 20727 . . . . 5 (𝐹 ∈ (SubRing‘𝐸) → (𝐸s 𝐹) ∈ Ring)
63, 5syl 18 . . . 4 (𝜑 → (𝐸s 𝐹) ∈ Ring)
7 eqid 2765 . . . . 5 (Poly1‘(𝐸s 𝐹)) = (Poly1‘(𝐸s 𝐹))
87ply1ring 22461 . . . 4 ((𝐸s 𝐹) ∈ Ring → (Poly1‘(𝐸s 𝐹)) ∈ Ring)
96, 8syl 18 . . 3 (𝜑 → (Poly1‘(𝐸s 𝐹)) ∈ Ring)
10 eqid 2765 . . . . . 6 (𝐸 evalSub1 𝐹) = (𝐸 evalSub1 𝐹)
11 eqid 2765 . . . . . 6 (Base‘𝐸) = (Base‘𝐸)
12 irngnminplynz.e . . . . . . 7 (𝜑𝐸 ∈ Field)
1312fldcrngd 20896 . . . . . 6 (𝜑𝐸 ∈ CRing)
14 eqid 2765 . . . . . . . 8 (0g𝐸) = (0g𝐸)
1510, 4, 11, 14, 13, 3irngssv 34146 . . . . . . 7 (𝜑 → (𝐸 IntgRing 𝐹) ⊆ (Base‘𝐸))
16 irngnminplynz.a . . . . . . 7 (𝜑𝐴 ∈ (𝐸 IntgRing 𝐹))
1715, 16sseldd 3939 . . . . . 6 (𝜑𝐴 ∈ (Base‘𝐸))
18 eqid 2765 . . . . . 6 {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} = {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}
1910, 7, 11, 13, 3, 17, 14, 18ply1annidl 34160 . . . . 5 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ∈ (LIdeal‘(Poly1‘(𝐸s 𝐹))))
20 eqid 2765 . . . . . 6 (Base‘(Poly1‘(𝐸s 𝐹))) = (Base‘(Poly1‘(𝐸s 𝐹)))
21 eqid 2765 . . . . . 6 (LIdeal‘(Poly1‘(𝐸s 𝐹))) = (LIdeal‘(Poly1‘(𝐸s 𝐹)))
2220, 21lidlss 21390 . . . . 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 20947 . . . . . 6 (𝐹 ∈ (SubDRing‘𝐸) → (𝐸s 𝐹) ∈ DivRing)
251, 24syl 18 . . . . 5 (𝜑 → (𝐸s 𝐹) ∈ DivRing)
26 eqid 2765 . . . . . 6 (idlGen1p‘(𝐸s 𝐹)) = (idlGen1p‘(𝐸s 𝐹))
277, 26, 21ig1pcl 26391 . . . . 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 3939 . . 3 (𝜑 → ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}) ∈ (Base‘(Poly1‘(𝐸s 𝐹))))
30 eqid 2765 . . . . 5 (RSpan‘(Poly1‘(𝐸s 𝐹))) = (RSpan‘(Poly1‘(𝐸s 𝐹)))
3110, 7, 11, 12, 1, 17, 14, 18, 30, 26ply1annig1p 34162 . . . 4 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} = ((RSpan‘(Poly1‘(𝐸s 𝐹)))‘{((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})}))
32 fveq2 6885 . . . . . . . . 9 (𝑞 = 𝑝 → ((𝐸 evalSub1 𝐹)‘𝑞) = ((𝐸 evalSub1 𝐹)‘𝑝))
3332fveq1d 6887 . . . . . . . 8 (𝑞 = 𝑝 → (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴))
3433eqeq1d 2767 . . . . . . 7 (𝑞 = 𝑝 → ((((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸) ↔ (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸)))
35 simplr 781 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}))
3635eldifad 3918 . . . . . . 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 33919 . . . . . . . . . . . . 13 (𝜑 → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸s 𝐹))))
4039ad2antrr 739 . . . . . . . . . . . 12 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → dom (𝐸 evalSub1 𝐹) = (Base‘(Poly1‘(𝐸s 𝐹))))
4136, 40eleqtrd 2867 . . . . . . . . . . 11 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ (Base‘(Poly1‘(𝐸s 𝐹))))
4210, 7, 20, 37, 38, 11, 41evls1fvf 33920 . . . . . . . . . 10 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝):(Base‘𝐸)⟶(Base‘𝐸))
4342ffnd 6710 . . . . . . . . 9 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ((𝐸 evalSub1 𝐹)‘𝑝) Fn (Base‘𝐸))
44 elpreima 7057 . . . . . . . . . 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 4608 . . . . . . . 8 ((((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) ∈ {(0g𝐸)} → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸))
4846, 47syl 18 . . . . . . 7 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → (((𝐸 evalSub1 𝐹)‘𝑝)‘𝐴) = (0g𝐸))
4934, 36, 48elrabd 3654 . . . . . 6 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ∈ {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})
50 eldifsni 4760 . . . . . . . . 9 (𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍}) → 𝑝𝑍)
5135, 50syl 18 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝𝑍)
52 eqid 2765 . . . . . . . . . 10 (Poly1𝐸) = (Poly1𝐸)
53 irngnminplynz.z . . . . . . . . . 10 𝑍 = (0g‘(Poly1𝐸))
5452, 4, 7, 20, 3, 53ressply10g 33925 . . . . . . . . 9 (𝜑𝑍 = (0g‘(Poly1‘(𝐸s 𝐹))))
5554ad2antrr 739 . . . . . . . 8 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑍 = (0g‘(Poly1‘(𝐸s 𝐹))))
5651, 55neeqtrd 3029 . . . . . . 7 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → 𝑝 ≠ (0g‘(Poly1‘(𝐸s 𝐹))))
57 nelsn 4634 . . . . . . 7 (𝑝 ≠ (0g‘(Poly1‘(𝐸s 𝐹))) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸s 𝐹)))})
5856, 57syl 18 . . . . . 6 (((𝜑𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})) ∧ 𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)})) → ¬ 𝑝 ∈ {(0g‘(Poly1‘(𝐸s 𝐹)))})
59 nelne1 3057 . . . . . 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 34149 . . . . . . 7 (𝜑 → (𝐸 IntgRing 𝐹) = 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6216, 61eleqtrd 2867 . . . . . 6 (𝜑𝐴 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
63 eliun 4962 . . . . . 6 (𝐴 𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})(((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}) ↔ ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6462, 63sylib 221 . . . . 5 (𝜑 → ∃𝑝 ∈ (dom (𝐸 evalSub1 𝐹) ∖ {𝑍})𝐴 ∈ (((𝐸 evalSub1 𝐹)‘𝑝) “ {(0g𝐸)}))
6560, 64r19.29a 3175 . . . 4 (𝜑 → {𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)} ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
6631, 65eqnetrrd 3028 . . 3 (𝜑 → ((RSpan‘(Poly1‘(𝐸s 𝐹)))‘{((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)})}) ≠ {(0g‘(Poly1‘(𝐸s 𝐹)))})
67 eqid 2765 . . . . 5 (0g‘(Poly1‘(𝐸s 𝐹))) = (0g‘(Poly1‘(𝐸s 𝐹)))
6820, 67, 30pidlnzb 33798 . . . 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 34163 . 2 (𝜑 → (𝑀𝐴) = ((idlGen1p‘(𝐸s 𝐹))‘{𝑞 ∈ dom (𝐸 evalSub1 𝐹) ∣ (((𝐸 evalSub1 𝐹)‘𝑞)‘𝐴) = (0g𝐸)}))
7370, 72, 543netr4d 3037 1 (𝜑 → (𝑀𝐴) ≠ 𝑍)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2146  wne 2960  wrex 3091  {crab 3418  cdif 3903  wss 3906  {csn 4591   ciun 4958  ccnv 5662  dom cdm 5663  cima 5666   Fn wfn 6535  cfv 6540  (class class class)co 7419  Basecbs 17295  s cress 17316  0gc0g 17518  Ringcrg 20363  CRingccrg 20364  SubRingcsubrg 20722  DivRingcdr 20881  Fieldcfield 20882  SubDRingcsdrg 20943  LIdealclidl 21384  RSpancrsp 21385  Poly1cpl1 22391   evalSub1 ces1 22527  idlGen1pcig1p 26342   IntgRing cirng 34141   minPoly cminply 34157
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11175  ax-resscn 11176  ax-1cn 11177  ax-icn 11178  ax-addcl 11179  ax-addrcl 11180  ax-mulcl 11181  ax-mulrcl 11182  ax-mulcom 11183  ax-addass 11184  ax-mulass 11185  ax-distr 11186  ax-i2m1 11187  ax-1ne0 11188  ax-1rid 11189  ax-rnegex 11190  ax-rrecex 11191  ax-cnre 11192  ax-pre-lttri 11193  ax-pre-lttrn 11194  ax-pre-ltadd 11195  ax-pre-mulgt0 11196  ax-pre-sup 11197  ax-addf 11198
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-of 7684  df-ofr 7685  df-om 7869  df-1st 7992  df-2nd 7993  df-supp 8163  df-tpos 8228  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-map 8832  df-pm 8833  df-ixp 8902  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-fsupp 9329  df-sup 9409  df-inf 9410  df-oi 9479  df-card 9941  df-pnf 11264  df-mnf 11265  df-xr 11266  df-ltxr 11267  df-le 11268  df-sub 11462  df-neg 11463  df-nn 12253  df-2 12322  df-3 12323  df-4 12324  df-5 12325  df-6 12326  df-7 12327  df-8 12328  df-9 12329  df-n0 12524  df-z 12611  df-dec 12732  df-uz 12883  df-fz 13556  df-fzo 13704  df-seq 14060  df-hash 14389  df-struct 17233  df-sets 17250  df-slot 17268  df-ndx 17280  df-base 17296  df-ress 17317  df-plusg 17349  df-mulr 17350  df-starv 17351  df-sca 17352  df-vsca 17353  df-ip 17354  df-tset 17355  df-ple 17356  df-ds 17358  df-unif 17359  df-hom 17360  df-cco 17361  df-0g 17520  df-gsum 17521  df-prds 17526  df-pws 17528  df-mre 17664  df-mrc 17665  df-acs 17667  df-mgm 18724  df-sgrp 18813  df-mnd 18829  df-mhm 18882  df-submnd 18883  df-grp 19051  df-minusg 19052  df-sbg 19053  df-mulg 19182  df-subg 19237  df-ghm 19332  df-cntz 19435  df-cmn 19900  df-abl 19901  df-mgp 20265  df-rng 20279  df-ur 20312  df-srg 20317  df-ring 20365  df-cring 20366  df-oppr 20469  df-dvdsr 20489  df-unit 20490  df-invr 20520  df-rhm 20604  df-subrng 20699  df-subrg 20723  df-rlreg 20847  df-drng 20883  df-field 20884  df-sdrg 20944  df-lmod 21037  df-lss 21107  df-lsp 21147  df-sra 21348  df-rgmod 21349  df-lidl 21386  df-rsp 21387  df-cnfld 21577  df-assa 22057  df-asp 22058  df-ascl 22059  df-psr 22113  df-mvr 22114  df-mpl 22115  df-opsr 22117  df-evls 22279  df-evl 22280  df-psr1 22394  df-vr1 22395  df-ply1 22396  df-coe1 22397  df-evls1 22529  df-evl1 22530  df-mdeg 26267  df-deg1 26268  df-mon1 26343  df-uc1p 26344  df-q1p 26345  df-r1p 26346  df-ig1p 26347  df-irng 34142  df-minply 34158
This theorem is used by:  minplym1p  34171  irredminply  34174  algextdeglem4  34178  algextdeglem7  34181  algextdeglem8  34182
  Copyright terms: Public domain W3C validator