Theorem ballotlemfval 35205

Description: The value of 𝐹. (Contributed by Thierry Arnoux, 23-Nov-2016.)

Hypotheses

Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotth.o	⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
ballotth.p	⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotlemfval.c	⊢ (𝜑 → 𝐶 ∈ 𝑂)
ballotlemfval.j	⊢ (𝜑 → 𝐽 ∈ ℤ)

Assertion

Ref	Expression
ballotlemfval	⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))

Distinct variable groups:   𝑀,𝑐   𝑁,𝑐   𝑂,𝑐   𝑖,𝑀   𝑖,𝑁   𝑖,𝑂,𝑐   𝐹,𝑐,𝑖   𝐶,𝑖   𝑖,𝐽   𝜑,𝑖

Allowed substitution hints:   𝜑(𝑥, 𝑐)   𝐶(𝑥, 𝑐)   𝑃(𝑥, 𝑖, 𝑐)   𝐹(𝑥)   𝐽(𝑥, 𝑐)   𝑀(𝑥)   𝑁(𝑥)   𝑂(𝑥)

Proof of Theorem ballotlemfval

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ballotlemfval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑂)
2		simpl 488	. . . . . . . 8 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → 𝑏 = 𝐶)
3	2	ineq2d 4120	. . . . . . 7 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((1...𝑖) ∩ 𝑏) = ((1...𝑖) ∩ 𝐶))
4	3	fveq2d 6915	. . . . . 6 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → (♯‘((1...𝑖) ∩ 𝑏)) = (♯‘((1...𝑖) ∩ 𝐶)))
5	2	difeq2d 4066	. . . . . . 7 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((1...𝑖) ∖ 𝑏) = ((1...𝑖) ∖ 𝐶))
6	5	fveq2d 6915	. . . . . 6 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → (♯‘((1...𝑖) ∖ 𝑏)) = (♯‘((1...𝑖) ∖ 𝐶)))
7	4, 6	oveq12d 7464	. . . . 5 ⊢ ((𝑏 = 𝐶 ∧ 𝑖 ∈ ℤ) → ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))) = ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))))
8	7	mpteq2dva 5202	. . . 4 ⊢ (𝑏 = 𝐶 → (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
9		ballotth.f	. . . . 5 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
10		ineq2 4114	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → ((1...𝑖) ∩ 𝑏) = ((1...𝑖) ∩ 𝑐))
11	10	fveq2d 6915	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (♯‘((1...𝑖) ∩ 𝑏)) = (♯‘((1...𝑖) ∩ 𝑐)))
12		difeq2 4060	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → ((1...𝑖) ∖ 𝑏) = ((1...𝑖) ∖ 𝑐))
13	12	fveq2d 6915	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (♯‘((1...𝑖) ∖ 𝑏)) = (♯‘((1...𝑖) ∖ 𝑐)))
14	11, 13	oveq12d 7464	. . . . . . 7 ⊢ (𝑏 = 𝑐 → ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))) = ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐))))
15	14	mpteq2dv 5203	. . . . . 6 ⊢ (𝑏 = 𝑐 → (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
16	15	cbvmptv 5213	. . . . 5 ⊢ (𝑏 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏))))) = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
17	9, 16	eqtr4i 2789	. . . 4 ⊢ 𝐹 = (𝑏 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑏)) − (♯‘((1...𝑖) ∖ 𝑏)))))
18		zex 12732	. . . . 5 ⊢ ℤ ∈ V
19	18	mptex 7255	. . . 4 ⊢ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))) ∈ V
20	8, 17, 19	fvmpt 7019	. . 3 ⊢ (𝐶 ∈ 𝑂 → (𝐹‘𝐶) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
21	1, 20	syl 18	. 2 ⊢ (𝜑 → (𝐹‘𝐶) = (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶)))))
22		oveq2 7454	. . . . . 6 ⊢ (𝑖 = 𝐽 → (1...𝑖) = (1...𝐽))
23	22	ineq1d 4119	. . . . 5 ⊢ (𝑖 = 𝐽 → ((1...𝑖) ∩ 𝐶) = ((1...𝐽) ∩ 𝐶))
24	23	fveq2d 6915	. . . 4 ⊢ (𝑖 = 𝐽 → (♯‘((1...𝑖) ∩ 𝐶)) = (♯‘((1...𝐽) ∩ 𝐶)))
25	22	difeq1d 4065	. . . . 5 ⊢ (𝑖 = 𝐽 → ((1...𝑖) ∖ 𝐶) = ((1...𝐽) ∖ 𝐶))
26	25	fveq2d 6915	. . . 4 ⊢ (𝑖 = 𝐽 → (♯‘((1...𝑖) ∖ 𝐶)) = (♯‘((1...𝐽) ∖ 𝐶)))
27	24, 26	oveq12d 7464	. . 3 ⊢ (𝑖 = 𝐽 → ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
28	27	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑖 = 𝐽) → ((♯‘((1...𝑖) ∩ 𝐶)) − (♯‘((1...𝑖) ∖ 𝐶))) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))
29		ballotlemfval.j	. 2 ⊢ (𝜑 → 𝐽 ∈ ℤ)
30		ovexd 7481	. 2 ⊢ (𝜑 → ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))) ∈ V)
31	21, 28, 29, 30	fvmptd 7027	1 ⊢ (𝜑 → ((𝐹‘𝐶)‘𝐽) = ((♯‘((1...𝐽) ∩ 𝐶)) − (♯‘((1...𝐽) ∖ 𝐶))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092  𝒫 cpw 4560   ↦ cmpt 5190  ‘cfv 6561  (class class class)co 7446  1c1 11231   + caddc 11233   − cmin 11571   / cdiv 12003  ℕcn 12365  ℤcz 12723  ...cfz 13669  ♯chash 14504

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-cnex 11286  ax-resscn 11287

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-neg 11574  df-z 12724

This theorem is used by:  ballotlemfelz  35206  ballotlemfp1  35207  ballotlemfmpn  35210  ballotlemfval0  35211  ballotlemfg  35241  ballotlemfrc  35242