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 9334 | . . . . . 6 ⊢ ω ∈ On | |
2 | nnenom 13628 | . . . . . . 7 ⊢ ℕ ≈ ω | |
3 | 2 | ensymi 8745 | . . . . . 6 ⊢ ω ≈ ℕ |
4 | isnumi 9635 | . . . . . 6 ⊢ ((ω ∈ On ∧ ω ≈ ℕ) → ℕ ∈ dom card) | |
5 | 1, 3, 4 | mp2an 688 | . . . . 5 ⊢ ℕ ∈ dom card |
6 | xpnum 9640 | . . . . 5 ⊢ ((ℕ ∈ dom card ∧ ℕ ∈ dom card) → (ℕ × ℕ) ∈ dom card) | |
7 | 5, 5, 6 | mp2an 688 | . . . 4 ⊢ (ℕ × ℕ) ∈ dom card |
8 | subf 11153 | . . . . . . 7 ⊢ − :(ℂ × ℂ)⟶ℂ | |
9 | ffun 6587 | . . . . . . 7 ⊢ ( − :(ℂ × ℂ)⟶ℂ → Fun − ) | |
10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ Fun − |
11 | nnsscn 11908 | . . . . . . . 8 ⊢ ℕ ⊆ ℂ | |
12 | xpss12 5595 | . . . . . . . 8 ⊢ ((ℕ ⊆ ℂ ∧ ℕ ⊆ ℂ) → (ℕ × ℕ) ⊆ (ℂ × ℂ)) | |
13 | 11, 11, 12 | mp2an 688 | . . . . . . 7 ⊢ (ℕ × ℕ) ⊆ (ℂ × ℂ) |
14 | 8 | fdmi 6596 | . . . . . . 7 ⊢ dom − = (ℂ × ℂ) |
15 | 13, 14 | sseqtrri 3954 | . . . . . 6 ⊢ (ℕ × ℕ) ⊆ dom − |
16 | fores 6682 | . . . . . 6 ⊢ ((Fun − ∧ (ℕ × ℕ) ⊆ dom − ) → ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) | |
17 | 10, 15, 16 | mp2an 688 | . . . . 5 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)) |
18 | dfz2 12268 | . . . . . 6 ⊢ ℤ = ( − “ (ℕ × ℕ)) | |
19 | foeq3 6670 | . . . . . 6 ⊢ (ℤ = ( − “ (ℕ × ℕ)) → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ)))) | |
20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ ↔ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→( − “ (ℕ × ℕ))) |
21 | 17, 20 | mpbir 230 | . . . 4 ⊢ ( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ |
22 | fodomnum 9744 | . . . 4 ⊢ ((ℕ × ℕ) ∈ dom card → (( − ↾ (ℕ × ℕ)):(ℕ × ℕ)–onto→ℤ → ℤ ≼ (ℕ × ℕ))) | |
23 | 7, 21, 22 | mp2 9 | . . 3 ⊢ ℤ ≼ (ℕ × ℕ) |
24 | xpnnen 15848 | . . 3 ⊢ (ℕ × ℕ) ≈ ℕ | |
25 | domentr 8754 | . . 3 ⊢ ((ℤ ≼ (ℕ × ℕ) ∧ (ℕ × ℕ) ≈ ℕ) → ℤ ≼ ℕ) | |
26 | 23, 24, 25 | mp2an 688 | . 2 ⊢ ℤ ≼ ℕ |
27 | zex 12258 | . . 3 ⊢ ℤ ∈ V | |
28 | nnssz 12270 | . . 3 ⊢ ℕ ⊆ ℤ | |
29 | ssdomg 8741 | . . 3 ⊢ (ℤ ∈ V → (ℕ ⊆ ℤ → ℕ ≼ ℤ)) | |
30 | 27, 28, 29 | mp2 9 | . 2 ⊢ ℕ ≼ ℤ |
31 | sbth 8833 | . 2 ⊢ ((ℤ ≼ ℕ ∧ ℕ ≼ ℤ) → ℤ ≈ ℕ) | |
32 | 26, 30, 31 | mp2an 688 | 1 ⊢ ℤ ≈ ℕ |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ⊆ wss 3883 class class class wbr 5070 × cxp 5578 dom cdm 5580 ↾ cres 5582 “ cima 5583 Oncon0 6251 Fun wfun 6412 ⟶wf 6414 –onto→wfo 6416 ωcom 7687 ≈ cen 8688 ≼ cdom 8689 cardccrd 9624 ℂcc 10800 − cmin 11135 ℕcn 11903 ℤcz 12249 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-oadd 8271 df-omul 8272 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-oi 9199 df-card 9628 df-acn 9631 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 |
This theorem is referenced by: qnnen 15850 odinf 19085 odhash 19094 cygctb 19408 iscmet3 24362 dyadmbl 24669 mbfsup 24733 dya2iocct 32147 zenom 42489 |
Copyright terms: Public domain | W3C validator |