onnseq - Metamath Proof Explorer

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

Theorem onnseq 8344

Description: There are no length ω decreasing sequences in the ordinals. See also noinfep 9655 for a stronger version assuming Regularity. (Contributed by Mario Carneiro, 19-May-2015.)

**Assertion**
Ref	Expression
onnseq	⊢ ((𝐹‘∅) ∈ On → ∃𝑥 ∈ ω ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))

Distinct variable group: 𝑥,𝐹

Proof of Theorem onnseq Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		epweon 7762	. . . . 5 ⊢ E We On
2		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑦 = ∅ → (𝐹‘𝑦) = (𝐹‘∅))
3	2	eleq1d 2819	. . . . . . . . . 10 ⊢ (𝑦 = ∅ → ((𝐹‘𝑦) ∈ On ↔ (𝐹‘∅) ∈ On))
4		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
5	4	eleq1d 2819	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝐹‘𝑦) ∈ On ↔ (𝐹‘𝑧) ∈ On))
6		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑦 = suc 𝑧 → (𝐹‘𝑦) = (𝐹‘suc 𝑧))
7	6	eleq1d 2819	. . . . . . . . . 10 ⊢ (𝑦 = suc 𝑧 → ((𝐹‘𝑦) ∈ On ↔ (𝐹‘suc 𝑧) ∈ On))
8		simpl 484	. . . . . . . . . 10 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → (𝐹‘∅) ∈ On)
9		suceq 6431	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → suc 𝑥 = suc 𝑧)
10	9	fveq2d 6896	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝐹‘suc 𝑥) = (𝐹‘suc 𝑧))
11		fveq2 6892	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
12	10, 11	eleq12d 2828	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → ((𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) ↔ (𝐹‘suc 𝑧) ∈ (𝐹‘𝑧)))
13	12	rspcv 3609	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ω → (∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) → (𝐹‘suc 𝑧) ∈ (𝐹‘𝑧)))
14		onelon 6390	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑧) ∈ On ∧ (𝐹‘suc 𝑧) ∈ (𝐹‘𝑧)) → (𝐹‘suc 𝑧) ∈ On)
15	14	expcom 415	. . . . . . . . . . . 12 ⊢ ((𝐹‘suc 𝑧) ∈ (𝐹‘𝑧) → ((𝐹‘𝑧) ∈ On → (𝐹‘suc 𝑧) ∈ On))
16	13, 15	syl6 35	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ω → (∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) → ((𝐹‘𝑧) ∈ On → (𝐹‘suc 𝑧) ∈ On)))
17	16	adantld 492	. . . . . . . . . 10 ⊢ (𝑧 ∈ ω → (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ((𝐹‘𝑧) ∈ On → (𝐹‘suc 𝑧) ∈ On)))
18	3, 5, 7, 8, 17	finds2 7891	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → (𝐹‘𝑦) ∈ On))
19	18	com12 32	. . . . . . . 8 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → (𝑦 ∈ ω → (𝐹‘𝑦) ∈ On))
20	19	ralrimiv 3146	. . . . . . 7 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ∀𝑦 ∈ ω (𝐹‘𝑦) ∈ On)
21		eqid 2733	. . . . . . . 8 ⊢ (𝑦 ∈ ω ↦ (𝐹‘𝑦)) = (𝑦 ∈ ω ↦ (𝐹‘𝑦))
22	21	fmpt 7110	. . . . . . 7 ⊢ (∀𝑦 ∈ ω (𝐹‘𝑦) ∈ On ↔ (𝑦 ∈ ω ↦ (𝐹‘𝑦)):ω⟶On)
23	20, 22	sylib 217	. . . . . 6 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → (𝑦 ∈ ω ↦ (𝐹‘𝑦)):ω⟶On)
24	23	frnd 6726	. . . . 5 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ⊆ On)
25		peano1 7879	. . . . . . . 8 ⊢ ∅ ∈ ω
26	23	fdmd 6729	. . . . . . . 8 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → dom (𝑦 ∈ ω ↦ (𝐹‘𝑦)) = ω)
27	25, 26	eleqtrrid 2841	. . . . . . 7 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ∅ ∈ dom (𝑦 ∈ ω ↦ (𝐹‘𝑦)))
28	27	ne0d 4336	. . . . . 6 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → dom (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ≠ ∅)
29		dm0rn0 5925	. . . . . . 7 ⊢ (dom (𝑦 ∈ ω ↦ (𝐹‘𝑦)) = ∅ ↔ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) = ∅)
30	29	necon3bii 2994	. . . . . 6 ⊢ (dom (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ≠ ∅ ↔ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ≠ ∅)
31	28, 30	sylib 217	. . . . 5 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ≠ ∅)
32		wefrc 5671	. . . . 5 ⊢ (( E We On ∧ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ⊆ On ∧ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ≠ ∅) → ∃𝑧 ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦))(ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = ∅)
33	1, 24, 31, 32	mp3an2i 1467	. . . 4 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ∃𝑧 ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦))(ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = ∅)
34		fvex 6905	. . . . . 6 ⊢ (𝐹‘𝑤) ∈ V
35	34	rgenw 3066	. . . . 5 ⊢ ∀𝑤 ∈ ω (𝐹‘𝑤) ∈ V
36		fveq2 6892	. . . . . . 7 ⊢ (𝑦 = 𝑤 → (𝐹‘𝑦) = (𝐹‘𝑤))
37	36	cbvmptv 5262	. . . . . 6 ⊢ (𝑦 ∈ ω ↦ (𝐹‘𝑦)) = (𝑤 ∈ ω ↦ (𝐹‘𝑤))
38		ineq2 4207	. . . . . . 7 ⊢ (𝑧 = (𝐹‘𝑤) → (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)))
39	38	eqeq1d 2735	. . . . . 6 ⊢ (𝑧 = (𝐹‘𝑤) → ((ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = ∅ ↔ (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅))
40	37, 39	rexrnmptw 7097	. . . . 5 ⊢ (∀𝑤 ∈ ω (𝐹‘𝑤) ∈ V → (∃𝑧 ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦))(ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = ∅ ↔ ∃𝑤 ∈ ω (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅))
41	35, 40	ax-mp 5	. . . 4 ⊢ (∃𝑧 ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦))(ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ 𝑧) = ∅ ↔ ∃𝑤 ∈ ω (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅)
42	33, 41	sylib 217	. . 3 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ∃𝑤 ∈ ω (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅)
43		peano2 7881	. . . . . . . . 9 ⊢ (𝑤 ∈ ω → suc 𝑤 ∈ ω)
44	43	adantl 483	. . . . . . . 8 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → suc 𝑤 ∈ ω)
45		eqid 2733	. . . . . . . 8 ⊢ (𝐹‘suc 𝑤) = (𝐹‘suc 𝑤)
46		fveq2 6892	. . . . . . . . 9 ⊢ (𝑦 = suc 𝑤 → (𝐹‘𝑦) = (𝐹‘suc 𝑤))
47	46	rspceeqv 3634	. . . . . . . 8 ⊢ ((suc 𝑤 ∈ ω ∧ (𝐹‘suc 𝑤) = (𝐹‘suc 𝑤)) → ∃𝑦 ∈ ω (𝐹‘suc 𝑤) = (𝐹‘𝑦))
48	44, 45, 47	sylancl 587	. . . . . . 7 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → ∃𝑦 ∈ ω (𝐹‘suc 𝑤) = (𝐹‘𝑦))
49		fvex 6905	. . . . . . . 8 ⊢ (𝐹‘suc 𝑤) ∈ V
50	21	elrnmpt 5956	. . . . . . . 8 ⊢ ((𝐹‘suc 𝑤) ∈ V → ((𝐹‘suc 𝑤) ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ↔ ∃𝑦 ∈ ω (𝐹‘suc 𝑤) = (𝐹‘𝑦)))
51	49, 50	ax-mp 5	. . . . . . 7 ⊢ ((𝐹‘suc 𝑤) ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ↔ ∃𝑦 ∈ ω (𝐹‘suc 𝑤) = (𝐹‘𝑦))
52	48, 51	sylibr 233	. . . . . 6 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → (𝐹‘suc 𝑤) ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)))
53		suceq 6431	. . . . . . . . . 10 ⊢ (𝑥 = 𝑤 → suc 𝑥 = suc 𝑤)
54	53	fveq2d 6896	. . . . . . . . 9 ⊢ (𝑥 = 𝑤 → (𝐹‘suc 𝑥) = (𝐹‘suc 𝑤))
55		fveq2 6892	. . . . . . . . 9 ⊢ (𝑥 = 𝑤 → (𝐹‘𝑥) = (𝐹‘𝑤))
56	54, 55	eleq12d 2828	. . . . . . . 8 ⊢ (𝑥 = 𝑤 → ((𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) ↔ (𝐹‘suc 𝑤) ∈ (𝐹‘𝑤)))
57	56	rspccva 3612	. . . . . . 7 ⊢ ((∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ ω) → (𝐹‘suc 𝑤) ∈ (𝐹‘𝑤))
58	57	adantll 713	. . . . . 6 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → (𝐹‘suc 𝑤) ∈ (𝐹‘𝑤))
59		inelcm 4465	. . . . . 6 ⊢ (((𝐹‘suc 𝑤) ∈ ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∧ (𝐹‘suc 𝑤) ∈ (𝐹‘𝑤)) → (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) ≠ ∅)
60	52, 58, 59	syl2anc 585	. . . . 5 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) ≠ ∅)
61	60	neneqd 2946	. . . 4 ⊢ ((((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) ∧ 𝑤 ∈ ω) → ¬ (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅)
62	61	nrexdv 3150	. . 3 ⊢ (((𝐹‘∅) ∈ On ∧ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥)) → ¬ ∃𝑤 ∈ ω (ran (𝑦 ∈ ω ↦ (𝐹‘𝑦)) ∩ (𝐹‘𝑤)) = ∅)
63	42, 62	pm2.65da 816	. 2 ⊢ ((𝐹‘∅) ∈ On → ¬ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
64		rexnal 3101	. 2 ⊢ (∃𝑥 ∈ ω ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥) ↔ ¬ ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))
65	63, 64	sylibr 233	1 ⊢ ((𝐹‘∅) ∈ On → ∃𝑥 ∈ ω ¬ (𝐹‘suc 𝑥) ∈ (𝐹‘𝑥))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∩ cin 3948 ⊆ wss 3949 ∅c0 4323 ↦ cmpt 5232 E cep 5580 We wwe 5631 dom cdm 5677 ran crn 5678 Oncon0 6365 suc csuc 6367 ⟶wf 6540 ‘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-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725

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-ral 3063 df-rex 3072 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-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-fv 6552 df-om 7856

This theorem is referenced by: (None)

W3C validator