Theorem hashfibc 11232

Description: The binomial coefficient counts the number of subsets of a finite set of a given size. This is Metamath 100 proof #58 (formula for the number of combinations). For more on the notation for subsets of a given size, see sseqn 11228. (Contributed by Mario Carneiro, 13-Jul-2014.)

Assertion

Ref	Expression
hashfibc	⊢ ((𝐴 ∈ Fin ∧ 𝐾 ∈ ℤ) → ((♯‘𝐴)C𝐾) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾}))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐾

Proof of Theorem hashfibc

Dummy variables 𝑘 𝑤 𝑦 𝑧 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 5675	. . . . . 6 ⊢ (𝑤 = ∅ → (♯‘𝑤) = (♯‘∅))
2	1	oveq1d 6073	. . . . 5 ⊢ (𝑤 = ∅ → ((♯‘𝑤)C𝑘) = ((♯‘∅)C𝑘))
3		pweq 3677	. . . . . . . 8 ⊢ (𝑤 = ∅ → 𝒫 𝑤 = 𝒫 ∅)
4	3	ineq1d 3425	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝒫 𝑤 ∩ Fin) = (𝒫 ∅ ∩ Fin))
5	4	rabeqdv 2809	. . . . . 6 ⊢ (𝑤 = ∅ → {𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
6	5	fveq2d 5679	. . . . 5 ⊢ (𝑤 = ∅ → (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
7	2, 6	eqeq12d 2249	. . . 4 ⊢ (𝑤 = ∅ → (((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
8	7	ralbidv 2544	. . 3 ⊢ (𝑤 = ∅ → (∀𝑘 ∈ ℤ ((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ∀𝑘 ∈ ℤ ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
9		fveq2 5675	. . . . . 6 ⊢ (𝑤 = 𝑦 → (♯‘𝑤) = (♯‘𝑦))
10	9	oveq1d 6073	. . . . 5 ⊢ (𝑤 = 𝑦 → ((♯‘𝑤)C𝑘) = ((♯‘𝑦)C𝑘))
11		pweq 3677	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → 𝒫 𝑤 = 𝒫 𝑦)
12	11	ineq1d 3425	. . . . . . 7 ⊢ (𝑤 = 𝑦 → (𝒫 𝑤 ∩ Fin) = (𝒫 𝑦 ∩ Fin))
13	12	rabeqdv 2809	. . . . . 6 ⊢ (𝑤 = 𝑦 → {𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
14	13	fveq2d 5679	. . . . 5 ⊢ (𝑤 = 𝑦 → (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
15	10, 14	eqeq12d 2249	. . . 4 ⊢ (𝑤 = 𝑦 → (((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘𝑦)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
16	15	ralbidv 2544	. . 3 ⊢ (𝑤 = 𝑦 → (∀𝑘 ∈ ℤ ((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ∀𝑘 ∈ ℤ ((♯‘𝑦)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
17		fveq2 5675	. . . . . 6 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (♯‘𝑤) = (♯‘(𝑦 ∪ {𝑧})))
18	17	oveq1d 6073	. . . . 5 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → ((♯‘𝑤)C𝑘) = ((♯‘(𝑦 ∪ {𝑧}))C𝑘))
19		pweq 3677	. . . . . . . 8 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → 𝒫 𝑤 = 𝒫 (𝑦 ∪ {𝑧}))
20	19	ineq1d 3425	. . . . . . 7 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (𝒫 𝑤 ∩ Fin) = (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin))
21	20	rabeqdv 2809	. . . . . 6 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → {𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
22	21	fveq2d 5679	. . . . 5 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
23	18, 22	eqeq12d 2249	. . . 4 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
24	23	ralbidv 2544	. . 3 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (∀𝑘 ∈ ℤ ((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ∀𝑘 ∈ ℤ ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
25		fveq2 5675	. . . . . 6 ⊢ (𝑤 = 𝐴 → (♯‘𝑤) = (♯‘𝐴))
26	25	oveq1d 6073	. . . . 5 ⊢ (𝑤 = 𝐴 → ((♯‘𝑤)C𝑘) = ((♯‘𝐴)C𝑘))
27		pweq 3677	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → 𝒫 𝑤 = 𝒫 𝐴)
28	27	ineq1d 3425	. . . . . . 7 ⊢ (𝑤 = 𝐴 → (𝒫 𝑤 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
29	28	rabeqdv 2809	. . . . . 6 ⊢ (𝑤 = 𝐴 → {𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
30	29	fveq2d 5679	. . . . 5 ⊢ (𝑤 = 𝐴 → (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
31	26, 30	eqeq12d 2249	. . . 4 ⊢ (𝑤 = 𝐴 → (((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘𝐴)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
32	31	ralbidv 2544	. . 3 ⊢ (𝑤 = 𝐴 → (∀𝑘 ∈ ℤ ((♯‘𝑤)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑤 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ∀𝑘 ∈ ℤ ((♯‘𝐴)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
33		0nn0 9528	. . . . . . . . 9 ⊢ 0 ∈ ℕ0
34		bcn0 11142	. . . . . . . . 9 ⊢ (0 ∈ ℕ0 → (0C0) = 1)
35	33, 34	ax-mp 5	. . . . . . . 8 ⊢ (0C0) = 1
36		hash0 11184	. . . . . . . . . 10 ⊢ (♯‘∅) = 0
37	36	a1i 9	. . . . . . . . 9 ⊢ (𝑘 ∈ (0...0) → (♯‘∅) = 0)
38		elfz1eq 10389	. . . . . . . . 9 ⊢ (𝑘 ∈ (0...0) → 𝑘 = 0)
39	37, 38	oveq12d 6076	. . . . . . . 8 ⊢ (𝑘 ∈ (0...0) → ((♯‘∅)C𝑘) = (0C0))
40	38	eqcomd 2240	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (0...0) → 0 = 𝑘)
41		pw0 3846	. . . . . . . . . . . . . . 15 ⊢ 𝒫 ∅ = {∅}
42	41	raleqi 2747	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝒫 ∅(♯‘𝑥) = 𝑘 ↔ ∀𝑥 ∈ {∅} (♯‘𝑥) = 𝑘)
43		0ex 4242	. . . . . . . . . . . . . . 15 ⊢ ∅ ∈ V
44		fveq2 5675	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = ∅ → (♯‘𝑥) = (♯‘∅))
45	44, 36	eqtrdi 2283	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = ∅ → (♯‘𝑥) = 0)
46	45	eqeq1d 2243	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = ∅ → ((♯‘𝑥) = 𝑘 ↔ 0 = 𝑘))
47	43, 46	ralsn 3737	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ {∅} (♯‘𝑥) = 𝑘 ↔ 0 = 𝑘)
48	42, 47	bitri 184	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝒫 ∅(♯‘𝑥) = 𝑘 ↔ 0 = 𝑘)
49	40, 48	sylibr 134	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (0...0) → ∀𝑥 ∈ 𝒫 ∅(♯‘𝑥) = 𝑘)
50		rabid2 2723	. . . . . . . . . . . 12 ⊢ (𝒫 ∅ = {𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘} ↔ ∀𝑥 ∈ 𝒫 ∅(♯‘𝑥) = 𝑘)
51	49, 50	sylibr 134	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (0...0) → 𝒫 ∅ = {𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘})
52	51, 41	eqtr3di 2282	. . . . . . . . . 10 ⊢ (𝑘 ∈ (0...0) → {𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘} = {∅})
53	52	fveq2d 5679	. . . . . . . . 9 ⊢ (𝑘 ∈ (0...0) → (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}) = (♯‘{∅}))
54		hashsng 11186	. . . . . . . . . 10 ⊢ (∅ ∈ V → (♯‘{∅}) = 1)
55	43, 54	ax-mp 5	. . . . . . . . 9 ⊢ (♯‘{∅}) = 1
56	53, 55	eqtrdi 2283	. . . . . . . 8 ⊢ (𝑘 ∈ (0...0) → (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}) = 1)
57	35, 39, 56	3eqtr4a 2293	. . . . . . 7 ⊢ (𝑘 ∈ (0...0) → ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}))
58	57	adantl 277	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ 𝑘 ∈ (0...0)) → ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}))
59	36	oveq1i 6068	. . . . . . 7 ⊢ ((♯‘∅)C𝑘) = (0C𝑘)
60		bcval3 11138	. . . . . . . . 9 ⊢ ((0 ∈ ℕ0 ∧ 𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → (0C𝑘) = 0)
61	33, 60	mp3an1 1361	. . . . . . . 8 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → (0C𝑘) = 0)
62		id 19	. . . . . . . . . . . . . . 15 ⊢ (0 = 𝑘 → 0 = 𝑘)
63		0z 9605	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℤ
64		elfz3 10388	. . . . . . . . . . . . . . . 16 ⊢ (0 ∈ ℤ → 0 ∈ (0...0))
65	63, 64	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ (0...0)
66	62, 65	eqeltrrdi 2326	. . . . . . . . . . . . . 14 ⊢ (0 = 𝑘 → 𝑘 ∈ (0...0))
67	66	con3i 637	. . . . . . . . . . . . 13 ⊢ (¬ 𝑘 ∈ (0...0) → ¬ 0 = 𝑘)
68	67	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → ¬ 0 = 𝑘)
69	41	raleqi 2747	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝒫 ∅ ¬ (♯‘𝑥) = 𝑘 ↔ ∀𝑥 ∈ {∅} ¬ (♯‘𝑥) = 𝑘)
70	46	notbid 673	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ∅ → (¬ (♯‘𝑥) = 𝑘 ↔ ¬ 0 = 𝑘))
71	43, 70	ralsn 3737	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ {∅} ¬ (♯‘𝑥) = 𝑘 ↔ ¬ 0 = 𝑘)
72	69, 71	bitri 184	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ 𝒫 ∅ ¬ (♯‘𝑥) = 𝑘 ↔ ¬ 0 = 𝑘)
73	68, 72	sylibr 134	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → ∀𝑥 ∈ 𝒫 ∅ ¬ (♯‘𝑥) = 𝑘)
74		rabeq0 3542	. . . . . . . . . . 11 ⊢ ({𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘} = ∅ ↔ ∀𝑥 ∈ 𝒫 ∅ ¬ (♯‘𝑥) = 𝑘)
75	73, 74	sylibr 134	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → {𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘} = ∅)
76	75	fveq2d 5679	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}) = (♯‘∅))
77	76, 36	eqtrdi 2283	. . . . . . . 8 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}) = 0)
78	61, 77	eqtr4d 2270	. . . . . . 7 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → (0C𝑘) = (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}))
79	59, 78	eqtrid 2279	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ ¬ 𝑘 ∈ (0...0)) → ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}))
80		0zd 9606	. . . . . . . 8 ⊢ (𝑘 ∈ ℤ → 0 ∈ ℤ)
81		fzdcel 10394	. . . . . . . 8 ⊢ ((𝑘 ∈ ℤ ∧ 0 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑘 ∈ (0...0))
82	80, 80, 81	mpd3an23 1376	. . . . . . 7 ⊢ (𝑘 ∈ ℤ → DECID 𝑘 ∈ (0...0))
83		exmiddc 844	. . . . . . 7 ⊢ (DECID 𝑘 ∈ (0...0) → (𝑘 ∈ (0...0) ∨ ¬ 𝑘 ∈ (0...0)))
84	82, 83	syl 14	. . . . . 6 ⊢ (𝑘 ∈ ℤ → (𝑘 ∈ (0...0) ∨ ¬ 𝑘 ∈ (0...0)))
85	58, 79, 84	mpjaodan 806	. . . . 5 ⊢ (𝑘 ∈ ℤ → ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}))
86		velsn 3711	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {∅} ↔ 𝑥 = ∅)
87		0fi 7154	. . . . . . . . . . . 12 ⊢ ∅ ∈ Fin
88		eleq1 2297	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑥 ∈ Fin ↔ ∅ ∈ Fin))
89	87, 88	mpbiri 168	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → 𝑥 ∈ Fin)
90	86, 89	sylbi 121	. . . . . . . . . 10 ⊢ (𝑥 ∈ {∅} → 𝑥 ∈ Fin)
91	90, 41	eleq2s 2329	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝒫 ∅ → 𝑥 ∈ Fin)
92	91	ssriv 3246	. . . . . . . 8 ⊢ 𝒫 ∅ ⊆ Fin
93		dfss 3228	. . . . . . . 8 ⊢ (𝒫 ∅ ⊆ Fin ↔ 𝒫 ∅ = (𝒫 ∅ ∩ Fin))
94	92, 93	mpbi 145	. . . . . . 7 ⊢ 𝒫 ∅ = (𝒫 ∅ ∩ Fin)
95	94	rabeqi 2808	. . . . . 6 ⊢ {𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘}
96	95	fveq2i 5678	. . . . 5 ⊢ (♯‘{𝑥 ∈ 𝒫 ∅ ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
97	85, 96	eqtrdi 2283	. . . 4 ⊢ (𝑘 ∈ ℤ → ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
98	97	rgen 2597	. . 3 ⊢ ∀𝑘 ∈ ℤ ((♯‘∅)C𝑘) = (♯‘{𝑥 ∈ (𝒫 ∅ ∩ Fin) ∣ (♯‘𝑥) = 𝑘})
99		oveq2 6066	. . . . . 6 ⊢ (𝑘 = 𝑗 → ((♯‘𝑦)C𝑘) = ((♯‘𝑦)C𝑗))
100		eqeq2 2244	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → ((♯‘𝑥) = 𝑘 ↔ (♯‘𝑥) = 𝑗))
101	100	rabbidv 2804	. . . . . . . 8 ⊢ (𝑘 = 𝑗 → {𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗})
102		fveqeq2 5684	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((♯‘𝑥) = 𝑗 ↔ (♯‘𝑧) = 𝑗))
103	102	cbvrabv 2814	. . . . . . . 8 ⊢ {𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗} = {𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}
104	101, 103	eqtrdi 2283	. . . . . . 7 ⊢ (𝑘 = 𝑗 → {𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗})
105	104	fveq2d 5679	. . . . . 6 ⊢ (𝑘 = 𝑗 → (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))
106	99, 105	eqeq12d 2249	. . . . 5 ⊢ (𝑘 = 𝑗 → (((♯‘𝑦)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗})))
107	106	cbvralvw 2784	. . . 4 ⊢ (∀𝑘 ∈ ℤ ((♯‘𝑦)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))
108		simpll 527	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → 𝑦 ∈ Fin)
109		simplr 529	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → ¬ 𝑧 ∈ 𝑦)
110		simprr 533	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))
111	103	fveq2i 5678	. . . . . . . . . 10 ⊢ (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗}) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗})
112	111	eqeq2i 2245	. . . . . . . . 9 ⊢ (((♯‘𝑦)C𝑗) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗}) ↔ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))
113	112	ralbii 2550	. . . . . . . 8 ⊢ (∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗}) ↔ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))
114	110, 113	sylibr 134	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑗}))
115		simprl 531	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → 𝑘 ∈ ℤ)
116	108, 109, 114, 115	hashfibclem 11231	. . . . . 6 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝑘 ∈ ℤ ∧ ∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}))) → ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
117	116	expr 375	. . . . 5 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ 𝑘 ∈ ℤ) → (∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}) → ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
118	117	ralrimdva 2624	. . . 4 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (∀𝑗 ∈ ℤ ((♯‘𝑦)C𝑗) = (♯‘{𝑧 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑧) = 𝑗}) → ∀𝑘 ∈ ℤ ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
119	107, 118	biimtrid 152	. . 3 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (∀𝑘 ∈ ℤ ((♯‘𝑦)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝑦 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) → ∀𝑘 ∈ ℤ ((♯‘(𝑦 ∪ {𝑧}))C𝑘) = (♯‘{𝑥 ∈ (𝒫 (𝑦 ∪ {𝑧}) ∩ Fin) ∣ (♯‘𝑥) = 𝑘})))
120	8, 16, 24, 32, 98, 119	findcard2s 7160	. 2 ⊢ (𝐴 ∈ Fin → ∀𝑘 ∈ ℤ ((♯‘𝐴)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}))
121		oveq2 6066	. . . 4 ⊢ (𝑘 = 𝐾 → ((♯‘𝐴)C𝑘) = ((♯‘𝐴)C𝐾))
122		eqeq2 2244	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((♯‘𝑥) = 𝑘 ↔ (♯‘𝑥) = 𝐾))
123	122	rabbidv 2804	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘} = {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾})
124	123	fveq2d 5679	. . . 4 ⊢ (𝑘 = 𝐾 → (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾}))
125	121, 124	eqeq12d 2249	. . 3 ⊢ (𝑘 = 𝐾 → (((♯‘𝐴)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ↔ ((♯‘𝐴)C𝐾) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾})))
126	125	rspccva 2922	. 2 ⊢ ((∀𝑘 ∈ ℤ ((♯‘𝐴)C𝑘) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑘}) ∧ 𝐾 ∈ ℤ) → ((♯‘𝐴)C𝐾) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾}))
127	120, 126	sylan 283	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐾 ∈ ℤ) → ((♯‘𝐴)C𝐾) = (♯‘{𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝐾}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 716  DECID wdc 842   = wceq 1398   ∈ wcel 2205  ∀wral 2522  {crab 2526  Vcvv 2815   ∪ cun 3212   ∩ cin 3213   ⊆ wss 3214  ∅c0 3512  𝒫 cpw 3674  {csn 3694  ‘cfv 5357  (class class class)co 6058  Fincfn 6988  0cc0 8143  1c1 8144  ℕ₀cn0 9513  ℤcz 9594  ...cfz 10361  Ccbc 11134  ♯chash 11163

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-frec 6635  df-1o 6660  df-2o 6661  df-oadd 6664  df-er 6780  df-map 6897  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-fz 10362  df-seqfrec 10834  df-fac 11113  df-bc 11135  df-ihash 11164

This theorem is referenced by:  ballotfilem1  13164  ballotfilem2  13172