| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > znnen | Structured version Visualization version GIF version | ||
| Description: The set of integers and the set of positive integers are equinumerous. Exercise 1 of [Gleason] p. 140. (Contributed by NM, 31-Jul-2004.) (Proof shortened by Mario Carneiro, 13-Jun-2014.) |
| Ref | Expression |
|---|---|
| znnen | ⊢ ℤ ≈ ℕ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omelon 9626 | . . . . . 6 ⊢ ω ∈ On | |
| 2 | nnenom 14045 | . . . . . . 7 ⊢ ℕ ≈ ω | |
| 3 | 2 | ensymi 9011 | . . . . . 6 ⊢ ω ≈ ℕ |
| 4 | isnumi 9952 | . . . . . 6 ⊢ ((ω ∈ On ∧ ω ≈ ℕ) → ℕ ∈ dom card) | |
| 5 | 1, 3, 4 | mp2an 705 | . . . . 5 ⊢ ℕ ∈ dom card |
| 6 | xpnum 9957 | . . . . 5 ⊢ ((ℕ ∈ dom card ∧ ℕ ∈ dom card) → (ℕ × ℕ) ∈ dom card) | |
| 7 | 5, 5, 6 | mp2an 705 | . . . 4 ⊢ (ℕ × ℕ) ∈ dom card |
| 8 | subf 11484 | . . . . . . 7 ⊢ − :(ℂ × ℂ)⟶ℂ | |
| 9 | ffun 6706 | . . . . . . 7 ⊢ ( − :(ℂ × ℂ)⟶ℂ → Fun − ) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ Fun − |
| 11 | nnsscn 12263 | . . . . . . . 8 ⊢ ℕ ⊆ ℂ | |
| 12 | xpss12 5670 | . . . . . . . 8 ⊢ ((ℕ ⊆ ℂ ∧ ℕ ⊆ ℂ) → (ℕ × ℕ) ⊆ (ℂ × ℂ)) | |
| 13 | 11, 11, 12 | mp2an 705 | . . . . . . 7 ⊢ (ℕ × ℕ) ⊆ (ℂ × ℂ) |
| 14 | 8 | fdmi 6715 | . . . . . . 7 ⊢ dom − = (ℂ × ℂ) |
| 15 | 13, 14 | sseqtrri 3980 | . . . . . 6 ⊢ (ℕ × ℕ) ⊆ dom − |
| 16 | fores 6800 | . . . . . 6 ⊢ ((Fun − ∧ (ℕ × ℕ) ⊆ dom − ) → ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) | |
| 17 | 10, 15, 16 | mp2an 705 | . . . . 5 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)) |
| 18 | dfz2 12635 | . . . . . 6 ⊢ ℤ = ( − “ (ℕ × ℕ)) | |
| 19 | foeq3 6788 | . . . . . 6 ⊢ (ℤ = ( − “ (ℕ × ℕ)) → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)))) | |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) |
| 21 | 17, 20 | mpbir 234 | . . . 4 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ |
| 22 | fodomnum 10061 | . . . 4 ⊢ ((ℕ × ℕ) ∈ dom card → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ → ℤ ≼ (ℕ × ℕ))) | |
| 23 | 7, 21, 22 | mp2 9 | . . 3 ⊢ ℤ ≼ (ℕ × ℕ) |
| 24 | xpnnen 16300 | . . 3 ⊢ (ℕ × ℕ) ≈ ℕ | |
| 25 | domentr 9020 | . . 3 ⊢ ((ℤ ≼ (ℕ × ℕ) ∧ (ℕ × ℕ) ≈ ℕ) → ℤ ≼ ℕ) | |
| 26 | 23, 24, 25 | mp2an 705 | . 2 ⊢ ℤ ≼ ℕ |
| 27 | zex 12625 | . . 3 ⊢ ℤ ∈ V | |
| 28 | nnssz 12638 | . . 3 ⊢ ℕ ⊆ ℤ | |
| 29 | ssdomg 9007 | . . 3 ⊢ (ℤ ∈ V → (ℕ ⊆ ℤ → ℕ ≼ ℤ)) | |
| 30 | 27, 28, 29 | mp2 9 | . 2 ⊢ ℕ ≼ ℤ |
| 31 | sbth 9096 | . 2 ⊢ ((ℤ ≼ ℕ ∧ ℕ ≼ ℤ) → ℤ ≈ ℕ) | |
| 32 | 26, 30, 31 | mp2an 705 | 1 ⊢ ℤ ≈ ℕ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ⊆ wss 3899 class class class wbr 5103 × cxp 5653 dom cdm 5655 ↾ cres 5657 “ cima 5658 Oncon0 6357 Fun wfun 6527 ⟶wf 6529 –onto→wfo 6531 ωcom 7863 ≈ cen 8950 ≼ cdom 8951 cardccrd 9941 ℂcc 11123 − cmin 11466 ℕcn 12258 ℤcz 12616 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-inf2 9621 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-oadd 8460 df-omul 8461 df-er 8697 df-map 8829 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-oi 9483 df-card 9945 df-acn 9948 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-n0 12530 df-z 12617 df-uz 12889 |
| This theorem is used by: qnnen 16302 ex-chn2 18727 odinf 19691 odhash 19702 cygctb 20020 iscmet3 25522 dyadmbl 25829 mbfsup 25893 dya2iocct 34792 zenom 45887 |
| Copyright terms: Public domain | W3C validator |