![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > unbnn | Structured version Visualization version GIF version |
Description: Any unbounded subset of natural numbers is equinumerous to the set of all natural numbers. Part of the proof of Theorem 42 of [Suppes] p. 151. See unbnn3 9553 for a stronger version without the first assumption. (Contributed by NM, 3-Dec-2003.) |
Ref | Expression |
---|---|
unbnn | ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≈ ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssdomg 8898 | . . . 4 ⊢ (ω ∈ V → (𝐴 ⊆ ω → 𝐴 ≼ ω)) | |
2 | 1 | imp 407 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω) → 𝐴 ≼ ω) |
3 | 2 | 3adant3 1132 | . 2 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≼ ω) |
4 | simp1 1136 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → ω ∈ V) | |
5 | ssexg 5278 | . . . . 5 ⊢ ((𝐴 ⊆ ω ∧ ω ∈ V) → 𝐴 ∈ V) | |
6 | 5 | ancoms 459 | . . . 4 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω) → 𝐴 ∈ V) |
7 | 6 | 3adant3 1132 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ∈ V) |
8 | eqid 2737 | . . . . 5 ⊢ (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω) = (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω) | |
9 | 8 | unblem4 9200 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) |
10 | 9 | 3adant1 1130 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) |
11 | f1dom2g 8867 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ∈ V ∧ (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) → ω ≼ 𝐴) | |
12 | 4, 7, 10, 11 | syl3anc 1371 | . 2 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → ω ≼ 𝐴) |
13 | sbth 8995 | . 2 ⊢ ((𝐴 ≼ ω ∧ ω ≼ 𝐴) → 𝐴 ≈ ω) | |
14 | 3, 12, 13 | syl2anc 584 | 1 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≈ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1087 ∈ wcel 2106 ∀wral 3062 ∃wrex 3071 Vcvv 3443 ∖ cdif 3905 ⊆ wss 3908 ∩ cint 4905 class class class wbr 5103 ↦ cmpt 5186 ↾ cres 5633 suc csuc 6317 –1-1→wf1 6490 ωcom 7794 reccrdg 8347 ≈ cen 8838 ≼ cdom 8839 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7354 df-om 7795 df-2nd 7914 df-frecs 8204 df-wrecs 8235 df-recs 8309 df-rdg 8348 df-en 8842 df-dom 8843 |
This theorem is referenced by: unbnn2 9202 isfinite2 9203 unbnn3 9553 |
Copyright terms: Public domain | W3C validator |