Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  noinfepregs Structured version   Visualization version   GIF version

Theorem noinfepregs 35861
Description: There are no infinite descending ∈-chains, proven using ax-regs 35854. (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.
StepHypRef Expression
1 noinfepfnregs 35860 . . 3 ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥))
2 peano2 7905 . . . . . 6 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
32fvresd 6910 . . . . 5 (𝑥 ∈ ω → ((𝐹 ↾ ω)‘suc 𝑥) = (𝐹‘suc 𝑥))
4 fvres 6909 . . . . 5 (𝑥 ∈ ω → ((𝐹 ↾ ω)‘𝑥) = (𝐹‘𝑥))
53, 4neleq12d 3066 . . . 4 (𝑥 ∈ ω → (((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
65rexbiia 3107 . . 3 (∃𝑥 ∈ ω ((𝐹 ↾ ω)‘suc 𝑥) ∉ ((𝐹 ↾ ω)‘𝑥) ↔ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
71, 6sylib 221 . 2 ((𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
8 fnres 6671 . . . . 5 ((𝐹 ↾ ω) Fn ω ↔ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
98notbii 323 . . . 4 (¬ (𝐹 ↾ ω) Fn ω ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
10 rexnal 3114 . . . 4 (∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦 ↔ ¬ ∀𝑥 ∈ ω ∃!𝑦 𝑥𝐹𝑦)
119, 10sylbb2 241 . . 3 (¬ (𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦)
12 tz6.12-2 6877 . . . . 5 (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘𝑥) = ∅)
13 nel02 4284 . . . . . 6 ((𝐹‘𝑥) = ∅ → ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
14 df-nel 3062 . . . . . 6 ((𝐹‘suc 𝑥) ∉ (𝐹‘𝑥) ↔ ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
1513, 14sylibr 237 . . . . 5 ((𝐹‘𝑥) = ∅ → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
1612, 15syl 18 . . . 4 (¬ ∃!𝑦 𝑥𝐹𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
1716reximi 3100 . . 3 (∃𝑥 ∈ ω ¬ ∃!𝑦 𝑥𝐹𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
1811, 17syl 18 . 2 (¬ (𝐹 ↾ ω) Fn ω → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
197, 18pm2.61i 184 1 ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1569   ∈ wcel 2144  ∃!weu 2593   ∉ wnel 3061  ∀wral 3076  ∃wrex 3086  ∅c0 4277   class class class wbr 5102   ↾ cres 5653  suc csuc 6367   Fn wfn 6538  ‘cfv 6543  ωcom 7881
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755  ax-regs 35854
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-fv 6551  df-om 7882
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator