Theorem uzrdgsuci 13922

Description: Successor value of a recursive definition generator on upper integers. See comment in om2uzrdg 13918. (Contributed by Mario Carneiro, 26-Jun-2013.) (Revised by Mario Carneiro, 13-Sep-2013.)

Hypotheses

Ref	Expression
om2uz.1	⊢ 𝐶 ∈ ℤ
om2uz.2	⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
uzrdg.1	⊢ 𝐴 ∈ V
uzrdg.2	⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)
uzrdg.3	⊢ 𝑆 = ran 𝑅

Assertion

Ref	Expression
uzrdgsuci	⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑆‘(𝐵 + 1)) = (𝐵𝐹(𝑆‘𝐵)))

Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐶   𝑦,𝐺   𝑥,𝐹,𝑦

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐺(𝑥)

Proof of Theorem uzrdgsuci

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		om2uz.1	. . . . . 6 ⊢ 𝐶 ∈ ℤ
2		om2uz.2	. . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 𝐶) ↾ ω)
3		uzrdg.1	. . . . . 6 ⊢ 𝐴 ∈ V
4		uzrdg.2	. . . . . 6 ⊢ 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)
5		uzrdg.3	. . . . . 6 ⊢ 𝑆 = ran 𝑅
6	1, 2, 3, 4, 5	uzrdgfni 13920	. . . . 5 ⊢ 𝑆 Fn (ℤ≥‘𝐶)
7		fnfun 6598	. . . . 5 ⊢ (𝑆 Fn (ℤ≥‘𝐶) → Fun 𝑆)
8	6, 7	ax-mp 5	. . . 4 ⊢ Fun 𝑆
9		peano2uz 12851	. . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐵 + 1) ∈ (ℤ≥‘𝐶))
10	1, 2, 3, 4	uzrdglem 13919	. . . . . 6 ⊢ ((𝐵 + 1) ∈ (ℤ≥‘𝐶) → ⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ ran 𝑅)
11	9, 10	syl 17	. . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ ran 𝑅)
12	11, 5	eleqtrrdi 2847	. . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑆)
13		funopfv 6889	. . . 4 ⊢ (Fun 𝑆 → (⟨(𝐵 + 1), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))⟩ ∈ 𝑆 → (𝑆‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1))))))
14	8, 12, 13	mpsyl 68	. . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑆‘(𝐵 + 1)) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1)))))
15	1, 2	om2uzf1oi 13915	. . . . . . . 8 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘𝐶)
16		f1ocnvdm 7240	. . . . . . . 8 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (◡𝐺‘𝐵) ∈ ω)
17	15, 16	mpan 691	. . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (◡𝐺‘𝐵) ∈ ω)
18		peano2 7841	. . . . . . 7 ⊢ ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
19	17, 18	syl 17	. . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → suc (◡𝐺‘𝐵) ∈ ω)
20	1, 2	om2uzsuci 13910	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝐺‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵)) + 1))
21	17, 20	syl 17	. . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐺‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵)) + 1))
22		f1ocnvfv2 7232	. . . . . . . . 9 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ 𝐵 ∈ (ℤ≥‘𝐶)) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
23	15, 22	mpan 691	. . . . . . . 8 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
24	23	oveq1d 7382	. . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ((𝐺‘(◡𝐺‘𝐵)) + 1) = (𝐵 + 1))
25	21, 24	eqtrd 2771	. . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1))
26		f1ocnvfv 7233	. . . . . . 7 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘𝐶) ∧ suc (◡𝐺‘𝐵) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵)))
27	15, 26	mpan 691	. . . . . 6 ⊢ (suc (◡𝐺‘𝐵) ∈ ω → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 + 1) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵)))
28	19, 25, 27	sylc 65	. . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (◡𝐺‘(𝐵 + 1)) = suc (◡𝐺‘𝐵))
29	28	fveq2d 6844	. . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑅‘(◡𝐺‘(𝐵 + 1))) = (𝑅‘suc (◡𝐺‘𝐵)))
30	29	fveq2d 6844	. . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (2nd ‘(𝑅‘(◡𝐺‘(𝐵 + 1)))) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
31	14, 30	eqtrd 2771	. 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑆‘(𝐵 + 1)) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
32		frsuc 8376	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
33	4	fveq1i 6841	. . . . . . . 8 ⊢ (𝑅‘suc (◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵))
34	4	fveq1i 6841	. . . . . . . . 9 ⊢ (𝑅‘(◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))
35	34	fveq2i 6843	. . . . . . . 8 ⊢ ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵)))
36	32, 33, 35	3eqtr4g 2796	. . . . . . 7 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
37	1, 2, 3, 4	om2uzrdg 13918	. . . . . . . . 9 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
38	37	fveq2d 6844	. . . . . . . 8 ⊢ ((◡𝐺‘𝐵) ∈ ω → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
39		df-ov 7370	. . . . . . . 8 ⊢ ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
40	38, 39	eqtr4di 2789	. . . . . . 7 ⊢ ((◡𝐺‘𝐵) ∈ ω → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
41	36, 40	eqtrd 2771	. . . . . 6 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
42		fvex 6853	. . . . . . 7 ⊢ (𝐺‘(◡𝐺‘𝐵)) ∈ V
43		fvex 6853	. . . . . . 7 ⊢ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V
44		oveq1 7374	. . . . . . . . 9 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧 + 1) = ((𝐺‘(◡𝐺‘𝐵)) + 1))
45		oveq1 7374	. . . . . . . . 9 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤))
46	44, 45	opeq12d 4824	. . . . . . . 8 ⊢ (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩)
47		oveq2 7375	. . . . . . . . 9 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
48	47	opeq2d 4823	. . . . . . . 8 ⊢ (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
49		oveq1 7374	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 + 1) = (𝑧 + 1))
50		oveq1 7374	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥𝐹𝑦) = (𝑧𝐹𝑦))
51	49, 50	opeq12d 4824	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨(𝑧 + 1), (𝑧𝐹𝑦)⟩)
52		oveq2 7375	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝑧𝐹𝑦) = (𝑧𝐹𝑤))
53	52	opeq2d 4823	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ⟨(𝑧 + 1), (𝑧𝐹𝑦)⟩ = ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩)
54	51, 53	cbvmpov 7462	. . . . . . . 8 ⊢ (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑧 ∈ V, 𝑤 ∈ V ↦ ⟨(𝑧 + 1), (𝑧𝐹𝑤)⟩)
55		opex 5416	. . . . . . . 8 ⊢ ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ V
56	46, 48, 54, 55	ovmpo 7527	. . . . . . 7 ⊢ (((𝐺‘(◡𝐺‘𝐵)) ∈ V ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V) → ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
57	42, 43, 56	mp2an 693	. . . . . 6 ⊢ ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩
58	41, 57	eqtrdi 2787	. . . . 5 ⊢ ((◡𝐺‘𝐵) ∈ ω → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
59	58	fveq2d 6844	. . . 4 ⊢ ((◡𝐺‘𝐵) ∈ ω → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩))
60		ovex 7400	. . . . 5 ⊢ ((𝐺‘(◡𝐺‘𝐵)) + 1) ∈ V
61		ovex 7400	. . . . 5 ⊢ ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ V
62	60, 61	op2nd 7951	. . . 4 ⊢ (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) + 1), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))
63	59, 62	eqtrdi 2787	. . 3 ⊢ ((◡𝐺‘𝐵) ∈ ω → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
64	17, 63	syl 17	. 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
65	1, 2, 3, 4	uzrdglem 13919	. . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
66	65, 5	eleqtrrdi 2847	. . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆)
67		funopfv 6889	. . . . 5 ⊢ (Fun 𝑆 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆 → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
68	8, 66, 67	mpsyl 68	. . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
69	68	eqcomd 2742	. . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) = (𝑆‘𝐵))
70	23, 69	oveq12d 7385	. 2 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = (𝐵𝐹(𝑆‘𝐵)))
71	31, 64, 70	3eqtrd 2775	1 ⊢ (𝐵 ∈ (ℤ≥‘𝐶) → (𝑆‘(𝐵 + 1)) = (𝐵𝐹(𝑆‘𝐵)))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  Vcvv 3429  ⟨cop 4573   ↦ cmpt 5166  ^◡ccnv 5630  ran crn 5632   ↾ cres 5633  suc csuc 6325  Fun wfun 6492   Fn wfn 6493  –1-1-onto→wf1o 6497  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  ωcom 7817  2^nd c2nd 7941  reccrdg 8348  1c1 11039   + caddc 11041  ℤcz 12524  ℤ_≥cuz 12788

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-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  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

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-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-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-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-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789

This theorem is referenced by:  seqp1  13978