MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  noinfep Structured version   Visualization version   GIF version

Theorem noinfep 9550
Description: Using the Axiom of Regularity in the form zfregfr 9494, show that there are no infinite descending -chains. Proposition 7.34 of [TakeutiZaring] p. 44. (Contributed by NM, 26-Jan-2006.) (Revised by Mario Carneiro, 22-Mar-2013.)
Assertion
Ref Expression
noinfep 𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)
Distinct variable group:   𝑥,𝐹

Proof of Theorem noinfep
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 omex 9533 . . . . 5 ω ∈ V
21mptex 7157 . . . 4 (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V
32rnex 7840 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V
4 zfregfr 9494 . . 3 E Fr ran (𝑤 ∈ ω ↦ (𝐹𝑤))
5 ssid 3952 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹𝑤))
6 dmmptg 6189 . . . . . 6 (∀𝑤 ∈ ω (𝐹𝑤) ∈ V → dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ω)
7 fvexd 6837 . . . . . 6 (𝑤 ∈ ω → (𝐹𝑤) ∈ V)
86, 7mprg 3053 . . . . 5 dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ω
9 peano1 7819 . . . . . 6 ∅ ∈ ω
109ne0ii 4291 . . . . 5 ω ≠ ∅
118, 10eqnetri 2998 . . . 4 dom (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅
12 dm0rn0 5863 . . . . 5 (dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) = ∅)
1312necon3bii 2980 . . . 4 (dom (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅)
1411, 13mpbi 230 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅
15 fri 5572 . . 3 (((ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V ∧ E Fr ran (𝑤 ∈ ω ↦ (𝐹𝑤))) ∧ (ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∧ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅)) → ∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦)
163, 4, 5, 14, 15mp4an 693 . 2 𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦
17 fvex 6835 . . . . . . 7 (𝐹𝑤) ∈ V
18 eqid 2731 . . . . . . 7 (𝑤 ∈ ω ↦ (𝐹𝑤)) = (𝑤 ∈ ω ↦ (𝐹𝑤))
1917, 18fnmpti 6624 . . . . . 6 (𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω
20 fvelrnb 6882 . . . . . 6 ((𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦))
2119, 20ax-mp 5 . . . . 5 (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦)
22 peano2 7820 . . . . . . . . . 10 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
23 fveq2 6822 . . . . . . . . . . 11 (𝑤 = suc 𝑥 → (𝐹𝑤) = (𝐹‘suc 𝑥))
24 fvex 6835 . . . . . . . . . . 11 (𝐹‘suc 𝑥) ∈ V
2523, 18, 24fvmpt 6929 . . . . . . . . . 10 (suc 𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
2622, 25syl 17 . . . . . . . . 9 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
27 fnfvelrn 7013 . . . . . . . . . 10 (((𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω ∧ suc 𝑥 ∈ ω) → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
2819, 22, 27sylancr 587 . . . . . . . . 9 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
2926, 28eqeltrrd 2832 . . . . . . . 8 (𝑥 ∈ ω → (𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
30 epel 5517 . . . . . . . . . . . 12 (𝑧 E 𝑦𝑧𝑦)
31 eleq1 2819 . . . . . . . . . . . 12 (𝑧 = (𝐹‘suc 𝑥) → (𝑧𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
3230, 31bitrid 283 . . . . . . . . . . 11 (𝑧 = (𝐹‘suc 𝑥) → (𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
3332notbid 318 . . . . . . . . . 10 (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦))
34 df-nel 3033 . . . . . . . . . 10 ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦)
3533, 34bitr4di 289 . . . . . . . . 9 (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∉ 𝑦))
3635rspccv 3569 . . . . . . . 8 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ((𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → (𝐹‘suc 𝑥) ∉ 𝑦))
3729, 36syl5com 31 . . . . . . 7 (𝑥 ∈ ω → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝐹‘suc 𝑥) ∉ 𝑦))
38 fveq2 6822 . . . . . . . . . . 11 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
39 fvex 6835 . . . . . . . . . . 11 (𝐹𝑥) ∈ V
4038, 18, 39fvmpt 6929 . . . . . . . . . 10 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = (𝐹𝑥))
41 eqeq1 2735 . . . . . . . . . 10 (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = (𝐹𝑥) ↔ 𝑦 = (𝐹𝑥)))
4240, 41syl5ibcom 245 . . . . . . . . 9 (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦𝑦 = (𝐹𝑥)))
43 neleq2 3039 . . . . . . . . . 10 (𝑦 = (𝐹𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4443biimpd 229 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4542, 44syl6 35 . . . . . . . 8 (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4645com23 86 . . . . . . 7 (𝑥 ∈ ω → ((𝐹‘suc 𝑥) ∉ 𝑦 → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4737, 46syldc 48 . . . . . 6 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4847reximdvai 3143 . . . . 5 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4921, 48biimtrid 242 . . . 4 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
5049com12 32 . . 3 (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
5150rexlimiv 3126 . 2 (∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥))
5216, 51ax-mp 5 1 𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206   = wceq 1541  wcel 2111  wne 2928  wnel 3032  wral 3047  wrex 3056  Vcvv 3436  wss 3897  c0 4280   class class class wbr 5089  cmpt 5170   E cep 5513   Fr wfr 5564  dom cdm 5614  ran crn 5615  suc csuc 6308   Fn wfn 6476  cfv 6481  ωcom 7796
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668  ax-reg 9478  ax-inf2 9531
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-om 7797
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator