| 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 9558 | . . . . . 6 ⊢ ω ∈ On | |
| 2 | nnenom 13933 | . . . . . . 7 ⊢ ℕ ≈ ω | |
| 3 | 2 | ensymi 8941 | . . . . . 6 ⊢ ω ≈ ℕ |
| 4 | isnumi 9861 | . . . . . 6 ⊢ ((ω ∈ On ∧ ω ≈ ℕ) → ℕ ∈ dom card) | |
| 5 | 1, 3, 4 | mp2an 698 | . . . . 5 ⊢ ℕ ∈ dom card |
| 6 | xpnum 9866 | . . . . 5 ⊢ ((ℕ ∈ dom card ∧ ℕ ∈ dom card) → (ℕ × ℕ) ∈ dom card) | |
| 7 | 5, 5, 6 | mp2an 698 | . . . 4 ⊢ (ℕ × ℕ) ∈ dom card |
| 8 | subf 11386 | . . . . . . 7 ⊢ − :(ℂ × ℂ)⟶ℂ | |
| 9 | ffun 6658 | . . . . . . 7 ⊢ ( − :(ℂ × ℂ)⟶ℂ → Fun − ) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ Fun − |
| 11 | nnsscn 12170 | . . . . . . . 8 ⊢ ℕ ⊆ ℂ | |
| 12 | xpss12 5633 | . . . . . . . 8 ⊢ ((ℕ ⊆ ℂ ∧ ℕ ⊆ ℂ) → (ℕ × ℕ) ⊆ (ℂ × ℂ)) | |
| 13 | 11, 11, 12 | mp2an 698 | . . . . . . 7 ⊢ (ℕ × ℕ) ⊆ (ℂ × ℂ) |
| 14 | 8 | fdmi 6666 | . . . . . . 7 ⊢ dom − = (ℂ × ℂ) |
| 15 | 13, 14 | sseqtrri 3964 | . . . . . 6 ⊢ (ℕ × ℕ) ⊆ dom − |
| 16 | fores 6749 | . . . . . 6 ⊢ ((Fun − ∧ (ℕ × ℕ) ⊆ dom − ) → ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) | |
| 17 | 10, 15, 16 | mp2an 698 | . . . . 5 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)) |
| 18 | dfz2 12534 | . . . . . 6 ⊢ ℤ = ( − “ (ℕ × ℕ)) | |
| 19 | foeq3 6737 | . . . . . 6 ⊢ (ℤ = ( − “ (ℕ × ℕ)) → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)))) | |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) |
| 21 | 17, 20 | mpbir 232 | . . . 4 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ |
| 22 | fodomnum 9970 | . . . 4 ⊢ ((ℕ × ℕ) ∈ dom card → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ → ℤ ≼ (ℕ × ℕ))) | |
| 23 | 7, 21, 22 | mp2 9 | . . 3 ⊢ ℤ ≼ (ℕ × ℕ) |
| 24 | xpnnen 16169 | . . 3 ⊢ (ℕ × ℕ) ≈ ℕ | |
| 25 | domentr 8950 | . . 3 ⊢ ((ℤ ≼ (ℕ × ℕ) ∧ (ℕ × ℕ) ≈ ℕ) → ℤ ≼ ℕ) | |
| 26 | 23, 24, 25 | mp2an 698 | . 2 ⊢ ℤ ≼ ℕ |
| 27 | zex 12524 | . . 3 ⊢ ℤ ∈ V | |
| 28 | nnssz 12537 | . . 3 ⊢ ℕ ⊆ ℤ | |
| 29 | ssdomg 8937 | . . 3 ⊢ (ℤ ∈ V → (ℕ ⊆ ℤ → ℕ ≼ ℤ)) | |
| 30 | 27, 28, 29 | mp2 9 | . 2 ⊢ ℕ ≼ ℤ |
| 31 | sbth 9025 | . 2 ⊢ ((ℤ ≼ ℕ ∧ ℕ ≼ ℤ) → ℤ ≈ ℕ) | |
| 32 | 26, 30, 31 | mp2an 698 | 1 ⊢ ℤ ≈ ℕ |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ⊆ wss 3883 class class class wbr 5072 × cxp 5616 dom cdm 5618 ↾ cres 5620 “ cima 5621 Oncon0 6310 Fun wfun 6479 ⟶wf 6481 –onto→wfo 6483 ωcom 7806 ≈ cen 8880 ≼ cdom 8881 cardccrd 9850 ℂcc 11027 − cmin 11368 ℕcn 12165 ℤcz 12515 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 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 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-oi 9415 df-card 9854 df-acn 9857 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-uz 12780 |
| This theorem is referenced by: qnnen 16171 ex-chn2 18595 odinf 19529 odhash 19540 cygctb 19858 iscmet3 25278 dyadmbl 25585 mbfsup 25649 dya2iocct 34464 zenom 45500 |
| Copyright terms: Public domain | W3C validator |