![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cardfz | Structured version Visualization version GIF version |
Description: The cardinality of a finite set of sequential integers. (See om2uz0i 12608 for a description of the hypothesis.) (Contributed by NM, 7-Nov-2008.) (Revised by Mario Carneiro, 15-Sep-2013.) |
Ref | Expression |
---|---|
fzennn.1 | ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω) |
Ref | Expression |
---|---|
cardfz | ⊢ (𝑁 ∈ ℕ0 → (card‘(1...𝑁)) = (◡𝐺‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzennn.1 | . . . 4 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω) | |
2 | 1 | fzennn 12629 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ≈ (◡𝐺‘𝑁)) |
3 | carden2b 8676 | . . 3 ⊢ ((1...𝑁) ≈ (◡𝐺‘𝑁) → (card‘(1...𝑁)) = (card‘(◡𝐺‘𝑁))) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ0 → (card‘(1...𝑁)) = (card‘(◡𝐺‘𝑁))) |
5 | 0z 11265 | . . . . 5 ⊢ 0 ∈ ℤ | |
6 | 5, 1 | om2uzf1oi 12614 | . . . 4 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘0) |
7 | elnn0uz 11601 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (ℤ≥‘0)) | |
8 | 7 | biimpi 205 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘0)) |
9 | f1ocnvdm 6440 | . . . 4 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘0)) → (◡𝐺‘𝑁) ∈ ω) | |
10 | 6, 8, 9 | sylancr 694 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (◡𝐺‘𝑁) ∈ ω) |
11 | cardnn 8672 | . . 3 ⊢ ((◡𝐺‘𝑁) ∈ ω → (card‘(◡𝐺‘𝑁)) = (◡𝐺‘𝑁)) | |
12 | 10, 11 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ0 → (card‘(◡𝐺‘𝑁)) = (◡𝐺‘𝑁)) |
13 | 4, 12 | eqtrd 2644 | 1 ⊢ (𝑁 ∈ ℕ0 → (card‘(1...𝑁)) = (◡𝐺‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 Vcvv 3173 class class class wbr 4583 ↦ cmpt 4643 ◡ccnv 5037 ↾ cres 5040 –1-1-onto→wf1o 5803 ‘cfv 5804 (class class class)co 6549 ωcom 6957 reccrdg 7392 ≈ cen 7838 cardccrd 8644 0cc0 9815 1c1 9816 + caddc 9818 ℕ0cn0 11169 ℤ≥cuz 11563 ...cfz 12197 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 |
This theorem is referenced by: hashfz1 12996 |
Copyright terms: Public domain | W3C validator |