Theorem elaa2 47006

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 26530	. . . 4 ⊢ 𝔸 ⊆ ℂ
2		eldifi 4085	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ 𝔸)
3	1, 2	sselid 3936	. . 3 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ∈ ℂ)
4		elaa 26528	. . . . . 6 ⊢ (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0))
5	2, 4	sylib 221	. . . . 5 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0))
6	5	simprd 501	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0)
7	2	3ad2ant1 1151	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝐴 ∈ 𝔸)
8		eldifsni 4760	. . . . . . 7 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → 𝐴 ≠ 0)
9	8	3ad2ant1 1151	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝐴 ≠ 0)
10		eldifi 4085	. . . . . . 7 ⊢ (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ∈ (Poly‘ℤ))
11	10	3ad2ant2 1152	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝑔 ∈ (Poly‘ℤ))
12		eldifsni 4760	. . . . . . 7 ⊢ (𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) → 𝑔 ≠ 0𝑝)
13	12	3ad2ant2 1152	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → 𝑔 ≠ 0𝑝)
14		simp3 1156	. . . . . 6 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → (𝑔‘𝐴) = 0)
15		fveq2 6885	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → ((coeff‘𝑔)‘𝑚) = ((coeff‘𝑔)‘𝑛))
16	15	neeq1d 3019	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (((coeff‘𝑔)‘𝑚) ≠ 0 ↔ ((coeff‘𝑔)‘𝑛) ≠ 0))
17	16	cbvrabv 3428	. . . . . . 7 ⊢ {𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0} = {𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}
18	17	infeq1i 9446	. . . . . 6 ⊢ inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ) = inf({𝑛 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑛) ≠ 0}, ℝ, < )
19		fvoveq1 7442	. . . . . . 7 ⊢ (𝑗 = 𝑘 → ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))) = ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
20	19	cbvmptv 5217	. . . . . 6 ⊢ (𝑗 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑗 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < )))) = (𝑘 ∈ ℕ0 ↦ ((coeff‘𝑔)‘(𝑘 + inf({𝑚 ∈ ℕ0 ∣ ((coeff‘𝑔)‘𝑚) ≠ 0}, ℝ, < ))))
21		eqid 2765	. . . . . 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 47005	. . . . 5 ⊢ ((𝐴 ∈ (𝔸 ∖ {0}) ∧ 𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑔‘𝐴) = 0) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
23	22	rexlimdv3a 3172	. . . 4 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (∃𝑔 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑔‘𝐴) = 0 → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))
24	6, 23	mpd 16	. . 3 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
25	3, 24	jca 521	. 2 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))
26		simpl 488	. . . . . . . . 9 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ (Poly‘ℤ))
27		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 0𝑝 → (coeff‘𝑓) = (coeff‘0𝑝))
28		coe0 26464	. . . . . . . . . . . . . . 15 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
29	27, 28	eqtrdi 2816	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 0𝑝 → (coeff‘𝑓) = (ℕ0 × {0}))
30	29	fveq1d 6887	. . . . . . . . . . . . 13 ⊢ (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = ((ℕ0 × {0})‘0))
31		0nn0 12534	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℕ0
32		fvconst2g 7207	. . . . . . . . . . . . . 14 ⊢ ((0 ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((ℕ0 × {0})‘0) = 0)
33	31, 31, 32	mp2an 705	. . . . . . . . . . . . 13 ⊢ ((ℕ0 × {0})‘0) = 0
34	30, 33	eqtrdi 2816	. . . . . . . . . . . 12 ⊢ (𝑓 = 0𝑝 → ((coeff‘𝑓)‘0) = 0)
35	34	adantl 487	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ((coeff‘𝑓)‘0) = 0)
36		neneq 2966	. . . . . . . . . . . 12 ⊢ (((coeff‘𝑓)‘0) ≠ 0 → ¬ ((coeff‘𝑓)‘0) = 0)
37	36	ad2antlr 740	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝑓 = 0𝑝) → ¬ ((coeff‘𝑓)‘0) = 0)
38	35, 37	pm2.65da 829	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 = 0𝑝)
39		velsn 4607	. . . . . . . . . 10 ⊢ (𝑓 ∈ {0𝑝} ↔ 𝑓 = 0𝑝)
40	38, 39	sylnibr 332	. . . . . . . . 9 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → ¬ 𝑓 ∈ {0𝑝})
41	26, 40	eldifd 3917	. . . . . . . 8 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
42	41	adantrr 730	. . . . . . 7 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → 𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}))
43		simprr 785	. . . . . . 7 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓‘𝐴) = 0)
44	42, 43	jca 521	. . . . . 6 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝}) ∧ (𝑓‘𝐴) = 0))
45	44	reximi2 3100	. . . . 5 ⊢ (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0)
46	45	anim2i 629	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0))
47		elaa 26528	. . . 4 ⊢ (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓‘𝐴) = 0))
48	46, 47	sylibr 237	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → 𝐴 ∈ 𝔸)
49		simpr 490	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
50		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑓 𝐴 ∈ ℂ
51		nfre1 3292	. . . . . 6 ⊢ Ⅎ𝑓∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)
52	50, 51	nfan 1932	. . . . 5 ⊢ Ⅎ𝑓(𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0))
53		nfv 1947	. . . . 5 ⊢ Ⅎ𝑓 ¬ 𝐴 ∈ {0}
54		simpl3r 1248	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 = 0) → (𝑓‘𝐴) = 0)
55		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝐴 = 0 → (𝑓‘𝐴) = (𝑓‘0))
56		eqid 2765	. . . . . . . . . . . . . . . 16 ⊢ (coeff‘𝑓) = (coeff‘𝑓)
57	56	coefv0 26456	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ (Poly‘ℤ) → (𝑓‘0) = ((coeff‘𝑓)‘0))
58	55, 57	sylan9eqr 2822	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ (Poly‘ℤ) ∧ 𝐴 = 0) → (𝑓‘𝐴) = ((coeff‘𝑓)‘0))
59	58	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓‘𝐴) = ((coeff‘𝑓)‘0))
60		simplr 781	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ((coeff‘𝑓)‘0) ≠ 0)
61	59, 60	eqnetrd 3027	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → (𝑓‘𝐴) ≠ 0)
62	61	neneqd 2965	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ ((coeff‘𝑓)‘0) ≠ 0) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
63	62	adantlrr 734	. . . . . . . . . 10 ⊢ (((𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
64	63	3adantl1 1185	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 = 0) → ¬ (𝑓‘𝐴) = 0)
65	54, 64	pm2.65da 829	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 = 0)
66		elsng 4605	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℂ → (𝐴 ∈ {0} ↔ 𝐴 = 0))
67	66	biimpa 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
68	67	3ad2antl1 1204	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) ∧ 𝐴 ∈ {0}) → 𝐴 = 0)
69	65, 68	mtand 828	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑓 ∈ (Poly‘ℤ) ∧ (((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 ∈ {0})
70	69	3exp 1137	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0})))
71	70	adantr 486	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (𝑓 ∈ (Poly‘ℤ) → ((((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0})))
72	52, 53, 71	rexlimd 3274	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → (∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0) → ¬ 𝐴 ∈ {0}))
73	49, 72	mpd 16	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → ¬ 𝐴 ∈ {0})
74	48, 73	eldifd 3917	. 2 ⊢ ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)) → 𝐴 ∈ (𝔸 ∖ {0}))
75	25, 74	impbii 212	1 ⊢ (𝐴 ∈ (𝔸 ∖ {0}) ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ (Poly‘ℤ)(((coeff‘𝑓)‘0) ≠ 0 ∧ (𝑓‘𝐴) = 0)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∃wrex 3091  {crab 3418   ∖ cdif 3903  {csn 4591   ↦ cmpt 5194   × cxp 5661  ‘cfv 6540  (class class class)co 7419  infcinf 9408  ℂcc 11113  ℝcr 11114  0cc0 11115   + caddc 11118   · cmul 11120   < clt 11258   − cmin 11456  ℕ₀cn0 12519  ℤcz 12606  ...cfz 13551  ↑cexp 14115  Σcsu 15761  0_𝑝c0p 25879  Polycply 26392  coeffccoe 26394  degcdgr 26395  𝔸caa 26526

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-inf2 9617  ax-cnex 11171  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-pre-mulgt0 11192  ax-pre-sup 11193

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-op 4598  df-uni 4875  df-int 4915  df-iun 4960  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-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-map 8832  df-pm 8833  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-sup 9409  df-inf 9410  df-oi 9479  df-card 9941  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-sub 11458  df-neg 11459  df-div 11887  df-nn 12249  df-2 12318  df-3 12319  df-n0 12520  df-z 12607  df-uz 12879  df-rp 13033  df-fz 13552  df-fzo 13700  df-fl 13843  df-seq 14056  df-exp 14116  df-hash 14385  df-cj 15174  df-re 15175  df-im 15176  df-sqrt 15310  df-abs 15311  df-clim 15563  df-rlim 15564  df-sum 15762  df-0p 25880  df-ply 26396  df-coe 26398  df-dgr 26399  df-aa 26527

This theorem is used by:  etransc  47055