Theorem noinfepregs 35942

Description: There are no infinite descending ∈-chains, proven using ax-regs 35935. (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 35941	. . 3 ⊢ ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥))
2		peano2 7935	. . . . . 6 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
3	2	fvresd 6936	. . . . 5 ⊢ (𝑥 ∈ ω → ((𝐹 ↾ ω)‘suc 𝑥) = (𝐹‘suc 𝑥))
4		fvres 6935	. . . . 5 ⊢ (𝑥 ∈ ω → ((𝐹 ↾ ω)‘𝑥) = (𝐹‘𝑥))
5	3, 4	neleq12d 3070	. . . 4 ⊢ (𝑥 ∈ ω → (((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
6	5	rexbiia 3111	. . 3 ⊢ (∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
7	1, 6	sylib 221	. 2 ⊢ ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
8		fnres 6696	. . . . 5 ⊢ ((𝐹 ↾ ω) Fn ω ↔ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
9	8	notbii 323	. . . 4 ⊢ (¬ (𝐹 ↾ ω) Fn ω ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
10		rexnal 3118	. . . 4 ⊢ (∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦 ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
11	9, 10	sylbb2 241	. . 3 ⊢ (¬ (𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦)
12		tz6.12-2 6903	. . . . 5 ⊢ (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘𝑥) = ∅)
13		nel02 4288	. . . . . 6 ⊢ ((𝐹‘𝑥) = ∅ → ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
14		df-nel 3066	. . . . . 6 ⊢ ((𝐹‘suc 𝑥) ∉ (𝐹‘𝑥) ↔ ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
15	13, 14	sylibr 237	. . . . 5 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
16	12, 15	syl 18	. . . 4 ⊢ (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
17	16	reximi 3104	. . 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 2147  ∃!weu 2596   ∉ wnel 3065  ∀wral 3080  ∃wrex 3090  ∅c0 4281   class class class wbr 5108   ↾ cres 5660  suc csuc 6390   Fn wfn 6561  ‘cfv 6566  ωcom 7911

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783  ax-regs 35935

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574  df-om 7912

This theorem is used by: (None)