Theorem noinfep 9636

Description: Using the Axiom of Regularity in the form zfregfr 9580, 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 9619	. . . . 5 ⊢ ω ∈ V
2	1	mptex 7228	. . . 4 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
3	2	rnex 7913	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ∈ V
4		zfregfr 9580	. . 3 ⊢ E Fr ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
5		ssid 3960	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ⊆ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤))
6		dmmptg 6245	. . . . . 6 ⊢ (∀𝑤 ∈ ω (𝐹‘𝑤) ∈ V → dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω)
7		fvexd 6900	. . . . . 6 ⊢ (𝑤 ∈ ω → (𝐹‘𝑤) ∈ V)
8	6, 7	mprg 3087	. . . . 5 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ω
9		peano1 7891	. . . . . 6 ⊢ ∅ ∈ ω
10	9	ne0ii 4297	. . . . 5 ⊢ ω ≠ ∅
11	8, 10	eqnetri 3030	. . . 4 ⊢ dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅
12		dm0rn0 5916	. . . . 5 ⊢ (dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = ∅)
13	12	necon3bii 3012	. . . 4 ⊢ (dom (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅ ↔ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅)
14	11, 13	mpbi 233	. . 3 ⊢ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ≠ ∅
15		fri 5621	. . 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 6898	. . . . . . 7 ⊢ (𝐹‘𝑤) ∈ V
18		eqid 2765	. . . . . . 7 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) = (𝑤 ∈ ω ↦ (𝐹‘𝑤))
19	17, 18	fnmpti 6682	. . . . . 6 ⊢ (𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω
20		fvelrnb 6945	. . . . . 6 ⊢ ((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω → (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦))
21	19, 20	ax-mp 5	. . . . 5 ⊢ (𝑦 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ↔ ∃𝑥 ∈ ω ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦)
22		peano2 7892	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
23		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑤 = suc 𝑥 → (𝐹‘𝑤) = (𝐹‘suc 𝑥))
24		fvex 6898	. . . . . . . . . . 11 ⊢ (𝐹‘suc 𝑥) ∈ V
25	23, 18, 24	fvmpt 6993	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
26	22, 25	syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) = (𝐹‘suc 𝑥))
27		fnfvelrn 7079	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤)) Fn ω ∧ suc 𝑥 ∈ ω) → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
28	19, 22, 27	sylancr 599	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
29	26, 28	eqeltrrd 2866	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)))
30		epel 5566	. . . . . . . . . . . 12 ⊢ (𝑧 E 𝑦 ↔ 𝑧 ∈ 𝑦)
31		eleq1 2853	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 ∈ 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
32	30, 31	bitrid 286	. . . . . . . . . . 11 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∈ 𝑦))
33	32	notbid 321	. . . . . . . . . 10 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦))
34		df-nel 3067	. . . . . . . . . 10 ⊢ ((𝐹‘suc 𝑥) ∉ 𝑦 ↔ ¬ (𝐹‘suc 𝑥) ∈ 𝑦)
35	33, 34	bitr4di 292	. . . . . . . . 9 ⊢ (𝑧 = (𝐹‘suc 𝑥) → (¬ 𝑧 E 𝑦 ↔ (𝐹‘suc 𝑥) ∉ 𝑦))
36	35	rspccv 3580	. . . . . . . 8 ⊢ (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → ((𝐹‘suc 𝑥) ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) → (𝐹‘suc 𝑥) ∉ 𝑦))
37	29, 36	syl5com 32	. . . . . . 7 ⊢ (𝑥 ∈ ω → (∀𝑧 ∈ ran (𝑤 ∈ ω ↦ (𝐹‘𝑤)) ¬ 𝑧 E 𝑦 → (𝐹‘suc 𝑥) ∉ 𝑦))
38		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
39		fvex 6898	. . . . . . . . . . 11 ⊢ (𝐹‘𝑥) ∈ V
40	38, 18, 39	fvmpt 6993	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → ((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥))
41		eqeq1 2769	. . . . . . . . . 10 ⊢ (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = (𝐹‘𝑥) ↔ 𝑦 = (𝐹‘𝑥)))
42	40, 41	syl5ibcom 248	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → (((𝑤 ∈ ω ↦ (𝐹‘𝑤))‘𝑥) = 𝑦 → 𝑦 = (𝐹‘𝑥)))
43		neleq2 3073	. . . . . . . . . 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 3178	. . . . 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 3161	. 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 2146   ≠ wne 2960   ∉ wnel 3066  ∀wral 3081  ∃wrex 3091  Vcvv 3457   ⊆ wss 3906  ∅c0 4286   class class class wbr 5111   ↦ cmpt 5194   E cep 5562   Fr wfr 5613  dom cdm 5663  ran crn 5664  suc csuc 6366   Fn wfn 6535  ‘cfv 6540  ωcom 7868

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742  ax-reg 9561  ax-inf2 9617

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-om 7869

This theorem is used by: (None)