Theorem fzennn 13616

Description: The cardinality of a finite set of sequential integers. (See om2uz0i 13595 for a description of the hypothesis.) (Contributed by Mario Carneiro, 12-Feb-2013.) (Revised by Mario Carneiro, 7-Mar-2014.)

Hypothesis

Ref	Expression
fzennn.1	⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)

Assertion

Ref	Expression
fzennn	⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ≈ (◡𝐺‘𝑁))

Proof of Theorem fzennn

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7263	. . 3 ⊢ (𝑛 = 0 → (1...𝑛) = (1...0))
2		fveq2 6756	. . 3 ⊢ (𝑛 = 0 → (◡𝐺‘𝑛) = (◡𝐺‘0))
3	1, 2	breq12d 5083	. 2 ⊢ (𝑛 = 0 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...0) ≈ (◡𝐺‘0)))
4		oveq2 7263	. . 3 ⊢ (𝑛 = 𝑚 → (1...𝑛) = (1...𝑚))
5		fveq2 6756	. . 3 ⊢ (𝑛 = 𝑚 → (◡𝐺‘𝑛) = (◡𝐺‘𝑚))
6	4, 5	breq12d 5083	. 2 ⊢ (𝑛 = 𝑚 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑚) ≈ (◡𝐺‘𝑚)))
7		oveq2 7263	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (1...𝑛) = (1...(𝑚 + 1)))
8		fveq2 6756	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (◡𝐺‘𝑛) = (◡𝐺‘(𝑚 + 1)))
9	7, 8	breq12d 5083	. 2 ⊢ (𝑛 = (𝑚 + 1) → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
10		oveq2 7263	. . 3 ⊢ (𝑛 = 𝑁 → (1...𝑛) = (1...𝑁))
11		fveq2 6756	. . 3 ⊢ (𝑛 = 𝑁 → (◡𝐺‘𝑛) = (◡𝐺‘𝑁))
12	10, 11	breq12d 5083	. 2 ⊢ (𝑛 = 𝑁 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑁) ≈ (◡𝐺‘𝑁)))
13		0ex 5226	. . . 4 ⊢ ∅ ∈ V
14	13	enref 8728	. . 3 ⊢ ∅ ≈ ∅
15		fz10 13206	. . 3 ⊢ (1...0) = ∅
16		0z 12260	. . . . . 6 ⊢ 0 ∈ ℤ
17		fzennn.1	. . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)
18	16, 17	om2uzf1oi 13601	. . . . 5 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘0)
19		peano1 7710	. . . . 5 ⊢ ∅ ∈ ω
20	18, 19	pm3.2i 470	. . . 4 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω)
21	16, 17	om2uz0i 13595	. . . 4 ⊢ (𝐺‘∅) = 0
22		f1ocnvfv 7131	. . . 4 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅))
23	20, 21, 22	mp2 9	. . 3 ⊢ (◡𝐺‘0) = ∅
24	14, 15, 23	3brtr4i 5100	. 2 ⊢ (1...0) ≈ (◡𝐺‘0)
25		simpr 484	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...𝑚) ≈ (◡𝐺‘𝑚))
26		ovex 7288	. . . . . . 7 ⊢ (𝑚 + 1) ∈ V
27		fvex 6769	. . . . . . 7 ⊢ (◡𝐺‘𝑚) ∈ V
28		en2sn 8785	. . . . . . 7 ⊢ (((𝑚 + 1) ∈ V ∧ (◡𝐺‘𝑚) ∈ V) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
29	26, 27, 28	mp2an 688	. . . . . 6 ⊢ {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)}
30	29	a1i 11	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
31		fzp1disj 13244	. . . . . 6 ⊢ ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅
32	31	a1i 11	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅)
33		f1ocnvdm 7137	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (◡𝐺‘𝑚) ∈ ω)
34	18, 33	mpan 686	. . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ≥‘0) → (◡𝐺‘𝑚) ∈ ω)
35		nn0uz 12549	. . . . . . . . 9 ⊢ ℕ0 = (ℤ≥‘0)
36	34, 35	eleq2s 2857	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘𝑚) ∈ ω)
37		nnord 7695	. . . . . . . 8 ⊢ ((◡𝐺‘𝑚) ∈ ω → Ord (◡𝐺‘𝑚))
38		ordirr 6269	. . . . . . . 8 ⊢ (Ord (◡𝐺‘𝑚) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
39	36, 37, 38	3syl 18	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
40	39	adantr 480	. . . . . 6 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
41		disjsn 4644	. . . . . 6 ⊢ (((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅ ↔ ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
42	40, 41	sylibr 233	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)
43		unen 8790	. . . . 5 ⊢ ((((1...𝑚) ≈ (◡𝐺‘𝑚) ∧ {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)}) ∧ (((1...𝑚) ∩ {(𝑚 + 1)}) = ∅ ∧ ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
44	25, 30, 32, 42, 43	syl22anc 835	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
45		1z 12280	. . . . . 6 ⊢ 1 ∈ ℤ
46		1m1e0 11975	. . . . . . . . . 10 ⊢ (1 − 1) = 0
47	46	fveq2i 6759	. . . . . . . . 9 ⊢ (ℤ≥‘(1 − 1)) = (ℤ≥‘0)
48	35, 47	eqtr4i 2769	. . . . . . . 8 ⊢ ℕ0 = (ℤ≥‘(1 − 1))
49	48	eleq2i 2830	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘(1 − 1)))
50	49	biimpi 215	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘(1 − 1)))
51		fzsuc2 13243	. . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝑚 ∈ (ℤ≥‘(1 − 1))) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
52	45, 50, 51	sylancr 586	. . . . 5 ⊢ (𝑚 ∈ ℕ0 → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
53	52	adantr 480	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
54		peano2 7711	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → suc (◡𝐺‘𝑚) ∈ ω)
55	36, 54	syl 17	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → suc (◡𝐺‘𝑚) ∈ ω)
56	55, 18	jctil 519	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω))
57	16, 17	om2uzsuci 13596	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
58	36, 57	syl 17	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
59	35	eleq2i 2830	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘0))
60	59	biimpi 215	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘0))
61		f1ocnvfv2 7130	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
62	18, 60, 61	sylancr 586	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
63	62	oveq1d 7270	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → ((𝐺‘(◡𝐺‘𝑚)) + 1) = (𝑚 + 1))
64	58, 63	eqtrd 2778	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1))
65		f1ocnvfv 7131	. . . . . . 7 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚)))
66	56, 64, 65	sylc 65	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
67	66	adantr 480	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
68		df-suc 6257	. . . . 5 ⊢ suc (◡𝐺‘𝑚) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)})
69	67, 68	eqtrdi 2795	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
70	44, 53, 69	3brtr4d 5102	. . 3 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1)))
71	70	ex 412	. 2 ⊢ (𝑚 ∈ ℕ0 → ((1...𝑚) ≈ (◡𝐺‘𝑚) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
72	3, 6, 9, 12, 24, 71	nn0ind 12345	1 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ≈ (◡𝐺‘𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1539   ∈ wcel 2108  Vcvv 3422   ∪ cun 3881   ∩ cin 3882  ∅c0 4253  {csn 4558   class class class wbr 5070   ↦ cmpt 5153  ^◡ccnv 5579   ↾ cres 5582  Ord word 6250  suc csuc 6253  –1-1-onto→wf1o 6417  ‘cfv 6418  (class class class)co 7255  ωcom 7687  reccrdg 8211   ≈ cen 8688  0cc0 10802  1c1 10803   + caddc 10805   − cmin 11135  ℕ₀cn0 12163  ℤcz 12249  ℤ_≥cuz 12511  ...cfz 13168

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-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  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-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-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-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-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-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  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  df-fz 13169

This theorem is referenced by:  fzen2  13617  cardfz  13618