Theorem rmxypairf1o 43918

Description: The function used to extract rational and irrational parts in df-rmx 43909 and df-rmy 43910 in fact achieves a one-to-one mapping from the quadratic irrationals to pairs of integers. (Contributed by Stefan O'Rear, 21-Sep-2014.)

Assertion

Ref	Expression
rmxypairf1o	⊢ (𝐴 ∈ (ℤ≥‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})

Distinct variable group:   𝑏,𝑐,𝑑,𝑎,𝐴

Proof of Theorem rmxypairf1o

Step	Hyp	Ref	Expression
1		ovex 7453	. . . 4 ⊢ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) ∈ V
2		eqid 2760	. . . 4 ⊢ (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))
3	1, 2	fnmpti 6682	. . 3 ⊢ (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) Fn (ℕ0 × ℤ)
4	3	a1i 11	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) Fn (ℕ0 × ℤ))
5	2	rnmpt 5938	. . 3 ⊢ ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))}
6		vex 3454	. . . . . . . . . 10 ⊢ 𝑐 ∈ V
7		vex 3454	. . . . . . . . . 10 ⊢ 𝑑 ∈ V
8	6, 7	op1std 8011	. . . . . . . . 9 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (1st ‘𝑏) = 𝑐)
9	6, 7	op2ndd 8012	. . . . . . . . . 10 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (2nd ‘𝑏) = 𝑑)
10	9	oveq2d 7436	. . . . . . . . 9 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · 𝑑))
11	8, 10	oveq12d 7438	. . . . . . . 8 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)))
12	11	eqeq2d 2771	. . . . . . 7 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) ↔ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))))
13	12	rexxp 5818	. . . . . 6 ⊢ (∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) ↔ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)))
14	13	bicomi 227	. . . . 5 ⊢ (∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)) ↔ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))
15	14	a1i 11	. . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → (∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)) ↔ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))))
16	15	abbidv 2826	. . 3 ⊢ (𝐴 ∈ (ℤ≥‘2) → {𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))})
17	5, 16	eqtr4id 2814	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = {𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})
18		fveq2 6885	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (1st ‘𝑏) = (1st ‘𝑐))
19		fveq2 6885	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → (2nd ‘𝑏) = (2nd ‘𝑐))
20	19	oveq2d 7436	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐)))
21	18, 20	oveq12d 7438	. . . . . . 7 ⊢ (𝑏 = 𝑐 → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
22		ovex 7453	. . . . . . 7 ⊢ ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) ∈ V
23	21, 2, 22	fvmpt 6993	. . . . . 6 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
24	23	ad2antrl 741	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
25		fveq2 6885	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → (1st ‘𝑏) = (1st ‘𝑑))
26		fveq2 6885	. . . . . . . . 9 ⊢ (𝑏 = 𝑑 → (2nd ‘𝑏) = (2nd ‘𝑑))
27	26	oveq2d 7436	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑)))
28	25, 27	oveq12d 7438	. . . . . . 7 ⊢ (𝑏 = 𝑑 → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
29		ovex 7453	. . . . . . 7 ⊢ ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) ∈ V
30	28, 2, 29	fvmpt 6993	. . . . . 6 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
31	30	ad2antll 742	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
32	24, 31	eqeq12d 2776	. . . 4 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) ↔ ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑)))))
33		rmspecsqrtnq 43913	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ≥‘2) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
34	33	adantr 486	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
35		nn0ssq 13084	. . . . . . . 8 ⊢ ℕ0 ⊆ ℚ
36		xp1st 8033	. . . . . . . . 9 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → (1st ‘𝑐) ∈ ℕ0)
37	36	ad2antrl 741	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑐) ∈ ℕ0)
38	35, 37	sselid 3906	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑐) ∈ ℚ)
39		xp2nd 8034	. . . . . . . . 9 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → (2nd ‘𝑐) ∈ ℤ)
40	39	ad2antrl 741	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑐) ∈ ℤ)
41		zq 13081	. . . . . . . 8 ⊢ ((2nd ‘𝑐) ∈ ℤ → (2nd ‘𝑐) ∈ ℚ)
42	40, 41	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑐) ∈ ℚ)
43		xp1st 8033	. . . . . . . . 9 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → (1st ‘𝑑) ∈ ℕ0)
44	43	ad2antll 742	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑑) ∈ ℕ0)
45	35, 44	sselid 3906	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑑) ∈ ℚ)
46		xp2nd 8034	. . . . . . . . 9 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → (2nd ‘𝑑) ∈ ℤ)
47	46	ad2antll 742	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑑) ∈ ℤ)
48		zq 13081	. . . . . . . 8 ⊢ ((2nd ‘𝑑) ∈ ℤ → (2nd ‘𝑑) ∈ ℚ)
49	47, 48	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑑) ∈ ℚ)
50		qirropth 43915	. . . . . . 7 ⊢ (((√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ) ∧ ((1st ‘𝑐) ∈ ℚ ∧ (2nd ‘𝑐) ∈ ℚ) ∧ ((1st ‘𝑑) ∈ ℚ ∧ (2nd ‘𝑑) ∈ ℚ)) → (((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) ↔ ((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑))))
51	34, 38, 42, 45, 49, 50	syl122anc 1406	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) ↔ ((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑))))
52	51	biimpd 232	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) → ((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑))))
53		xpopth 8042	. . . . . 6 ⊢ ((𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ)) → (((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑)) ↔ 𝑐 = 𝑑))
54	53	adantl 487	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑)) ↔ 𝑐 = 𝑑))
55	52, 54	sylibd 242	. . . 4 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) → 𝑐 = 𝑑))
56	32, 55	sylbid 243	. . 3 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) → 𝑐 = 𝑑))
57	56	ralrimivva 3205	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ∀𝑐 ∈ (ℕ0 × ℤ)∀𝑑 ∈ (ℕ0 × ℤ)(((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) → 𝑐 = 𝑑))
58		dff1o6 7283	. 2 ⊢ ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} ↔ ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) Fn (ℕ0 × ℤ) ∧ ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = {𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} ∧ ∀𝑐 ∈ (ℕ0 × ℤ)∀𝑑 ∈ (ℕ0 × ℤ)(((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) → 𝑐 = 𝑑)))
59	4, 17, 57, 58	syl3anbrc 1362	1 ⊢ (𝐴 ∈ (ℤ≥‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086   ∖ cdif 4045  ⟨cop 4589   ↦ cmpt 5185   × cxp 5648  ran crn 5651   Fn wfn 6533  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420  1^st c1st 7999  2^nd c2nd 8000  ℂcc 11198  1c1 11201   + caddc 11203   · cmul 11205   − cmin 11541  2c2 12397  ℕ₀cn0 12606  ℤcz 12693  ℤ_≥cuz 12965  ℚcq 13075  ↑cexp 14204  √csqrt 15400

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277  ax-pre-sup 11278

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-sup 9434  df-inf 9435  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-3 12406  df-n0 12607  df-z 12694  df-uz 12966  df-q 13076  df-rp 13121  df-fl 13932  df-mod 14010  df-seq 14145  df-exp 14205  df-cj 15266  df-re 15267  df-im 15268  df-sqrt 15402  df-abs 15403  df-dvds 16423  df-gcd 16665  df-numer 16911  df-denom 16912

This theorem is used by:  rmxyelxp  43919  rmxyval  43922