fin1a2lem6 - Metamath Proof Explorer

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

Theorem fin1a2lem6 10400

Description: Lemma for fin1a2 10410. Establish that ω can be broken into two equipollent pieces. (Contributed by Stefan O'Rear, 7-Nov-2014.)

**Hypotheses**
Ref	Expression
fin1a2lem.b	⊢ 𝐸 = (𝑥 ∈ ω ↦ (2_o ·_o 𝑥))
fin1a2lem.aa	⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥)

**Assertion**
Ref	Expression
fin1a2lem6	⊢ (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(ω ∖ ran 𝐸)

Proof of Theorem fin1a2lem6 Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fin1a2lem.aa	. . . 4 ⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥)
2	1	fin1a2lem2 10396	. . 3 ⊢ 𝑆:On–1-1→On
3		fin1a2lem.b	. . . . 5 ⊢ 𝐸 = (𝑥 ∈ ω ↦ (2_o ·_o 𝑥))
4	3	fin1a2lem4 10398	. . . 4 ⊢ 𝐸:ω–1-1→ω
5		f1f 6788	. . . 4 ⊢ (𝐸:ω–1-1→ω → 𝐸:ω⟶ω)
6		frn 6725	. . . . 5 ⊢ (𝐸:ω⟶ω → ran 𝐸 ⊆ ω)
7		omsson 7859	. . . . 5 ⊢ ω ⊆ On
8	6, 7	sstrdi 3995	. . . 4 ⊢ (𝐸:ω⟶ω → ran 𝐸 ⊆ On)
9	4, 5, 8	mp2b 10	. . 3 ⊢ ran 𝐸 ⊆ On
10		f1ores 6848	. . 3 ⊢ ((𝑆:On–1-1→On ∧ ran 𝐸 ⊆ On) → (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(𝑆 “ ran 𝐸))
11	2, 9, 10	mp2an 691	. 2 ⊢ (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(𝑆 “ ran 𝐸)
12	9	sseli 3979	. . . . . . . . 9 ⊢ (𝑏 ∈ ran 𝐸 → 𝑏 ∈ On)
13	1	fin1a2lem1 10395	. . . . . . . . 9 ⊢ (𝑏 ∈ On → (𝑆‘𝑏) = suc 𝑏)
14	12, 13	syl 17	. . . . . . . 8 ⊢ (𝑏 ∈ ran 𝐸 → (𝑆‘𝑏) = suc 𝑏)
15	14	eqeq1d 2735	. . . . . . 7 ⊢ (𝑏 ∈ ran 𝐸 → ((𝑆‘𝑏) = 𝑎 ↔ suc 𝑏 = 𝑎))
16	15	rexbiia 3093	. . . . . 6 ⊢ (∃𝑏 ∈ ran 𝐸(𝑆‘𝑏) = 𝑎 ↔ ∃𝑏 ∈ ran 𝐸 suc 𝑏 = 𝑎)
17	4, 5, 6	mp2b 10	. . . . . . . . . . . 12 ⊢ ran 𝐸 ⊆ ω
18	17	sseli 3979	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ran 𝐸 → 𝑏 ∈ ω)
19		peano2 7881	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → suc 𝑏 ∈ ω)
20	18, 19	syl 17	. . . . . . . . . 10 ⊢ (𝑏 ∈ ran 𝐸 → suc 𝑏 ∈ ω)
21	3	fin1a2lem5 10399	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ω → (𝑏 ∈ ran 𝐸 ↔ ¬ suc 𝑏 ∈ ran 𝐸))
22	21	biimpd 228	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → (𝑏 ∈ ran 𝐸 → ¬ suc 𝑏 ∈ ran 𝐸))
23	18, 22	mpcom 38	. . . . . . . . . 10 ⊢ (𝑏 ∈ ran 𝐸 → ¬ suc 𝑏 ∈ ran 𝐸)
24	20, 23	jca 513	. . . . . . . . 9 ⊢ (𝑏 ∈ ran 𝐸 → (suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸))
25		eleq1 2822	. . . . . . . . . 10 ⊢ (suc 𝑏 = 𝑎 → (suc 𝑏 ∈ ω ↔ 𝑎 ∈ ω))
26		eleq1 2822	. . . . . . . . . . 11 ⊢ (suc 𝑏 = 𝑎 → (suc 𝑏 ∈ ran 𝐸 ↔ 𝑎 ∈ ran 𝐸))
27	26	notbid 318	. . . . . . . . . 10 ⊢ (suc 𝑏 = 𝑎 → (¬ suc 𝑏 ∈ ran 𝐸 ↔ ¬ 𝑎 ∈ ran 𝐸))
28	25, 27	anbi12d 632	. . . . . . . . 9 ⊢ (suc 𝑏 = 𝑎 → ((suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸) ↔ (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸)))
29	24, 28	syl5ibcom 244	. . . . . . . 8 ⊢ (𝑏 ∈ ran 𝐸 → (suc 𝑏 = 𝑎 → (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸)))
30	29	rexlimiv 3149	. . . . . . 7 ⊢ (∃𝑏 ∈ ran 𝐸 suc 𝑏 = 𝑎 → (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸))
31		peano1 7879	. . . . . . . . . . . . . 14 ⊢ ∅ ∈ ω
32	3	fin1a2lem3 10397	. . . . . . . . . . . . . 14 ⊢ (∅ ∈ ω → (𝐸‘∅) = (2_o ·_o ∅))
33	31, 32	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (𝐸‘∅) = (2_o ·_o ∅)
34		2on 8480	. . . . . . . . . . . . . 14 ⊢ 2_o ∈ On
35		om0 8517	. . . . . . . . . . . . . 14 ⊢ (2_o ∈ On → (2_o ·_o ∅) = ∅)
36	34, 35	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (2_o ·_o ∅) = ∅
37	33, 36	eqtri 2761	. . . . . . . . . . . 12 ⊢ (𝐸‘∅) = ∅
38		f1fun 6790	. . . . . . . . . . . . . 14 ⊢ (𝐸:ω–1-1→ω → Fun 𝐸)
39	4, 38	ax-mp 5	. . . . . . . . . . . . 13 ⊢ Fun 𝐸
40		f1dm 6792	. . . . . . . . . . . . . . 15 ⊢ (𝐸:ω–1-1→ω → dom 𝐸 = ω)
41	4, 40	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ dom 𝐸 = ω
42	31, 41	eleqtrri 2833	. . . . . . . . . . . . 13 ⊢ ∅ ∈ dom 𝐸
43		fvelrn 7079	. . . . . . . . . . . . 13 ⊢ ((Fun 𝐸 ∧ ∅ ∈ dom 𝐸) → (𝐸‘∅) ∈ ran 𝐸)
44	39, 42, 43	mp2an 691	. . . . . . . . . . . 12 ⊢ (𝐸‘∅) ∈ ran 𝐸
45	37, 44	eqeltrri 2831	. . . . . . . . . . 11 ⊢ ∅ ∈ ran 𝐸
46		eleq1 2822	. . . . . . . . . . 11 ⊢ (𝑎 = ∅ → (𝑎 ∈ ran 𝐸 ↔ ∅ ∈ ran 𝐸))
47	45, 46	mpbiri 258	. . . . . . . . . 10 ⊢ (𝑎 = ∅ → 𝑎 ∈ ran 𝐸)
48	47	necon3bi 2968	. . . . . . . . 9 ⊢ (¬ 𝑎 ∈ ran 𝐸 → 𝑎 ≠ ∅)
49		nnsuc 7873	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑎 ≠ ∅) → ∃𝑏 ∈ ω 𝑎 = suc 𝑏)
50	48, 49	sylan2 594	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) → ∃𝑏 ∈ ω 𝑎 = suc 𝑏)
51		eleq1 2822	. . . . . . . . . . . . 13 ⊢ (𝑎 = suc 𝑏 → (𝑎 ∈ ω ↔ suc 𝑏 ∈ ω))
52		eleq1 2822	. . . . . . . . . . . . . 14 ⊢ (𝑎 = suc 𝑏 → (𝑎 ∈ ran 𝐸 ↔ suc 𝑏 ∈ ran 𝐸))
53	52	notbid 318	. . . . . . . . . . . . 13 ⊢ (𝑎 = suc 𝑏 → (¬ 𝑎 ∈ ran 𝐸 ↔ ¬ suc 𝑏 ∈ ran 𝐸))
54	51, 53	anbi12d 632	. . . . . . . . . . . 12 ⊢ (𝑎 = suc 𝑏 → ((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ↔ (suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸)))
55	54	anbi1d 631	. . . . . . . . . . 11 ⊢ (𝑎 = suc 𝑏 → (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) ↔ ((suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸) ∧ 𝑏 ∈ ω)))
56		simplr 768	. . . . . . . . . . . 12 ⊢ (((suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) → ¬ suc 𝑏 ∈ ran 𝐸)
57	21	adantl 483	. . . . . . . . . . . 12 ⊢ (((suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) → (𝑏 ∈ ran 𝐸 ↔ ¬ suc 𝑏 ∈ ran 𝐸))
58	56, 57	mpbird 257	. . . . . . . . . . 11 ⊢ (((suc 𝑏 ∈ ω ∧ ¬ suc 𝑏 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) → 𝑏 ∈ ran 𝐸)
59	55, 58	syl6bi 253	. . . . . . . . . 10 ⊢ (𝑎 = suc 𝑏 → (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) → 𝑏 ∈ ran 𝐸))
60	59	com12 32	. . . . . . . . 9 ⊢ (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ 𝑏 ∈ ω) → (𝑎 = suc 𝑏 → 𝑏 ∈ ran 𝐸))
61	60	impr 456	. . . . . . . 8 ⊢ (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ (𝑏 ∈ ω ∧ 𝑎 = suc 𝑏)) → 𝑏 ∈ ran 𝐸)
62		simprr 772	. . . . . . . . 9 ⊢ (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ (𝑏 ∈ ω ∧ 𝑎 = suc 𝑏)) → 𝑎 = suc 𝑏)
63	62	eqcomd 2739	. . . . . . . 8 ⊢ (((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) ∧ (𝑏 ∈ ω ∧ 𝑎 = suc 𝑏)) → suc 𝑏 = 𝑎)
64	50, 61, 63	reximssdv 3173	. . . . . . 7 ⊢ ((𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸) → ∃𝑏 ∈ ran 𝐸 suc 𝑏 = 𝑎)
65	30, 64	impbii 208	. . . . . 6 ⊢ (∃𝑏 ∈ ran 𝐸 suc 𝑏 = 𝑎 ↔ (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸))
66	16, 65	bitri 275	. . . . 5 ⊢ (∃𝑏 ∈ ran 𝐸(𝑆‘𝑏) = 𝑎 ↔ (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸))
67		f1fn 6789	. . . . . . 7 ⊢ (𝑆:On–1-1→On → 𝑆 Fn On)
68	2, 67	ax-mp 5	. . . . . 6 ⊢ 𝑆 Fn On
69		fvelimab 6965	. . . . . 6 ⊢ ((𝑆 Fn On ∧ ran 𝐸 ⊆ On) → (𝑎 ∈ (𝑆 “ ran 𝐸) ↔ ∃𝑏 ∈ ran 𝐸(𝑆‘𝑏) = 𝑎))
70	68, 9, 69	mp2an 691	. . . . 5 ⊢ (𝑎 ∈ (𝑆 “ ran 𝐸) ↔ ∃𝑏 ∈ ran 𝐸(𝑆‘𝑏) = 𝑎)
71		eldif 3959	. . . . 5 ⊢ (𝑎 ∈ (ω ∖ ran 𝐸) ↔ (𝑎 ∈ ω ∧ ¬ 𝑎 ∈ ran 𝐸))
72	66, 70, 71	3bitr4i 303	. . . 4 ⊢ (𝑎 ∈ (𝑆 “ ran 𝐸) ↔ 𝑎 ∈ (ω ∖ ran 𝐸))
73	72	eqriv 2730	. . 3 ⊢ (𝑆 “ ran 𝐸) = (ω ∖ ran 𝐸)
74		f1oeq3 6824	. . 3 ⊢ ((𝑆 “ ran 𝐸) = (ω ∖ ran 𝐸) → ((𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(𝑆 “ ran 𝐸) ↔ (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(ω ∖ ran 𝐸)))
75	73, 74	ax-mp 5	. 2 ⊢ ((𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(𝑆 “ ran 𝐸) ↔ (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(ω ∖ ran 𝐸))
76	11, 75	mpbi 229	1 ⊢ (𝑆 ↾ ran 𝐸):ran 𝐸–1-1-onto→(ω ∖ ran 𝐸)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∃wrex 3071 ∖ cdif 3946 ⊆ wss 3949 ∅c0 4323 ↦ cmpt 5232 dom cdm 5677 ran crn 5678 ↾ cres 5679 “ cima 5680 Oncon0 6365 suc csuc 6367 Fun wfun 6538 Fn wfn 6539 ⟶wf 6540 –1-1→wf1 6541 –1-1-onto→wf1o 6543 ‘cfv 6544 (class class class)co 7409 ωcom 7855 2_oc2o 8460 ·_o comu 8464

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

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-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-pred 6301 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-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-oadd 8470 df-omul 8471

This theorem is referenced by: fin1a2lem7 10401

W3C validator