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

Theorem noinfep 9655
Description: Using the Axiom of Regularity in the form zfregfr 9600, 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 9638 . . . . 5 ω ∈ V
21mptex 7225 . . . 4 (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V
32rnex 7903 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V
4 zfregfr 9600 . . 3 E Fr ran (𝑤 ∈ ω ↦ (𝐹𝑤))
5 ssid 4005 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹𝑤))
6 dmmptg 6242 . . . . . 6 (∀𝑤 ∈ ω (𝐹𝑤) ∈ V → dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ω)
7 fvexd 6907 . . . . . 6 (𝑤 ∈ ω → (𝐹𝑤) ∈ V)
86, 7mprg 3068 . . . . 5 dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ω
9 peano1 7879 . . . . . 6 ∅ ∈ ω
109ne0ii 4338 . . . . 5 ω ≠ ∅
118, 10eqnetri 3012 . . . 4 dom (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅
12 dm0rn0 5925 . . . . 5 (dom (𝑤 ∈ ω ↦ (𝐹𝑤)) = ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) = ∅)
1312necon3bii 2994 . . . 4 (dom (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅)
1411, 13mpbi 229 . . 3 ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅
15 fri 5637 . . 3 (((ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∈ V ∧ E Fr ran (𝑤 ∈ ω ↦ (𝐹𝑤))) ∧ (ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ∧ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ≠ ∅)) → ∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦)
163, 4, 5, 14, 15mp4an 692 . 2 𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦
17 fvex 6905 . . . . . . 7 (𝐹𝑤) ∈ V
18 eqid 2733 . . . . . . 7 (𝑤 ∈ ω ↦ (𝐹𝑤)) = (𝑤 ∈ ω ↦ (𝐹𝑤))
1917, 18fnmpti 6694 . . . . . 6 (𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω
20 fvelrnb 6953 . . . . . 6 ((𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦))
2119, 20ax-mp 5 . . . . 5 (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦)
22 peano2 7881 . . . . . . . . . 10 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
23 fveq2 6892 . . . . . . . . . . 11 (𝑤 = suc 𝑥 → (𝐹𝑤) = (𝐹‘suc 𝑥))
24 fvex 6905 . . . . . . . . . . 11 (𝐹‘suc 𝑥) ∈ V
2523, 18, 24fvmpt 6999 . . . . . . . . . 10 (suc 𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
2622, 25syl 17 . . . . . . . . 9 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
27 fnfvelrn 7083 . . . . . . . . . 10 (((𝑤 ∈ ω ↦ (𝐹𝑤)) Fn ω ∧ suc 𝑥 ∈ ω) → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
2819, 22, 27sylancr 588 . . . . . . . . 9 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
2926, 28eqeltrrd 2835 . . . . . . . 8 (𝑥 ∈ ω → (𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)))
30 epel 5584 . . . . . . . . . . . 12 (𝑧 E 𝑦𝑧𝑦)
31 eleq1 2822 . . . . . . . . . . . 12 (𝑧 = (𝐹‘suc 𝑥) → (𝑧𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
3230, 31bitrid 283 . . . . . . . . . . 11 (𝑧 = (𝐹‘suc 𝑥) → (𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
3332notbid 318 . . . . . . . . . 10 (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦))
34 df-nel 3048 . . . . . . . . . 10 ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦)
3533, 34bitr4di 289 . . . . . . . . 9 (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∉ 𝑦))
3635rspccv 3610 . . . . . . . 8 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ((𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → (𝐹‘suc 𝑥) ∉ 𝑦))
3729, 36syl5com 31 . . . . . . 7 (𝑥 ∈ ω → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝐹‘suc 𝑥) ∉ 𝑦))
38 fveq2 6892 . . . . . . . . . . 11 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
39 fvex 6905 . . . . . . . . . . 11 (𝐹𝑥) ∈ V
4038, 18, 39fvmpt 6999 . . . . . . . . . 10 (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = (𝐹𝑥))
41 eqeq1 2737 . . . . . . . . . 10 (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = (𝐹𝑥) ↔ 𝑦 = (𝐹𝑥)))
4240, 41syl5ibcom 244 . . . . . . . . 9 (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦𝑦 = (𝐹𝑥)))
43 neleq2 3054 . . . . . . . . . 10 (𝑦 = (𝐹𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4443biimpd 228 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4542, 44syl6 35 . . . . . . . 8 (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4645com23 86 . . . . . . 7 (𝑥 ∈ ω → ((𝐹‘suc 𝑥) ∉ 𝑦 → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4737, 46syldc 48 . . . . . 6 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹𝑥))))
4847reximdvai 3166 . . . . 5 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹𝑤))‘𝑥) = 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
4921, 48biimtrid 241 . . . 4 (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
5049com12 32 . . 3 (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)))
5150rexlimiv 3149 . 2 (∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥))
5216, 51ax-mp 5 1 𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205   = wceq 1542  wcel 2107  wne 2941  wnel 3047  wral 3062  wrex 3071  Vcvv 3475  wss 3949  c0 4323   class class class wbr 5149  cmpt 5232   E cep 5580   Fr wfr 5629  dom cdm 5677  ran crn 5678  suc csuc 6367   Fn wfn 6539  cfv 6544  ωcom 7855
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725  ax-reg 9587  ax-inf2 9636
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-om 7856
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator