Theorem frecfzennn 9720

Description: The cardinality of a finite set of sequential integers. (See frec2uz0d 9693 for a description of the hypothesis.) (Contributed by Jim Kingdon, 18-May-2020.)

Hypothesis

Ref	Expression
frecfzennn.1	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)

Assertion

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

Proof of Theorem frecfzennn

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

Step	Hyp	Ref	Expression
1		oveq2 5597	. . 3 ⊢ (𝑛 = 0 → (1...𝑛) = (1...0))
2		fveq2 5251	. . 3 ⊢ (𝑛 = 0 → (◡𝐺‘𝑛) = (◡𝐺‘0))
3	1, 2	breq12d 3824	. 2 ⊢ (𝑛 = 0 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...0) ≈ (◡𝐺‘0)))
4		oveq2 5597	. . 3 ⊢ (𝑛 = 𝑚 → (1...𝑛) = (1...𝑚))
5		fveq2 5251	. . 3 ⊢ (𝑛 = 𝑚 → (◡𝐺‘𝑛) = (◡𝐺‘𝑚))
6	4, 5	breq12d 3824	. 2 ⊢ (𝑛 = 𝑚 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑚) ≈ (◡𝐺‘𝑚)))
7		oveq2 5597	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (1...𝑛) = (1...(𝑚 + 1)))
8		fveq2 5251	. . 3 ⊢ (𝑛 = (𝑚 + 1) → (◡𝐺‘𝑛) = (◡𝐺‘(𝑚 + 1)))
9	7, 8	breq12d 3824	. 2 ⊢ (𝑛 = (𝑚 + 1) → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
10		oveq2 5597	. . 3 ⊢ (𝑛 = 𝑁 → (1...𝑛) = (1...𝑁))
11		fveq2 5251	. . 3 ⊢ (𝑛 = 𝑁 → (◡𝐺‘𝑛) = (◡𝐺‘𝑁))
12	10, 11	breq12d 3824	. 2 ⊢ (𝑛 = 𝑁 → ((1...𝑛) ≈ (◡𝐺‘𝑛) ↔ (1...𝑁) ≈ (◡𝐺‘𝑁)))
13		0ex 3931	. . . 4 ⊢ ∅ ∈ V
14	13	enref 6410	. . 3 ⊢ ∅ ≈ ∅
15		fz10 9353	. . 3 ⊢ (1...0) = ∅
16		0zd 8656	. . . . . . 7 ⊢ (⊤ → 0 ∈ ℤ)
17		frecfzennn.1	. . . . . . 7 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
18	16, 17	frec2uzf1od 9700	. . . . . 6 ⊢ (⊤ → 𝐺:ω–1-1-onto→(ℤ≥‘0))
19	18	trud 1294	. . . . 5 ⊢ 𝐺:ω–1-1-onto→(ℤ≥‘0)
20		peano1 4371	. . . . 5 ⊢ ∅ ∈ ω
21	19, 20	pm3.2i 266	. . . 4 ⊢ (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω)
22	16, 17	frec2uz0d 9693	. . . . 5 ⊢ (⊤ → (𝐺‘∅) = 0)
23	22	trud 1294	. . . 4 ⊢ (𝐺‘∅) = 0
24		f1ocnvfv 5496	. . . 4 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ ∅ ∈ ω) → ((𝐺‘∅) = 0 → (◡𝐺‘0) = ∅))
25	21, 23, 24	mp2 16	. . 3 ⊢ (◡𝐺‘0) = ∅
26	14, 15, 25	3brtr4i 3839	. 2 ⊢ (1...0) ≈ (◡𝐺‘0)
27		simpr 108	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...𝑚) ≈ (◡𝐺‘𝑚))
28		peano2nn0 8603	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝑚 + 1) ∈ ℕ0)
29		zex 8653	. . . . . . . . . . . . . . 15 ⊢ ℤ ∈ V
30	29	mptex 5461	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℤ ↦ (𝑥 + 1)) ∈ V
31		vex 2615	. . . . . . . . . . . . . 14 ⊢ 𝑧 ∈ V
32	30, 31	fvex 5268	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V
33	32	ax-gen 1379	. . . . . . . . . . . 12 ⊢ ∀𝑧((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V
34		0z 8655	. . . . . . . . . . . 12 ⊢ 0 ∈ ℤ
35		frecfnom 6096	. . . . . . . . . . . 12 ⊢ ((∀𝑧((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V ∧ 0 ∈ ℤ) → frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω)
36	33, 34, 35	mp2an 417	. . . . . . . . . . 11 ⊢ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω
37	17	fneq1i 5059	. . . . . . . . . . 11 ⊢ (𝐺 Fn ω ↔ frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω)
38	36, 37	mpbir 144	. . . . . . . . . 10 ⊢ 𝐺 Fn ω
39		omex 4370	. . . . . . . . . 10 ⊢ ω ∈ V
40		fnex 5457	. . . . . . . . . 10 ⊢ ((𝐺 Fn ω ∧ ω ∈ V) → 𝐺 ∈ V)
41	38, 39, 40	mp2an 417	. . . . . . . . 9 ⊢ 𝐺 ∈ V
42	41	cnvex 4921	. . . . . . . 8 ⊢ ◡𝐺 ∈ V
43		vex 2615	. . . . . . . 8 ⊢ 𝑚 ∈ V
44	42, 43	fvex 5268	. . . . . . 7 ⊢ (◡𝐺‘𝑚) ∈ V
45		en2sn 6458	. . . . . . 7 ⊢ (((𝑚 + 1) ∈ ℕ0 ∧ (◡𝐺‘𝑚) ∈ V) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
46	28, 44, 45	sylancl 404	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
47	46	adantr 270	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)})
48		fzp1disj 9385	. . . . . 6 ⊢ ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅
49	48	a1i 9	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∩ {(𝑚 + 1)}) = ∅)
50		f1ocnvdm 5498	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (◡𝐺‘𝑚) ∈ ω)
51	19, 50	mpan 415	. . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ≥‘0) → (◡𝐺‘𝑚) ∈ ω)
52		nn0uz 8946	. . . . . . . . 9 ⊢ ℕ0 = (ℤ≥‘0)
53	51, 52	eleq2s 2177	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘𝑚) ∈ ω)
54		nnord 4388	. . . . . . . 8 ⊢ ((◡𝐺‘𝑚) ∈ ω → Ord (◡𝐺‘𝑚))
55		ordirr 4320	. . . . . . . 8 ⊢ (Ord (◡𝐺‘𝑚) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
56	53, 54, 55	3syl 17	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
57	56	adantr 270	. . . . . 6 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
58		disjsn 3478	. . . . . 6 ⊢ (((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅ ↔ ¬ (◡𝐺‘𝑚) ∈ (◡𝐺‘𝑚))
59	57, 58	sylibr 132	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)
60		unen 6461	. . . . 5 ⊢ ((((1...𝑚) ≈ (◡𝐺‘𝑚) ∧ {(𝑚 + 1)} ≈ {(◡𝐺‘𝑚)}) ∧ (((1...𝑚) ∩ {(𝑚 + 1)}) = ∅ ∧ ((◡𝐺‘𝑚) ∩ {(◡𝐺‘𝑚)}) = ∅)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
61	27, 47, 49, 59, 60	syl22anc 1171	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → ((1...𝑚) ∪ {(𝑚 + 1)}) ≈ ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
62		1z 8670	. . . . . 6 ⊢ 1 ∈ ℤ
63		1m1e0 8383	. . . . . . . . . 10 ⊢ (1 − 1) = 0
64	63	fveq2i 5254	. . . . . . . . 9 ⊢ (ℤ≥‘(1 − 1)) = (ℤ≥‘0)
65	52, 64	eqtr4i 2106	. . . . . . . 8 ⊢ ℕ0 = (ℤ≥‘(1 − 1))
66	65	eleq2i 2149	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘(1 − 1)))
67	66	biimpi 118	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘(1 − 1)))
68		fzsuc2 9384	. . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝑚 ∈ (ℤ≥‘(1 − 1))) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
69	62, 67, 68	sylancr 405	. . . . 5 ⊢ (𝑚 ∈ ℕ0 → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
70	69	adantr 270	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) = ((1...𝑚) ∪ {(𝑚 + 1)}))
71		peano2 4372	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → suc (◡𝐺‘𝑚) ∈ ω)
72	53, 71	syl 14	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → suc (◡𝐺‘𝑚) ∈ ω)
73	72, 19	jctil 305	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω))
74		0zd 8656	. . . . . . . . . 10 ⊢ ((◡𝐺‘𝑚) ∈ ω → 0 ∈ ℤ)
75		id 19	. . . . . . . . . 10 ⊢ ((◡𝐺‘𝑚) ∈ ω → (◡𝐺‘𝑚) ∈ ω)
76	74, 17, 75	frec2uzsucd 9695	. . . . . . . . 9 ⊢ ((◡𝐺‘𝑚) ∈ ω → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
77	53, 76	syl 14	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = ((𝐺‘(◡𝐺‘𝑚)) + 1))
78	52	eleq2i 2149	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ0 ↔ 𝑚 ∈ (ℤ≥‘0))
79	78	biimpi 118	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ0 → 𝑚 ∈ (ℤ≥‘0))
80		f1ocnvfv2 5495	. . . . . . . . . 10 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
81	19, 79, 80	sylancr 405	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘(◡𝐺‘𝑚)) = 𝑚)
82	81	oveq1d 5604	. . . . . . . 8 ⊢ (𝑚 ∈ ℕ0 → ((𝐺‘(◡𝐺‘𝑚)) + 1) = (𝑚 + 1))
83	77, 82	eqtrd 2115	. . . . . . 7 ⊢ (𝑚 ∈ ℕ0 → (𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1))
84		f1ocnvfv 5496	. . . . . . 7 ⊢ ((𝐺:ω–1-1-onto→(ℤ≥‘0) ∧ suc (◡𝐺‘𝑚) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝑚)) = (𝑚 + 1) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚)))
85	73, 83, 84	sylc 61	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
86	85	adantr 270	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = suc (◡𝐺‘𝑚))
87		df-suc 4161	. . . . 5 ⊢ suc (◡𝐺‘𝑚) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)})
88	86, 87	syl6eq 2131	. . . 4 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (◡𝐺‘(𝑚 + 1)) = ((◡𝐺‘𝑚) ∪ {(◡𝐺‘𝑚)}))
89	61, 70, 88	3brtr4d 3841	. . 3 ⊢ ((𝑚 ∈ ℕ0 ∧ (1...𝑚) ≈ (◡𝐺‘𝑚)) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1)))
90	89	ex 113	. 2 ⊢ (𝑚 ∈ ℕ0 → ((1...𝑚) ≈ (◡𝐺‘𝑚) → (1...(𝑚 + 1)) ≈ (◡𝐺‘(𝑚 + 1))))
91	3, 6, 9, 12, 26, 90	nn0ind 8754	1 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ≈ (◡𝐺‘𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 102  ∀wal 1283   = wceq 1285  ⊤wtru 1286   ∈ wcel 1434  Vcvv 2612   ∪ cun 2982   ∩ cin 2983  ∅c0 3269  {csn 3422   class class class wbr 3811   ↦ cmpt 3865  Ord word 4152  suc csuc 4155  ωcom 4367  ^◡ccnv 4398   Fn wfn 4962  –1-1-onto→wf1o 4966  ‘cfv 4967  (class class class)co 5589  freccfrec 6085   ≈ cen 6383  0cc0 7251  1c1 7252   + caddc 7254   − cmin 7554  ℕ₀cn0 8563  ℤcz 8644  ℤ_≥cuz 8912  ...cfz 9317

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3919  ax-sep 3922  ax-nul 3930  ax-pow 3974  ax-pr 3999  ax-un 4223  ax-setind 4315  ax-iinf 4365  ax-cnex 7337  ax-resscn 7338  ax-1cn 7339  ax-1re 7340  ax-icn 7341  ax-addcl 7342  ax-addrcl 7343  ax-mulcl 7344  ax-addcom 7346  ax-addass 7348  ax-distr 7350  ax-i2m1 7351  ax-0lt1 7352  ax-0id 7354  ax-rnegex 7355  ax-cnre 7357  ax-pre-ltirr 7358  ax-pre-ltwlin 7359  ax-pre-lttrn 7360  ax-pre-apti 7361  ax-pre-ltadd 7362

This theorem depends on definitions:  df-bi 115  df-3or 921  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-nel 2345  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2614  df-sbc 2827  df-csb 2920  df-dif 2986  df-un 2988  df-in 2990  df-ss 2997  df-nul 3270  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-int 3663  df-iun 3706  df-br 3812  df-opab 3866  df-mpt 3867  df-tr 3902  df-id 4083  df-iord 4156  df-on 4158  df-ilim 4159  df-suc 4161  df-iom 4368  df-xp 4405  df-rel 4406  df-cnv 4407  df-co 4408  df-dm 4409  df-rn 4410  df-res 4411  df-ima 4412  df-iota 4932  df-fun 4969  df-fn 4970  df-f 4971  df-f1 4972  df-fo 4973  df-f1o 4974  df-fv 4975  df-riota 5545  df-ov 5592  df-oprab 5593  df-mpt2 5594  df-recs 6000  df-frec 6086  df-1o 6111  df-er 6220  df-en 6386  df-pnf 7425  df-mnf 7426  df-xr 7427  df-ltxr 7428  df-le 7429  df-sub 7556  df-neg 7557  df-inn 8315  df-n0 8564  df-z 8645  df-uz 8913  df-fz 9318

This theorem is referenced by:  frecfzen2  9721  hashfz1  10024