ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ctinfom GIF version

Theorem ctinfom 13297
Description: A condition for a set being countably infinite. Restates ennnfone 13294 in terms of ω and function image. Like ennnfone 13294 the condition can be summarized as 𝐴 being countable, infinite, and having decidable equality. (Contributed by Jim Kingdon, 7-Aug-2023.)
Assertion
Ref Expression
ctinfom (𝐴 ≈ ℕ ↔ (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))))
Distinct variable groups:   𝐴,𝑓,𝑛   𝑥,𝐴,𝑦   𝑓,𝑘,𝑛
Allowed substitution hint:   𝐴(𝑘)

Proof of Theorem ctinfom
Dummy variables 𝑎 𝑑 𝑖 𝑚 𝑔 𝑏 𝑐 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ennnfone 13294 . . . 4 (𝐴 ≈ ℕ ↔ (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑔(𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖))))
21simplbi 274 . . 3 (𝐴 ≈ ℕ → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
3 nnenom 10849 . . . . . . 7 ℕ ≈ ω
4 entr 7061 . . . . . . 7 ((𝐴 ≈ ℕ ∧ ℕ ≈ ω) → 𝐴 ≈ ω)
53, 4mpan2 429 . . . . . 6 (𝐴 ≈ ℕ → 𝐴 ≈ ω)
65ensymd 7060 . . . . 5 (𝐴 ≈ ℕ → ω ≈ 𝐴)
7 bren 7020 . . . . 5 (ω ≈ 𝐴 ↔ ∃𝑓 𝑓:ω–1-1-onto𝐴)
86, 7sylib 122 . . . 4 (𝐴 ≈ ℕ → ∃𝑓 𝑓:ω–1-1-onto𝐴)
9 f1ofo 5641 . . . . . . . 8 (𝑓:ω–1-1-onto𝐴𝑓:ω–onto𝐴)
109adantl 277 . . . . . . 7 ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) → 𝑓:ω–onto𝐴)
11 simpr 110 . . . . . . . . 9 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → 𝑛 ∈ ω)
12 nnord 4754 . . . . . . . . . . . 12 (𝑛 ∈ ω → Ord 𝑛)
1312adantl 277 . . . . . . . . . . 11 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → Ord 𝑛)
14 ordirr 4684 . . . . . . . . . . 11 (Ord 𝑛 → ¬ 𝑛𝑛)
1513, 14syl 14 . . . . . . . . . 10 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → ¬ 𝑛𝑛)
16 f1of1 5633 . . . . . . . . . . . 12 (𝑓:ω–1-1-onto𝐴𝑓:ω–1-1𝐴)
1716ad2antlr 493 . . . . . . . . . . 11 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → 𝑓:ω–1-1𝐴)
18 omelon 4751 . . . . . . . . . . . . 13 ω ∈ On
1918onelssi 4569 . . . . . . . . . . . 12 (𝑛 ∈ ω → 𝑛 ⊆ ω)
2019adantl 277 . . . . . . . . . . 11 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → 𝑛 ⊆ ω)
21 f1elima 5969 . . . . . . . . . . 11 ((𝑓:ω–1-1𝐴𝑛 ∈ ω ∧ 𝑛 ⊆ ω) → ((𝑓𝑛) ∈ (𝑓𝑛) ↔ 𝑛𝑛))
2217, 11, 20, 21syl3anc 1278 . . . . . . . . . 10 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → ((𝑓𝑛) ∈ (𝑓𝑛) ↔ 𝑛𝑛))
2315, 22mtbird 684 . . . . . . . . 9 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → ¬ (𝑓𝑛) ∈ (𝑓𝑛))
24 fveq2 5690 . . . . . . . . . . . 12 (𝑘 = 𝑛 → (𝑓𝑘) = (𝑓𝑛))
2524eleq1d 2307 . . . . . . . . . . 11 (𝑘 = 𝑛 → ((𝑓𝑘) ∈ (𝑓𝑛) ↔ (𝑓𝑛) ∈ (𝑓𝑛)))
2625notbid 677 . . . . . . . . . 10 (𝑘 = 𝑛 → (¬ (𝑓𝑘) ∈ (𝑓𝑛) ↔ ¬ (𝑓𝑛) ∈ (𝑓𝑛)))
2726rspcev 2929 . . . . . . . . 9 ((𝑛 ∈ ω ∧ ¬ (𝑓𝑛) ∈ (𝑓𝑛)) → ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))
2811, 23, 27syl2anc 415 . . . . . . . 8 (((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) ∧ 𝑛 ∈ ω) → ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))
2928ralrimiva 2623 . . . . . . 7 ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))
3010, 29jca 306 . . . . . 6 ((𝐴 ≈ ℕ ∧ 𝑓:ω–1-1-onto𝐴) → (𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)))
3130ex 115 . . . . 5 (𝐴 ≈ ℕ → (𝑓:ω–1-1-onto𝐴 → (𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))))
3231eximdv 1933 . . . 4 (𝐴 ≈ ℕ → (∃𝑓 𝑓:ω–1-1-onto𝐴 → ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))))
338, 32mpd 13 . . 3 (𝐴 ≈ ℕ → ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)))
342, 33jca 306 . 2 (𝐴 ≈ ℕ → (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))))
35 oveq1 6082 . . . . . . . . 9 (𝑏 = 𝑎 → (𝑏 + 1) = (𝑎 + 1))
3635cbvmptv 4222 . . . . . . . 8 (𝑏 ∈ ℤ ↦ (𝑏 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1))
37 freceq1 6653 . . . . . . . 8 ((𝑏 ∈ ℤ ↦ (𝑏 + 1)) = (𝑎 ∈ ℤ ↦ (𝑎 + 1)) → frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0))
3836, 37ax-mp 5 . . . . . . 7 frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) = frec((𝑎 ∈ ℤ ↦ (𝑎 + 1)), 0)
39 eqid 2238 . . . . . . 7 (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))
40 simpl 109 . . . . . . 7 ((𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)) → 𝑓:ω–onto𝐴)
41 fveq2 5690 . . . . . . . . . . . . 13 (𝑘 = 𝑑 → (𝑓𝑘) = (𝑓𝑑))
4241eleq1d 2307 . . . . . . . . . . . 12 (𝑘 = 𝑑 → ((𝑓𝑘) ∈ (𝑓𝑛) ↔ (𝑓𝑑) ∈ (𝑓𝑛)))
4342notbid 677 . . . . . . . . . . 11 (𝑘 = 𝑑 → (¬ (𝑓𝑘) ∈ (𝑓𝑛) ↔ ¬ (𝑓𝑑) ∈ (𝑓𝑛)))
4443cbvrexv 2787 . . . . . . . . . 10 (∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛) ↔ ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑛))
4544ralbii 2556 . . . . . . . . 9 (∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛) ↔ ∀𝑛 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑛))
46 imaeq2 5117 . . . . . . . . . . . . 13 (𝑛 = 𝑐 → (𝑓𝑛) = (𝑓𝑐))
4746eleq2d 2308 . . . . . . . . . . . 12 (𝑛 = 𝑐 → ((𝑓𝑑) ∈ (𝑓𝑛) ↔ (𝑓𝑑) ∈ (𝑓𝑐)))
4847notbid 677 . . . . . . . . . . 11 (𝑛 = 𝑐 → (¬ (𝑓𝑑) ∈ (𝑓𝑛) ↔ ¬ (𝑓𝑑) ∈ (𝑓𝑐)))
4948rexbidv 2551 . . . . . . . . . 10 (𝑛 = 𝑐 → (∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑛) ↔ ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑐)))
5049cbvralv 2786 . . . . . . . . 9 (∀𝑛 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑛) ↔ ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑐))
5145, 50sylbb 123 . . . . . . . 8 (∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛) → ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑐))
5251adantl 277 . . . . . . 7 ((𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)) → ∀𝑐 ∈ ω ∃𝑑 ∈ ω ¬ (𝑓𝑑) ∈ (𝑓𝑐))
5338, 39, 40, 52ctinfomlemom 13296 . . . . . 6 ((𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)) → ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
54 vex 2824 . . . . . . . 8 𝑓 ∈ V
55 frecex 6655 . . . . . . . . 9 frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) ∈ V
5655cnvex 5321 . . . . . . . 8 frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0) ∈ V
5754, 56coex 5328 . . . . . . 7 (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) ∈ V
58 foeq1 5606 . . . . . . . 8 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔:ℕ0onto𝐴 ↔ (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0onto𝐴))
59 fveq1 5689 . . . . . . . . . . . 12 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔𝑗) = ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗))
60 fveq1 5689 . . . . . . . . . . . 12 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (𝑔𝑖) = ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖))
6159, 60neeq12d 2440 . . . . . . . . . . 11 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → ((𝑔𝑗) ≠ (𝑔𝑖) ↔ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
6261ralbidv 2550 . . . . . . . . . 10 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∀𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖) ↔ ∀𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
6362rexbidv 2551 . . . . . . . . 9 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∃𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖) ↔ ∃𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
6463ralbidv 2550 . . . . . . . 8 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → (∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖) ↔ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)))
6558, 64anbi12d 477 . . . . . . 7 (𝑔 = (𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)) → ((𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖)) ↔ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖))))
6657, 65spcev 2920 . . . . . 6 (((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0)):ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑗) ≠ ((𝑓frec((𝑏 ∈ ℤ ↦ (𝑏 + 1)), 0))‘𝑖)) → ∃𝑔(𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖)))
6753, 66syl 14 . . . . 5 ((𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)) → ∃𝑔(𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖)))
6867exlimiv 1651 . . . 4 (∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛)) → ∃𝑔(𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖)))
6968anim2i 342 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))) → (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑔(𝑔:ℕ0onto𝐴 ∧ ∀𝑚 ∈ ℕ0𝑗 ∈ ℕ0𝑖 ∈ (0...𝑚)(𝑔𝑗) ≠ (𝑔𝑖))))
7069, 1sylibr 134 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))) → 𝐴 ≈ ℕ)
7134, 70impbii 126 1 (𝐴 ≈ ℕ ↔ (∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦 ∧ ∃𝑓(𝑓:ω–onto𝐴 ∧ ∀𝑛 ∈ ω ∃𝑘 ∈ ω ¬ (𝑓𝑘) ∈ (𝑓𝑛))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 104  wb 105  DECID wdc 846   = wceq 1402  wex 1545  wcel 2209  wne 2420  wral 2528  wrex 2529  wss 3220   class class class wbr 4125  cmpt 4187  Ord word 4502  ωcom 4732  ccnv 4768  cima 4772  ccom 4773  1-1wf1 5369  ontowfo 5370  1-1-ontowf1o 5371  cfv 5372  (class class class)co 6075  freccfrec 6651  cen 7010  0cc0 8169  1c1 8170   + caddc 8172  cn 9283  0cn0 9542  cz 9623  ...cfz 10390
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-er 6797  df-pm 6915  df-en 7013  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391  df-seqfrec 10863
This theorem is referenced by:  ctinf  13299
  Copyright terms: Public domain W3C validator