Theorem noinfep 9642

Description: Using the Axiom of Regularity in the form zfregfr 9586, 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 9625	. . . . 5 ⊢ ω ∈ V
2	1	mptex 7223	. . . 4 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
3	2	rnex 7908	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
4		zfregfr 9586	. . 3 ⊢ E Fr ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
5		ssid 3953	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
6		dmmptg 6238	. . . . . 6 ⊢ (∀𝑤 ∈ ω (𝐹‘𝑤) ∈ V → dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω)
7		fvexd 6894	. . . . . 6 ⊢ (𝑤 ∈ ω → (𝐹‘𝑤) ∈ V)
8	6, 7	mprg 3082	. . . . 5 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω
9		peano1 7886	. . . . . 6 ⊢ ∅ ∈ ω
10	9	ne0ii 4290	. . . . 5 ⊢ ω ≠ ∅
11	8, 10	eqnetri 3025	. . . 4 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅
12		dm0rn0 5908	. . . . 5 ⊢ (dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅)
13	12	necon3bii 3007	. . . 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 6892	. . . . . . 7 ⊢ (𝐹‘𝑤) ∈ V
18		eqid 2760	. . . . . . 7 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = (𝑤 ∈ ω ↦ (𝐹‘𝑤))
19	17, 18	fnmpti 6676	. . . . . 6 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω
20		fvelrnb 6939	. . . . . 6 ⊢ ((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦))
21	19, 20	ax-mp 5	. . . . 5 ⊢ (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦)
22		peano2 7887	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
23		fveq2 6879	. . . . . . . . . . 11 ⊢ (𝑤 = suc 𝑥 → (𝐹‘𝑤) = (𝐹‘suc 𝑥))
24		fvex 6892	. . . . . . . . . . 11 ⊢ (𝐹‘suc 𝑥) ∈ V
25	23, 18, 24	fvmpt 6987	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
26	22, 25	syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
27		fnfvelrn 7074	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω ∧ suc 𝑥 ∈ ω) → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
28	19, 22, 27	sylancr 599	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
29	26, 28	eqeltrrd 2861	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
30		epel 5558	. . . . . . . . . . . 12 ⊢ (𝑧 E 𝑦 ↔ 𝑧 ∈ 𝑦)
31		eleq1 2848	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 ∈ 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
32	30, 31	bitrid 286	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
33	32	notbid 321	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦))
34		df-nel 3062	. . . . . . . . . 10 ⊢ ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦)
35	33, 34	bitr4di 292	. . . . . . . . 9 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∉ 𝑦))
36	35	rspccv 3573	. . . . . . . 8 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → ((𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) → (𝐹‘suc 𝑥) ∉ 𝑦))
37	29, 36	syl5com 32	. . . . . . 7 ⊢ (𝑥 ∈ ω → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (𝐹‘suc 𝑥) ∉ 𝑦))
38		fveq2 6879	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
39		fvex 6892	. . . . . . . . . . 11 ⊢ (𝐹‘𝑥) ∈ V
40	38, 18, 39	fvmpt 6987	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥))
41		eqeq1 2764	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥) ↔ 𝑦 = (𝐹‘𝑥)))
42	40, 41	syl5ibcom 248	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → 𝑦 = (𝐹‘𝑥)))
43		neleq2 3068	. . . . . . . . . 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 3173	. . . . 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 3156	. 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 1570   ∈ wcel 2145   ≠ wne 2955   ∉ wnel 3061  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103   ↦ cmpt 5186   E cep 5554   Fr wfr 5605  dom cdm 5655  ran crn 5656  suc csuc 6359   Fn wfn 6528  ‘cfv 6533  ωcom 7863

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737  ax-reg 9567  ax-inf2 9623

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-om 7864

This theorem is used by: (None)