Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elaa2 Structured version   Visualization version   GIF version

Theorem elaa2 46662
Description: Elementhood in the set of nonzero algebraic numbers: when 𝐴 is nonzero, the polynomial 𝑓 can be chosen with a nonzero constant term. (Contributed by Glauco Siliprandi, 5-Apr-2020.) (Proof shortened by AV, 1-Oct-2020.)
Assertion
Ref Expression
elaa2 (𝐴 ∈ (𝔸 ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)))
Distinct variable group:   𝐴,𝑓

Proof of Theorem elaa2
Dummy variables 𝑔 𝑘 𝑧 𝑗 𝑚 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 aasscn 26284 . . . 4 𝔸 ⊆ ℂ
2 eldifi 4071 . . . 4 (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ 𝔸)
31, 2sselid 3919 . . 3 (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ ℂ)
4 elaa 26282 . . . . . 6 (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔𝐴) = 0))
52, 4sylib 218 . . . . 5 (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔𝐴) = 0))
65simprd 495 . . . 4 (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔𝐴) = 0)
723ad2ant1 1134 . . . . . 6 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → 𝐴 ∈ 𝔸)
8 eldifsni 4735 . . . . . . 7 (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ≠ 0)
983ad2ant1 1134 . . . . . 6 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → 𝐴 ≠ 0)
10 eldifi 4071 . . . . . . 7 (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ∈ (Poly‘ℤ))
11103ad2ant2 1135 . . . . . 6 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → 𝑔 ∈ (Poly‘ℤ))
12 eldifsni 4735 . . . . . . 7 (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ≠ 0𝑝)
13123ad2ant2 1135 . . . . . 6 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → 𝑔 ≠ 0𝑝)
14 simp3 1139 . . . . . 6 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → (𝑔𝐴) = 0)
15 fveq2 6840 . . . . . . . . 9 (𝑚 = 𝑛 → ((coeff‘𝑔)‘𝑚) = ((coeff‘𝑔)‘𝑛))
1615neeq1d 2991 . . . . . . . 8 (𝑚 = 𝑛 → (((coeff‘𝑔)‘𝑚) ≠ 0 ↔ ((coeff‘𝑔)‘𝑛) ≠ 0))
1716cbvrabv 3399 . . . . . . 7 {𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0} = {𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}
1817infeq1i 9392 . . . . . 6 inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ) = inf({𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}, ℝ, < )
19 fvoveq1 7390 . . . . . . 7 (𝑗 = 𝑘 → ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))) = ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
2019cbvmptv 5189 . . . . . 6 (𝑗 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < )))) = (𝑘 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
21 eqid 2736 . . . . . 6 (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...((deg‘𝑔) − inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < )))(((𝑗 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))‘𝑘) · (𝑧𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...((deg‘𝑔) − inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < )))(((𝑗 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))‘𝑘) · (𝑧𝑘)))
227, 9, 11, 13, 14, 18, 20, 21elaa2lem 46661 . . . . 5 ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔𝐴) = 0) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0))
2322rexlimdv3a 3142 . . . 4 (𝐴 ∈ (𝔸 ∖ {0}) → (∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔𝐴) = 0 → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)))
246, 23mpd 15 . . 3 (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0))
253, 24jca 511 . 2 (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)))
26 simpl 482 . . . . . . . . 9 ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ (Poly‘ℤ))
27 fveq2 6840 . . . . . . . . . . . . . . 15 (𝑓 = 0𝑝 → (coeff‘𝑓) = (coeff‘0𝑝))
28 coe0 26221 . . . . . . . . . . . . . . 15 (coeff‘0𝑝) = (ℕ0 × {0})
2927, 28eqtrdi 2787 . . . . . . . . . . . . . 14 (𝑓 = 0𝑝 → (coeff‘𝑓) = (ℕ0 × {0}))
3029fveq1d 6842 . . . . . . . . . . . . 13 (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = ((ℕ0 × {0})‘0))
31 0nn0 12452 . . . . . . . . . . . . . 14 0 ∈ ℕ0
32 fvconst2g 7157 . . . . . . . . . . . . . 14 ((0 ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((ℕ0 × {0})‘0) = 0)
3331, 31, 32mp2an 693 . . . . . . . . . . . . 13 ((ℕ0 × {0})‘0) = 0
3430, 33eqtrdi 2787 . . . . . . . . . . . 12 (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = 0)
3534adantl 481 . . . . . . . . . . 11 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ((coeff‘𝑓)‘0) = 0)
36 neneq 2938 . . . . . . . . . . . 12 (((coeff‘𝑓)‘0) ≠ 0 → ¬ ((coeff‘𝑓)‘0) = 0)
3736ad2antlr 728 . . . . . . . . . . 11 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ¬ ((coeff‘𝑓)‘0) = 0)
3835, 37pm2.65da 817 . . . . . . . . . 10 ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 = 0𝑝)
39 velsn 4583 . . . . . . . . . 10 (𝑓 ∈ {0𝑝} ↔ 𝑓 = 0𝑝)
4038, 39sylnibr 329 . . . . . . . . 9 ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 ∈ {0𝑝})
4126, 40eldifd 3900 . . . . . . . 8 ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
4241adantrr 718 . . . . . . 7 ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
43 simprr 773 . . . . . . 7 ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → (𝑓𝐴) = 0)
4442, 43jca 511 . . . . . 6 ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → (𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑓𝐴) = 0))
4544reximi2 3070 . . . . 5 (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0) → ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0)
4645anim2i 618 . . . 4 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0))
47 elaa 26282 . . . 4 (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0))
4846, 47sylibr 234 . . 3 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → 𝐴 ∈ 𝔸)
49 simpr 484 . . . 4 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0))
50 nfv 1916 . . . . . 6 𝑓 𝐴 ∈ ℂ
51 nfre1 3262 . . . . . 6 𝑓𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)
5250, 51nfan 1901 . . . . 5 𝑓(𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0))
53 nfv 1916 . . . . 5 𝑓 ¬ 𝐴 ∈ {0}
54 simpl3r 1231 . . . . . . . . 9 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) ∧ 𝐴 = 0) → (𝑓𝐴) = 0)
55 fveq2 6840 . . . . . . . . . . . . . . 15 (𝐴 = 0 → (𝑓𝐴) = (𝑓‘0))
56 eqid 2736 . . . . . . . . . . . . . . . 16 (coeff‘𝑓) = (coeff‘𝑓)
5756coefv0 26213 . . . . . . . . . . . . . . 15 (𝑓 ∈ (Poly‘ℤ) → (𝑓‘0) = ((coeff‘𝑓)‘0))
5855, 57sylan9eqr 2793 . . . . . . . . . . . . . 14 ((𝑓 ∈ (Poly‘ℤ) ∧ 𝐴 = 0) → (𝑓𝐴) = ((coeff‘𝑓)‘0))
5958adantlr 716 . . . . . . . . . . . . 13 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓𝐴) = ((coeff‘𝑓)‘0))
60 simplr 769 . . . . . . . . . . . . 13 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ((coeff‘𝑓)‘0) ≠ 0)
6159, 60eqnetrd 2999 . . . . . . . . . . . 12 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓𝐴) ≠ 0)
6261neneqd 2937 . . . . . . . . . . 11 (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ¬ (𝑓𝐴) = 0)
6362adantlrr 722 . . . . . . . . . 10 (((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓𝐴) = 0)
64633adantl1 1168 . . . . . . . . 9 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓𝐴) = 0)
6554, 64pm2.65da 817 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → ¬ 𝐴 = 0)
66 elsng 4581 . . . . . . . . . 10 (𝐴 ∈ ℂ → (𝐴 ∈ {0} ↔ 𝐴 = 0))
6766biimpa 476 . . . . . . . . 9 ((𝐴 ∈ ℂ ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
68673ad2antl1 1187 . . . . . . . 8 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
6965, 68mtand 816 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → ¬ 𝐴 ∈ {0})
70693exp 1120 . . . . . 6 (𝐴 ∈ ℂ → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0) → ¬ 𝐴 ∈ {0})))
7170adantr 480 . . . . 5 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0) → ¬ 𝐴 ∈ {0})))
7252, 53, 71rexlimd 3244 . . . 4 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0) → ¬ 𝐴 ∈ {0}))
7349, 72mpd 15 . . 3 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → ¬ 𝐴 ∈ {0})
7448, 73eldifd 3900 . 2 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)) → 𝐴 ∈ (𝔸 ∖ {0}))
7525, 74impbii 209 1 (𝐴 ∈ (𝔸 ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓𝐴) = 0)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wne 2932  wrex 3061  {crab 3389  cdif 3886  {csn 4567  cmpt 5166   × cxp 5629  cfv 6498  (class class class)co 7367  infcinf 9354  cc 11036  cr 11037  0cc0 11038   + caddc 11041   · cmul 11043   < clt 11179  cmin 11377  0cn0 12437  cz 12524  ...cfz 13461  cexp 14023  Σcsu 15648  0𝑝c0p 25636  Polycply 26149  coeffccoe 26151  degcdgr 26152  𝔸caa 26280
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-of 7631  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-pm 8776  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-sup 9355  df-inf 9356  df-oi 9425  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-n0 12438  df-z 12525  df-uz 12789  df-rp 12943  df-fz 13462  df-fzo 13609  df-fl 13751  df-seq 13964  df-exp 14024  df-hash 14293  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-abs 15198  df-clim 15450  df-rlim 15451  df-sum 15649  df-0p 25637  df-ply 26153  df-coe 26155  df-dgr 26156  df-aa 26281
This theorem is referenced by:  etransc  46711
  Copyright terms: Public domain W3C validator