| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unblem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for unbnn 9252. The function 𝐹 maps the set of natural numbers one-to-one to the set of unbounded natural numbers 𝐴. (Contributed by NM, 3-Dec-2003.) |
| Ref | Expression |
|---|---|
| unblem.2 | ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑥)), ∩ 𝐴) ↾ ω) |
| Ref | Expression |
|---|---|
| unblem4 | ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → 𝐹:ω–1-1→𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omsson 7862 | . . . 4 ⊢ ω ⊆ On | |
| 2 | sstr 3945 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ω ⊆ On) → 𝐴 ⊆ On) | |
| 3 | 1, 2 | mpan2 703 | . . 3 ⊢ (𝐴 ⊆ ω → 𝐴 ⊆ On) |
| 4 | 3 | adantr 485 | . 2 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → 𝐴 ⊆ On) |
| 5 | frfnom 8418 | . . . 4 ⊢ (rec((𝑥 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑥)), ∩ 𝐴) ↾ ω) Fn ω | |
| 6 | unblem.2 | . . . . 5 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑥)), ∩ 𝐴) ↾ ω) | |
| 7 | 6 | fneq1i 6632 | . . . 4 ⊢ (𝐹 Fn ω ↔ (rec((𝑥 ∈ V ↦ ∩ (𝐴 ∖ suc 𝑥)), ∩ 𝐴) ↾ ω) Fn ω) |
| 8 | 5, 7 | mpbir 234 | . . 3 ⊢ 𝐹 Fn ω |
| 9 | 6 | unblem2 9249 | . . . 4 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → (𝑧 ∈ ω → (𝐹‘𝑧) ∈ 𝐴)) |
| 10 | 9 | ralrimiv 3156 | . . 3 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → ∀𝑧 ∈ ω (𝐹‘𝑧) ∈ 𝐴) |
| 11 | ffnfv 7114 | . . . 4 ⊢ (𝐹:ω⟶𝐴 ↔ (𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹‘𝑧) ∈ 𝐴)) | |
| 12 | 11 | biimpri 231 | . . 3 ⊢ ((𝐹 Fn ω ∧ ∀𝑧 ∈ ω (𝐹‘𝑧) ∈ 𝐴) → 𝐹:ω⟶𝐴) |
| 13 | 8, 10, 12 | sylancr 598 | . 2 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → 𝐹:ω⟶𝐴) |
| 14 | 6 | unblem3 9250 | . . 3 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → (𝑧 ∈ ω → (𝐹‘𝑧) ∈ (𝐹‘suc 𝑧))) |
| 15 | 14 | ralrimiv 3156 | . 2 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → ∀𝑧 ∈ ω (𝐹‘𝑧) ∈ (𝐹‘suc 𝑧)) |
| 16 | omsmo 8640 | . 2 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑧 ∈ ω (𝐹‘𝑧) ∈ (𝐹‘suc 𝑧)) → 𝐹:ω–1-1→𝐴) | |
| 17 | 4, 13, 15, 16 | syl21anc 850 | 1 ⊢ ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣 ∈ 𝐴 𝑤 ∈ 𝑣) → 𝐹:ω–1-1→𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ∃wrex 3089 Vcvv 3455 ∖ cdif 3902 ⊆ wss 3905 ∩ cint 4912 ↦ cmpt 5192 ↾ cres 5663 Oncon0 6360 suc csuc 6362 Fn wfn 6531 ⟶wf 6532 –1-1→wf1 6533 ‘cfv 6536 ωcom 7858 reccrdg 8392 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 |
| This theorem is referenced by: unbnn 9252 |
| Copyright terms: Public domain | W3C validator |