Theorem rmxypairf1o 43666

Description: The function used to extract rational and irrational parts in df-rmx 43657 and df-rmy 43658 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 7445	. . . 4 ⊢ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) ∈ V
2		eqid 2762	. . . 4 ⊢ (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))
3	1, 2	fnmpti 6678	. . 3 ⊢ (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) Fn (ℕ0 × ℤ)
4	3	a1i 11	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) Fn (ℕ0 × ℤ))
5	2	rnmpt 5946	. . 3 ⊢ ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))}
6		vex 3458	. . . . . . . . . 10 ⊢ 𝑐 ∈ V
7		vex 3458	. . . . . . . . . 10 ⊢ 𝑑 ∈ V
8	6, 7	op1std 7994	. . . . . . . . 9 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (1st ‘𝑏) = 𝑐)
9	6, 7	op2ndd 7995	. . . . . . . . . 10 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (2nd ‘𝑏) = 𝑑)
10	9	oveq2d 7428	. . . . . . . . 9 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · 𝑑))
11	8, 10	oveq12d 7430	. . . . . . . 8 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)))
12	11	eqeq2d 2773	. . . . . . 7 ⊢ (𝑏 = ⟨𝑐, 𝑑⟩ → (𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) ↔ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))))
13	12	rexxp 5827	. . . . . 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 2828	. . 3 ⊢ (𝐴 ∈ (ℤ≥‘2) → {𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))})
17	5, 16	eqtr4id 2816	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)))) = {𝑎 ∣ ∃𝑐 ∈ ℕ0 ∃𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})
18		fveq2 6881	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (1st ‘𝑏) = (1st ‘𝑐))
19		fveq2 6881	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → (2nd ‘𝑏) = (2nd ‘𝑐))
20	19	oveq2d 7428	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐)))
21	18, 20	oveq12d 7430	. . . . . . 7 ⊢ (𝑏 = 𝑐 → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
22		ovex 7445	. . . . . . 7 ⊢ ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) ∈ V
23	21, 2, 22	fvmpt 6989	. . . . . 6 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
24	23	ad2antrl 740	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))))
25		fveq2 6881	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → (1st ‘𝑏) = (1st ‘𝑑))
26		fveq2 6881	. . . . . . . . 9 ⊢ (𝑏 = 𝑑 → (2nd ‘𝑏) = (2nd ‘𝑑))
27	26	oveq2d 7428	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑)))
28	25, 27	oveq12d 7430	. . . . . . 7 ⊢ (𝑏 = 𝑑 → ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
29		ovex 7445	. . . . . . 7 ⊢ ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))) ∈ V
30	28, 2, 29	fvmpt 6989	. . . . . 6 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
31	30	ad2antll 741	. . . . 5 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑))))
32	24, 31	eqeq12d 2778	. . . 4 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) ↔ ((1st ‘𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑐))) = ((1st ‘𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑑)))))
33		rmspecsqrtnq 43661	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ≥‘2) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
34	33	adantr 485	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
35		nn0ssq 12987	. . . . . . . 8 ⊢ ℕ0 ⊆ ℚ
36		xp1st 8016	. . . . . . . . 9 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → (1st ‘𝑐) ∈ ℕ0)
37	36	ad2antrl 740	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑐) ∈ ℕ0)
38	35, 37	sselid 3934	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑐) ∈ ℚ)
39		xp2nd 8017	. . . . . . . . 9 ⊢ (𝑐 ∈ (ℕ0 × ℤ) → (2nd ‘𝑐) ∈ ℤ)
40	39	ad2antrl 740	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑐) ∈ ℤ)
41		zq 12984	. . . . . . . 8 ⊢ ((2nd ‘𝑐) ∈ ℤ → (2nd ‘𝑐) ∈ ℚ)
42	40, 41	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑐) ∈ ℚ)
43		xp1st 8016	. . . . . . . . 9 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → (1st ‘𝑑) ∈ ℕ0)
44	43	ad2antll 741	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑑) ∈ ℕ0)
45	35, 44	sselid 3934	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st ‘𝑑) ∈ ℚ)
46		xp2nd 8017	. . . . . . . . 9 ⊢ (𝑑 ∈ (ℕ0 × ℤ) → (2nd ‘𝑑) ∈ ℤ)
47	46	ad2antll 741	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑑) ∈ ℤ)
48		zq 12984	. . . . . . . 8 ⊢ ((2nd ‘𝑑) ∈ ℤ → (2nd ‘𝑑) ∈ ℚ)
49	47, 48	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ≥‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd ‘𝑑) ∈ ℚ)
50		qirropth 43663	. . . . . . 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 1405	. . . . . 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 8025	. . . . . 6 ⊢ ((𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ)) → (((1st ‘𝑐) = (1st ‘𝑑) ∧ (2nd ‘𝑐) = (2nd ‘𝑑)) ↔ 𝑐 = 𝑑))
54	53	adantl 486	. . . . 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 3207	. 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ∀𝑐 ∈ (ℕ0 × ℤ)∀𝑑 ∈ (ℕ0 × ℤ)(((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st ‘𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd ‘𝑏))))‘𝑑) → 𝑐 = 𝑑))
58		dff1o6 7273	. 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 1361	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 400   = wceq 1569   ∈ wcel 2142  {cab 2740  ∀wral 3078  ∃wrex 3088   ∖ cdif 3901  ⟨cop 4594   ↦ cmpt 5191   × cxp 5658  ran crn 5661   Fn wfn 6531  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7412  1^st c1st 7982  2^nd c2nd 7983  ℂcc 11104  1c1 11107   + caddc 11109   · cmul 11111   − cmin 11447  2c2 12301  ℕ₀cn0 12510  ℤcz 12597  ℤ_≥cuz 12868  ℚcq 12978  ↑cexp 14104  √csqrt 15291

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183  ax-pre-sup 11184

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-er 8692  df-en 8942  df-dom 8943  df-sdom 8944  df-sup 9400  df-inf 9401  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255  df-sub 11449  df-neg 11450  df-div 11878  df-nn 12240  df-2 12309  df-3 12310  df-n0 12511  df-z 12598  df-uz 12869  df-q 12979  df-rp 13023  df-fl 13832  df-mod 13910  df-seq 14045  df-exp 14105  df-cj 15157  df-re 15158  df-im 15159  df-sqrt 15293  df-abs 15294  df-dvds 16317  df-gcd 16559  df-numer 16800  df-denom 16801

This theorem is used by:  rmxyelxp  43667  rmxyval  43670