Theorem noinfepregs 35603

Description: There are no infinite descending ∈-chains, proven using ax-regs 35596. (Contributed by BTernaryTau, 18-Feb-2026.)

Assertion

Ref	Expression
noinfepregs	⊢ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)

Distinct variable group:   𝑥,𝐹

Proof of Theorem noinfepregs

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		noinfepfnregs 35602	. . 3 ⊢ ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥))
2		peano2 7892	. . . . . 6 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
3	2	fvresd 6905	. . . . 5 ⊢ (𝑥 ∈ ω → ((𝐹 ↾ ω)‘suc 𝑥) = (𝐹‘suc 𝑥))
4		fvres 6904	. . . . 5 ⊢ (𝑥 ∈ ω → ((𝐹 ↾ ω)‘𝑥) = (𝐹‘𝑥))
5	3, 4	neleq12d 3071	. . . 4 ⊢ (𝑥 ∈ ω → (((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
6	5	rexbiia 3112	. . 3 ⊢ (∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
7	1, 6	sylib 221	. 2 ⊢ ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
8		fnres 6666	. . . . 5 ⊢ ((𝐹 ↾ ω) Fn ω ↔ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
9	8	notbii 323	. . . 4 ⊢ (¬ (𝐹 ↾ ω) Fn ω ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
10		rexnal 3119	. . . 4 ⊢ (∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦 ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
11	9, 10	sylbb2 241	. . 3 ⊢ (¬ (𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦)
12		tz6.12-2 6872	. . . . 5 ⊢ (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘𝑥) = ∅)
13		nel02 4292	. . . . . 6 ⊢ ((𝐹‘𝑥) = ∅ → ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
14		df-nel 3067	. . . . . 6 ⊢ ((𝐹‘suc 𝑥) ∉ (𝐹‘𝑥) ↔ ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
15	13, 14	sylibr 237	. . . . 5 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
16	12, 15	syl 18	. . . 4 ⊢ (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
17	16	reximi 3105	. . 3 ⊢ (∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
18	11, 17	syl 18	. 2 ⊢ (¬ (𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
19	7, 18	pm2.61i 184	1 ⊢ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2146  ∃!weu 2598   ∉ wnel 3066  ∀wral 3081  ∃wrex 3091  ∅c0 4286   class class class wbr 5111   ↾ cres 5665  suc csuc 6366   Fn wfn 6535  ‘cfv 6540  ωcom 7868

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-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742  ax-regs 35596

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-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  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-br 5112  df-opab 5176  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  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-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548  df-om 7869

This theorem is used by: (None)