Theorem noinfep 9674

Description: Using the Axiom of Regularity in the form zfregfr 9618, 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.

Step	Hyp	Ref	Expression
1		omex 9657	. . . . 5 ⊢ ω ∈ V
2	1	mptex 7239	. . . 4 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
3	2	rnex 7932	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
4		zfregfr 9618	. . 3 ⊢ E Fr ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
5		ssid 3935	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
6		dmmptg 6250	. . . . . 6 ⊢ (∀𝑤 ∈ ω (𝐹‘𝑤) ∈ V → dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω)
7		fvexd 6911	. . . . . 6 ⊢ (𝑤 ∈ ω → (𝐹‘𝑤) ∈ V)
8	6, 7	mprg 3086	. . . . 5 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω
9		peano1 7910	. . . . . 6 ⊢ ∅ ∈ ω
10	9	ne0ii 4293	. . . . 5 ⊢ ω ≠ ∅
11	8, 10	eqnetri 3029	. . . 4 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅
12		dm0rn0 5911	. . . . 5 ⊢ (dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅)
13	12	necon3bii 3011	. . . 4 ⊢ (dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅)
14	11, 13	mpbi 233	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅
15		fri 5613	. . 3 ⊢ (((ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V ∧ E Fr ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))) ∧ (ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∧ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅)) → ∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦)
16	3, 4, 5, 14, 15	mp4an 706	. 2 ⊢ ∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦
17		fvex 6909	. . . . . . 7 ⊢ (𝐹‘𝑤) ∈ V
18		eqid 2763	. . . . . . 7 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = (𝑤 ∈ ω ↦ (𝐹‘𝑤))
19	17, 18	fnmpti 6693	. . . . . 6 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω
20		fvelrnb 6956	. . . . . 6 ⊢ ((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦))
21	19, 20	ax-mp 5	. . . . 5 ⊢ (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦)
22		peano2 7911	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
23		fveq2 6896	. . . . . . . . . . 11 ⊢ (𝑤 = suc 𝑥 → (𝐹‘𝑤) = (𝐹‘suc 𝑥))
24		fvex 6909	. . . . . . . . . . 11 ⊢ (𝐹‘suc 𝑥) ∈ V
25	23, 18, 24	fvmpt 7004	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
26	22, 25	syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
27		fnfvelrn 7091	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω ∧ suc 𝑥 ∈ ω) → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
28	19, 22, 27	sylancr 599	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
29	26, 28	eqeltrrd 2865	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
30		epel 5558	. . . . . . . . . . . 12 ⊢ (𝑧 E 𝑦 ↔ 𝑧 ∈ 𝑦)
31		eleq1 2852	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 ∈ 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
32	30, 31	bitrid 286	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
33	32	notbid 321	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦))
34		df-nel 3066	. . . . . . . . . 10 ⊢ ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦)
35	33, 34	bitr4di 292	. . . . . . . . 9 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∉ 𝑦))
36	35	rspccv 3577	. . . . . . . 8 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → ((𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) → (𝐹‘suc 𝑥) ∉ 𝑦))
37	29, 36	syl5com 32	. . . . . . 7 ⊢ (𝑥 ∈ ω → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (𝐹‘suc 𝑥) ∉ 𝑦))
38		fveq2 6896	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
39		fvex 6909	. . . . . . . . . . 11 ⊢ (𝐹‘𝑥) ∈ V
40	38, 18, 39	fvmpt 7004	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥))
41		eqeq1 2767	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥) ↔ 𝑦 = (𝐹‘𝑥)))
42	40, 41	syl5ibcom 248	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → 𝑦 = (𝐹‘𝑥)))
43		neleq2 3072	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
44	43	biimpd 232	. . . . . . . . 9 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
45	42, 44	syl6 36	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → ((𝐹‘suc 𝑥) ∉ 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))))
46	45	com23 87	. . . . . . 7 ⊢ (𝑥 ∈ ω → ((𝐹‘suc 𝑥) ∉ 𝑦 → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))))
47	37, 46	syldc 49	. . . . . 6 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))))
48	47	reximdvai 3177	. . . . 5 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
49	21, 48	biimtrid 245	. . . 4 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
50	49	com12 33	. . 3 ⊢ (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)))
51	50	rexlimiv 3160	. 2 ⊢ (∃𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥))
52	16, 51	ax-mp 5	1 ⊢ ∃𝑥 ∈ ω (𝐹‘suc 𝑥) ∉ (𝐹‘𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2146   ≠ wne 2959   ∉ wnel 3065  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   class class class wbr 5106   ↦ cmpt 5189   E cep 5554   Fr wfr 5605  dom cdm 5655  ran crn 5656  suc csuc 6371   Fn wfn 6542  ‘cfv 6547  ωcom 7887

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761  ax-reg 9599  ax-inf2 9655

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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-om 7888

This theorem is used by: (None)