Theorem fzennn 14011

Description: The cardinality of a finite set of sequential integers. (See om2uz0i 13990 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 7420	. . 3 ⊢ (𝑛 = 0 → (1...𝑛) = (1...0))
2		fveq2 6881	. . 3 ⊢ (𝑛 = 0 → (◡𝐺‘𝑛) = (◡𝐺‘0))
3	1, 2	breq12d 5121	. 2 ⊢ (𝑛 = 0 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...0) ≈ (◡𝐺‘0)))
4		oveq2 7420	. . 3 ⊢ (𝑛 = 𝑚 → (1...𝑛) = (1...𝑚))
5		fveq2 6881	. . 3 ⊢ (𝑛 = 𝑚 → (◡𝐺‘𝑛) = (◡𝐺‘𝑚))
6	4, 5	breq12d 5121	. 2 ⊢ (𝑛 = 𝑚 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑚) ≈ (◡𝐺‘𝑚)))
7		oveq2 7420	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (1...𝑛) = (1...(𝑚 + 1)))
8		fveq2 6881	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (◡𝐺‘𝑛) = (◡𝐺‘(𝑚 + 1)))
9	7, 8	breq12d 5121	. 2 ⊢ (𝑛 = (𝑚 + 1) → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
10		oveq2 7420	. . 3 ⊢ (𝑛 = 𝑁 → (1...𝑛) = (1...𝑁))
11		fveq2 6881	. . 3 ⊢ (𝑛 = 𝑁 → (◡𝐺‘𝑛) = (◡𝐺‘𝑁))
12	10, 11	breq12d 5121	. 2 ⊢ (𝑛 = 𝑁 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑁) ≈ (◡𝐺‘𝑁)))
13		0ex 5269	. . . 4 ⊢ ∅ ∈ V
14	13	enref 8980	. . 3 ⊢ ∅ ≈ ∅
15		fz10 13579	. . 3 ⊢ (1...0) = ∅
16		0z 12608	. . . . . 6 ⊢ 0 ∈ ℤ
17		fzennn.1	. . . . . 6 ⊢ 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), 0) ↾ ω)
18	16, 17	om2uzf1oi 13996	. . . . 5 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘0)
19		peano1 7883	. . . . 5 ⊢ ∅ ∈ ω
20	18, 19	pm3.2i 475	. . . 4 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω)
21	16, 17	om2uz0i 13990	. . . 4 ⊢ (𝐺‘∅) = 0
22		f1ocnvfv 7276	. . . 4 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅))
23	20, 21, 22	mp2 9	. . 3 ⊢ (◡𝐺‘0) = ∅
24	14, 15, 23	3brtr4i 5140	. 2 ⊢ (1...0) ≈ (◡𝐺‘0)
25		simpr 489	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...𝑚) ≈ (◡𝐺‘𝑚))
26		ovex 7445	. . . . . . 7 ⊢ (𝑚 + 1) ∈ V
27		fvex 6894	. . . . . . 7 ⊢ (◡𝐺‘𝑚) ∈ V
28		en2sn 9036	. . . . . . 7 ⊢ (((𝑚 + 1) ∈ V ∧ (◡𝐺‘𝑚) ∈ V) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
29	26, 27, 28	mp2an 704	. . . . . 6 ⊢ {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)}
30	29	a1i 11	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
31		fzp1disj 13618	. . . . . 6 ⊢ ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅
32	31	a1i 11	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅)
33		f1ocnvdm 7283	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (◡𝐺‘𝑚) ∈ ω)
34	18, 33	mpan 702	. . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ≥‘0) → (◡𝐺‘𝑚) ∈ ω)
35		nn0uz 12906	. . . . . . . . 9 ⊢ ℕ0 = (ℤ≥‘0)
36	34, 35	eleq2s 2880	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘𝑚) ∈ ω)
37		nnord 7868	. . . . . . . 8 ⊢ ((◡𝐺‘𝑚) ∈ ω → Ord (◡𝐺‘𝑚))
38		ordirr 6378	. . . . . . . 8 ⊢ (Ord (◡𝐺‘𝑚) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
39	36, 37, 38	3syl 19	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
40	39	adantr 485	. . . . . 6 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
41		disjsn 4676	. . . . . 6 ⊢ (((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅ ↔ ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
42	40, 41	sylibr 237	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)
43		unen 9040	. . . . 5 ⊢ ((((1...𝑚) ≈ (◡𝐺‘𝑚) ∧ {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)}) ∧ (((1...𝑚) ∩ {(𝑚 + 1)}) = ∅ ∧ ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
44	25, 30, 32, 42, 43	syl22anc 851	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
45		1z 12630	. . . . . 6 ⊢ 1 ∈ ℤ
46		1m1e0 12319	. . . . . . . . . 10 ⊢ (1 − 1) = 0
47	46	fveq2i 6884	. . . . . . . . 9 ⊢ (ℤ≥‘(1 − 1)) = (ℤ≥‘0)
48	35, 47	eqtr4i 2788	. . . . . . . 8 ⊢ ℕ0 = (ℤ≥‘(1 − 1))
49	48	eleq2i 2854	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘(1 − 1)))
50	49	biimpi 219	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘(1 − 1)))
51		fzsuc2 13617	. . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝑚 ∈ (ℤ≥‘(1 − 1))) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
52	45, 50, 51	sylancr 598	. . . . 5 ⊢ (𝑚 ∈ ℕ0 → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
53	52	adantr 485	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
54		peano2 7884	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → suc (◡𝐺‘𝑚) ∈ ω)
55	36, 54	syl 18	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → suc (◡𝐺‘𝑚) ∈ ω)
56	55, 18	jctil 528	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω))
57	16, 17	om2uzsuci 13991	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
58	36, 57	syl 18	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
59	35	eleq2i 2854	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘0))
60	59	biimpi 219	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘0))
61		f1ocnvfv2 7275	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
62	18, 60, 61	sylancr 598	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
63	62	oveq1d 7427	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → ((𝐺‘(◡𝐺‘𝑚)) + 1) = (𝑚 + 1))
64	58, 63	eqtrd 2797	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1))
65		f1ocnvfv 7276	. . . . . . 7 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚)))
66	56, 64, 65	sylc 66	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
67	66	adantr 485	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
68		df-suc 6366	. . . . 5 ⊢ suc (◡𝐺‘𝑚) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)})
69	67, 68	eqtrdi 2813	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
70	44, 53, 69	3brtr4d 5142	. . 3 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1)))
71	70	ex 417	. 2 ⊢ (𝑚 ∈ ℕ0 → ((1...𝑚) ≈ (◡𝐺‘𝑚) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
72	3, 6, 9, 12, 24, 71	nn0ind 12697	1 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ≈ (◡𝐺‘𝑁))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454   ∪ cun 3902   ∩ cin 3903  ∅c0 4285  {csn 4588   class class class wbr 5108   ↦ cmpt 5191  ^◡ccnv 5659   ↾ cres 5662  Ord word 6359  suc csuc 6362  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7412  ωcom 7860  reccrdg 8394   ≈ cen 8938  0cc0 11106  1c1 11107   + caddc 11109   − cmin 11447  ℕ₀cn0 12510  ℤcz 12597  ℤ_≥cuz 12868  ...cfz 13541

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-er 8692  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255  df-sub 11449  df-neg 11450  df-nn 12240  df-n0 12511  df-z 12598  df-uz 12869  df-fz 13542

This theorem is used by:  fzen2  14012  cardfz  14013