| 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 9553 | . . . . . 6 ⊢ ω ∈ On | |
| 2 | nnenom 13901 | . . . . . . 7 ⊢ ℕ ≈ ω | |
| 3 | 2 | ensymi 8939 | . . . . . 6 ⊢ ω ≈ ℕ |
| 4 | isnumi 9856 | . . . . . 6 ⊢ ((ω ∈ On ∧ ω ≈ ℕ) → ℕ ∈ dom card) | |
| 5 | 1, 3, 4 | mp2an 692 | . . . . 5 ⊢ ℕ ∈ dom card |
| 6 | xpnum 9861 | . . . . 5 ⊢ ((ℕ ∈ dom card ∧ ℕ ∈ dom card) → (ℕ × ℕ) ∈ dom card) | |
| 7 | 5, 5, 6 | mp2an 692 | . . . 4 ⊢ (ℕ × ℕ) ∈ dom card |
| 8 | subf 11380 | . . . . . . 7 ⊢ − :(ℂ × ℂ)⟶ℂ | |
| 9 | ffun 6663 | . . . . . . 7 ⊢ ( − :(ℂ × ℂ)⟶ℂ → Fun − ) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ Fun − |
| 11 | nnsscn 12148 | . . . . . . . 8 ⊢ ℕ ⊆ ℂ | |
| 12 | xpss12 5637 | . . . . . . . 8 ⊢ ((ℕ ⊆ ℂ ∧ ℕ ⊆ ℂ) → (ℕ × ℕ) ⊆ (ℂ × ℂ)) | |
| 13 | 11, 11, 12 | mp2an 692 | . . . . . . 7 ⊢ (ℕ × ℕ) ⊆ (ℂ × ℂ) |
| 14 | 8 | fdmi 6671 | . . . . . . 7 ⊢ dom − = (ℂ × ℂ) |
| 15 | 13, 14 | sseqtrri 3981 | . . . . . 6 ⊢ (ℕ × ℕ) ⊆ dom − |
| 16 | fores 6754 | . . . . . 6 ⊢ ((Fun − ∧ (ℕ × ℕ) ⊆ dom − ) → ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) | |
| 17 | 10, 15, 16 | mp2an 692 | . . . . 5 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)) |
| 18 | dfz2 12505 | . . . . . 6 ⊢ ℤ = ( − “ (ℕ × ℕ)) | |
| 19 | foeq3 6742 | . . . . . 6 ⊢ (ℤ = ( − “ (ℕ × ℕ)) → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)))) | |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) |
| 21 | 17, 20 | mpbir 231 | . . . 4 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ |
| 22 | fodomnum 9965 | . . . 4 ⊢ ((ℕ × ℕ) ∈ dom card → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ → ℤ ≼ (ℕ × ℕ))) | |
| 23 | 7, 21, 22 | mp2 9 | . . 3 ⊢ ℤ ≼ (ℕ × ℕ) |
| 24 | xpnnen 16134 | . . 3 ⊢ (ℕ × ℕ) ≈ ℕ | |
| 25 | domentr 8948 | . . 3 ⊢ ((ℤ ≼ (ℕ × ℕ) ∧ (ℕ × ℕ) ≈ ℕ) → ℤ ≼ ℕ) | |
| 26 | 23, 24, 25 | mp2an 692 | . 2 ⊢ ℤ ≼ ℕ |
| 27 | zex 12495 | . . 3 ⊢ ℤ ∈ V | |
| 28 | nnssz 12508 | . . 3 ⊢ ℕ ⊆ ℤ | |
| 29 | ssdomg 8935 | . . 3 ⊢ (ℤ ∈ V → (ℕ ⊆ ℤ → ℕ ≼ ℤ)) | |
| 30 | 27, 28, 29 | mp2 9 | . 2 ⊢ ℕ ≼ ℤ |
| 31 | sbth 9023 | . 2 ⊢ ((ℤ ≼ ℕ ∧ ℕ ≼ ℤ) → ℤ ≈ ℕ) | |
| 32 | 26, 30, 31 | mp2an 692 | 1 ⊢ ℤ ≈ ℕ |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ⊆ wss 3899 class class class wbr 5096 × cxp 5620 dom cdm 5622 ↾ cres 5624 “ cima 5625 Oncon0 6315 Fun wfun 6484 ⟶wf 6486 –onto→wfo 6488 ωcom 7806 ≈ cen 8878 ≼ cdom 8879 cardccrd 9845 ℂcc 11022 − cmin 11362 ℕcn 12143 ℤcz 12486 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-inf2 9548 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-oadd 8399 df-omul 8400 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-oi 9413 df-card 9849 df-acn 9852 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 |
| This theorem is referenced by: qnnen 16136 ex-chn2 18559 odinf 19490 odhash 19501 cygctb 19819 iscmet3 25247 dyadmbl 25555 mbfsup 25619 dya2iocct 34386 zenom 45239 |
| Copyright terms: Public domain | W3C validator |