| 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 9654 | . . . . . 6 ⊢ ω ∈ On | |
| 2 | nnenom 14130 | . . . . . . 7 ⊢ ℕ ≈ ω | |
| 3 | 2 | ensymi 9039 | . . . . . 6 ⊢ ω ≈ ℕ |
| 4 | isnumi 10034 | . . . . . 6 ⊢ ((ω ∈ On ∧ ω ≈ ℕ) → ℕ ∈ dom card) | |
| 5 | 1, 3, 4 | mp2an 705 | . . . . 5 ⊢ ℕ ∈ dom card |
| 6 | xpnum 10039 | . . . . 5 ⊢ ((ℕ ∈ dom card ∧ ℕ ∈ dom card) → (ℕ × ℕ) ∈ dom card) | |
| 7 | 5, 5, 6 | mp2an 705 | . . . 4 ⊢ (ℕ × ℕ) ∈ dom card |
| 8 | subf 11566 | . . . . . . 7 ⊢ − :(ℂ × ℂ)⟶ℂ | |
| 9 | ffun 6717 | . . . . . . 7 ⊢ ( − :(ℂ × ℂ)⟶ℂ → Fun − ) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ Fun − |
| 11 | nnsscn 12347 | . . . . . . . 8 ⊢ ℕ ⊆ ℂ | |
| 12 | xpss12 5666 | . . . . . . . 8 ⊢ ((ℕ ⊆ ℂ ∧ ℕ ⊆ ℂ) → (ℕ × ℕ) ⊆ (ℂ × ℂ)) | |
| 13 | 11, 11, 12 | mp2an 705 | . . . . . . 7 ⊢ (ℕ × ℕ) ⊆ (ℂ × ℂ) |
| 14 | 8 | fdmi 6726 | . . . . . . 7 ⊢ dom − = (ℂ × ℂ) |
| 15 | 13, 14 | sseqtrri 3958 | . . . . . 6 ⊢ (ℕ × ℕ) ⊆ dom − |
| 16 | fores 6811 | . . . . . 6 ⊢ ((Fun − ∧ (ℕ × ℕ) ⊆ dom − ) → ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) | |
| 17 | 10, 15, 16 | mp2an 705 | . . . . 5 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)) |
| 18 | dfz2 12719 | . . . . . 6 ⊢ ℤ = ( − “ (ℕ × ℕ)) | |
| 19 | foeq3 6799 | . . . . . 6 ⊢ (ℤ = ( − “ (ℕ × ℕ)) → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)))) | |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) |
| 21 | 17, 20 | mpbir 234 | . . . 4 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ |
| 22 | fodomnum 10143 | . . . 4 ⊢ ((ℕ × ℕ) ∈ dom card → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ → ℤ ≼ (ℕ × ℕ))) | |
| 23 | 7, 21, 22 | mp2 9 | . . 3 ⊢ ℤ ≼ (ℕ × ℕ) |
| 24 | xpnnen 16388 | . . 3 ⊢ (ℕ × ℕ) ≈ ℕ | |
| 25 | domentr 9048 | . . 3 ⊢ ((ℤ ≼ (ℕ × ℕ) ∧ (ℕ × ℕ) ≈ ℕ) → ℤ ≼ ℕ) | |
| 26 | 23, 24, 25 | mp2an 705 | . 2 ⊢ ℤ ≼ ℕ |
| 27 | zex 12709 | . . 3 ⊢ ℤ ∈ V | |
| 28 | nnssz 12722 | . . 3 ⊢ ℕ ⊆ ℤ | |
| 29 | ssdomg 9035 | . . 3 ⊢ (ℤ ∈ V → (ℕ ⊆ ℤ → ℕ ≼ ℤ)) | |
| 30 | 27, 28, 29 | mp2 9 | . 2 ⊢ ℕ ≼ ℤ |
| 31 | sbth 9124 | . 2 ⊢ ((ℤ ≼ ℕ ∧ ℕ ≼ ℤ) → ℤ ≈ ℕ) | |
| 32 | 26, 30, 31 | mp2an 705 | 1 ⊢ ℤ ≈ ℕ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3896 class class class wbr 5102 × cxp 5649 dom cdm 5651 ↾ cres 5653 “ cima 5654 Oncon0 6365 Fun wfun 6537 ⟶wf 6539 –onto→wfo 6541 ωcom 7881 ≈ cen 8978 ≼ cdom 8979 cardccrd 10023 ℂcc 11205 − cmin 11548 ℕcn 12342 ℤcz 12700 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-inf2 9649 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-oadd 8488 df-omul 8489 df-er 8725 df-map 8857 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-oi 9511 df-card 10027 df-acn 10030 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-n0 12614 df-z 12701 df-uz 12973 |
| This theorem is used by: qnnen 16390 ex-chn2 18821 odinf 19786 odhash 19797 cygctb 20115 iscmet3 25623 dyadmbl 25930 mbfsup 25994 dya2iocct 34962 zenom 46205 |
| Copyright terms: Public domain | W3C validator |