Theorem elaa2 46680

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.

Step	Hyp	Ref	Expression
1		aasscn 26295	. . . 4 ⊢ 𝔸 ⊆ ℂ
2		eldifi 4072	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ 𝔸)
3	1, 2	sselid 3920	. . 3 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ ℂ)
4		elaa 26293	. . . . . 6 ⊢ (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0))
5	2, 4	sylib 218	. . . . 5 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0))
6	5	simprd 495	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0)
7	2	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝐴 ∈ 𝔸)
8		eldifsni 4734	. . . . . . 7 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ≠ 0)
9	8	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝐴 ≠ 0)
10		eldifi 4072	. . . . . . 7 ⊢ (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ∈ (Poly‘ℤ))
11	10	3ad2ant2 1135	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝑔 ∈ (Poly‘ℤ))
12		eldifsni 4734	. . . . . . 7 ⊢ (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ≠ 0𝑝)
13	12	3ad2ant2 1135	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝑔 ≠ 0𝑝)
14		simp3 1139	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → (𝑔‘𝐴) = 0)
15		fveq2 6834	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → ((coeff‘𝑔)‘𝑚) = ((coeff‘𝑔)‘𝑛))
16	15	neeq1d 2992	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (((coeff‘𝑔)‘𝑚) ≠ 0 ↔ ((coeff‘𝑔)‘𝑛) ≠ 0))
17	16	cbvrabv 3400	. . . . . . 7 ⊢ {𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0} = {𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}
18	17	infeq1i 9385	. . . . . 6 ⊢ inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ) = inf({𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}, ℝ, < )
19		fvoveq1 7383	. . . . . . 7 ⊢ (𝑗 = 𝑘 → ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))) = ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
20	19	cbvmptv 5190	. . . . . 6 ⊢ (𝑗 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < )))) = (𝑘 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
21		eqid 2737	. . . . . 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}, ℝ, < ))))‘𝑘) · (𝑧↑𝑘)))
22	7, 9, 11, 13, 14, 18, 20, 21	elaa2lem 46679	. . . . 5 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
23	22	rexlimdv3a 3143	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0 → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))
24	6, 23	mpd 15	. . 3 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
25	3, 24	jca 511	. 2 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))
26		simpl 482	. . . . . . . . 9 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ (Poly‘ℤ))
27		fveq2 6834	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 0𝑝 → (coeff‘𝑓) = (coeff‘0𝑝))
28		coe0 26231	. . . . . . . . . . . . . . 15 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
29	27, 28	eqtrdi 2788	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 0𝑝 → (coeff‘𝑓) = (ℕ0 × {0}))
30	29	fveq1d 6836	. . . . . . . . . . . . 13 ⊢ (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = ((ℕ0 × {0})‘0))
31		0nn0 12443	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℕ0
32		fvconst2g 7150	. . . . . . . . . . . . . 14 ⊢ ((0 ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((ℕ0 × {0})‘0) = 0)
33	31, 31, 32	mp2an 693	. . . . . . . . . . . . 13 ⊢ ((ℕ0 × {0})‘0) = 0
34	30, 33	eqtrdi 2788	. . . . . . . . . . . 12 ⊢ (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = 0)
35	34	adantl 481	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ((coeff‘𝑓)‘0) = 0)
36		neneq 2939	. . . . . . . . . . . 12 ⊢ (((coeff‘𝑓)‘0) ≠ 0 → ¬ ((coeff‘𝑓)‘0) = 0)
37	36	ad2antlr 728	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ¬ ((coeff‘𝑓)‘0) = 0)
38	35, 37	pm2.65da 817	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 = 0𝑝)
39		velsn 4584	. . . . . . . . . 10 ⊢ (𝑓 ∈ {0𝑝} ↔ 𝑓 = 0𝑝)
40	38, 39	sylnibr 329	. . . . . . . . 9 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 ∈ {0𝑝})
41	26, 40	eldifd 3901	. . . . . . . 8 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
42	41	adantrr 718	. . . . . . 7 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
43		simprr 773	. . . . . . 7 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓‘𝐴) = 0)
44	42, 43	jca 511	. . . . . 6 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑓‘𝐴) = 0))
45	44	reximi2 3071	. . . . 5 ⊢ (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0)
46	45	anim2i 618	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0))
47		elaa 26293	. . . 4 ⊢ (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0))
48	46, 47	sylibr 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 3263	. . . . . 6 ⊢ Ⅎ𝑓∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)
52	50, 51	nfan 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 6834	. . . . . . . . . . . . . . 15 ⊢ (𝐴 = 0 → (𝑓‘𝐴) = (𝑓‘0))
56		eqid 2737	. . . . . . . . . . . . . . . 16 ⊢ (coeff‘𝑓) = (coeff‘𝑓)
57	56	coefv0 26223	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ (Poly‘ℤ) → (𝑓‘0) = ((coeff‘𝑓)‘0))
58	55, 57	sylan9eqr 2794	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ 𝐴 = 0) → (𝑓‘𝐴) = ((coeff‘𝑓)‘0))
59	58	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓‘𝐴) = ((coeff‘𝑓)‘0))
60		simplr 769	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ((coeff‘𝑓)‘0) ≠ 0)
61	59, 60	eqnetrd 3000	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓‘𝐴) ≠ 0)
62	61	neneqd 2938	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
63	62	adantlrr 722	. . . . . . . . . 10 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
64	63	3adantl1 1168	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
65	54, 64	pm2.65da 817	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 = 0)
66		elsng 4582	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℂ → (𝐴 ∈ {0} ↔ 𝐴 = 0))
67	66	biimpa 476	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
68	67	3ad2antl1 1187	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
69	65, 68	mtand 816	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 ∈ {0})
70	69	3exp 1120	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0})))
71	70	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0})))
72	52, 53, 71	rexlimd 3245	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0}))
73	49, 72	mpd 15	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 ∈ {0})
74	48, 73	eldifd 3901	. 2 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → 𝐴 ∈ (𝔸 ∖ {0}))
75	25, 74	impbii 209	1 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062  {crab 3390   ∖ cdif 3887  {csn 4568   ↦ cmpt 5167   × cxp 5622  ‘cfv 6492  (class class class)co 7360  infcinf 9347  ℂcc 11027  ℝcr 11028  0cc0 11029   + caddc 11032   · cmul 11034   < clt 11170   − cmin 11368  ℕ₀cn0 12428  ℤcz 12515  ...cfz 13452  ↑cexp 14014  Σcsu 15639  0_𝑝c0p 25646  Polycply 26159  coeffccoe 26161  degcdgr 26162  𝔸caa 26291

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 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107

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-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-pm 8769  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-sup 9348  df-inf 9349  df-oi 9418  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-n0 12429  df-z 12516  df-uz 12780  df-rp 12934  df-fz 13453  df-fzo 13600  df-fl 13742  df-seq 13955  df-exp 14015  df-hash 14284  df-cj 15052  df-re 15053  df-im 15054  df-sqrt 15188  df-abs 15189  df-clim 15441  df-rlim 15442  df-sum 15640  df-0p 25647  df-ply 26163  df-coe 26165  df-dgr 26166  df-aa 26292

This theorem is referenced by:  etransc  46729