| 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 9631 for a stronger version without the first assumption. (Contributed by NM, 3-Dec-2003.) |
| Ref | Expression |
|---|---|
| unbnn | ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssdomg 8999 | . . . 4 ⊢ (ω ∈ V → (𝐴 ⊆ ω → 𝐴 ≼ ω)) | |
| 2 | 1 | imp 412 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω) → 𝐴 ≼ ω) |
| 3 | 2 | 3adant3 1150 | . 2 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≼ ω) |
| 4 | simp1 1154 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → ω ∈ V) | |
| 5 | ssexg 5292 | . . . . 5 ⊢ ((𝐴 ⊆ ω ∧ ω ∈ V) → 𝐴 ∈ V) | |
| 6 | 5 | ancoms 464 | . . . 4 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω) → 𝐴 ∈ V) |
| 7 | 6 | 3adant3 1150 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ∈ V) |
| 8 | eqid 2765 | . . . . 5 ⊢ (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω) = (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω) | |
| 9 | 8 | unblem4 9258 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) |
| 10 | 9 | 3adant1 1148 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) |
| 11 | f1dom2g 8968 | . . 3 ⊢ ((ω ∈ V ∧ 𝐴 ∈ V ∧ (rec((𝑧 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑧)), ∩ 𝐴) ↾ ω):ω–1-1→𝐴) → ω ≼ 𝐴) | |
| 12 | 4, 7, 10, 11 | syl3anc 1398 | . 2 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → ω ≼ 𝐴) |
| 13 | sbth 9088 | . 2 ⊢ ((𝐴 ≼ ω ∧ ω ≼ 𝐴) → 𝐴 ≈ ω) | |
| 14 | 3, 12, 13 | syl2anc 596 | 1 ⊢ ((ω ∈ V ∧ 𝐴 ⊆ ω ∧ ∀𝑥 ∈ ω ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) → 𝐴 ≈ ω) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 Vcvv 3457 ∖ cdif 3903 ⊆ wss 3906 ∩ cint 4914 class class class wbr 5111 ↦ cmpt 5194 ↾ cres 5665 suc csuc 6366 –1-1→wf1 6537 ωcom 7864 reccrdg 8398 ≈ cen 8942 ≼ cdom 8943 |
| 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-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| 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-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-int 4915 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-pred 6306 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-ov 7419 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-en 8946 df-dom 8947 |
| This theorem is used by: unbnn2 9260 isfinite2 9261 unbnn3 9631 |
| Copyright terms: Public domain | W3C validator |